Julian Blank

ORCID: 0000-0002-2227-6476
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Multi-Objective Optimization Algorithms
  • Metaheuristic Optimization Algorithms Research
  • Evolutionary Algorithms and Applications
  • Vehicle Routing Optimization Methods
  • Topology Optimization in Engineering
  • Optimal Experimental Design Methods
  • Software Engineering Techniques and Practices
  • Electric Motor Design and Analysis
  • Optimization and Packing Problems
  • Advanced Manufacturing and Logistics Optimization
  • Optimization and Mathematical Programming
  • Probabilistic and Robust Engineering Design
  • Heat Transfer and Optimization
  • Scheduling and Optimization Algorithms
  • Manufacturing Process and Optimization
  • Energy Efficiency and Management
  • Software System Performance and Reliability
  • Model Reduction and Neural Networks
  • Advanced Optimization Algorithms Research
  • Software-Defined Networks and 5G
  • Spacecraft Design and Technology
  • Smart Grid Energy Management
  • Optimization and Search Problems
  • Water-Energy-Food Nexus Studies
  • Forest Biomass Utilization and Management

Michigan State University
2018-2024

Otto-von-Guericke University Magdeburg
2017

Kaiser Permanente
1994

Python has become the programming language of choice for research and industry projects related to data science, machine learning, deep learning. Since optimization is an inherent part these fields, more frameworks have arisen in past few years. Only a them support multiple conflicting objectives at time, but do not provide comprehensive tools complete multi-objective task. To address this issue, we developed pymoo, framework Python. We guide getting started with our by demonstrating...

10.1109/access.2020.2990567 article EN cc-by IEEE Access 2020-01-01

Most evolutionary many-objective optimization (EMaO) algorithms start with a description of number the predefined set reference points on unit simplex. So far, most studies have used Das and Dennis's structured approach for generating well-spaced points. Due to highly nature procedure, this method cannot produce an arbitrary points, which is desired in EMaO application. Although layer-wise implementation has been suggested, EMO researchers always felt need more generic approach. Motivated by...

10.1109/tevc.2020.2992387 article EN IEEE Transactions on Evolutionary Computation 2020-05-05

The recent advances in evolutionary many-objective optimization (EMOs) have allowed for efficient ways of finding a number diverse trade-off solutions three to 15-objective problems. However, there are at least two reasons why the users are, some occasions, interested part, instead entire Pareto-optimal front. First, after analyzing obtained by an EMO algorithm, user may be concentrating specific preferred region front, either obtain additional interest or investigate nature region. Second,...

10.1109/ssci.2018.8628819 article EN 2021 IEEE Symposium Series on Computational Intelligence (SSCI) 2018-11-01

Researchers have spent a considerable effort in evaluating the goodness of solution set obtained by an evolutionary multi-objective algorithm. However, most performance metrics assume that knowledge exact Pareto-optimal is available. Also, evaluate algorithm's based on final set, which fails to capture their during intermediate generations. In this paper, we investigate running metric can be applied measure at any time algorithm execution and no true optimum needs known for computing metric....

10.1109/cec48606.2020.9185546 article EN 2022 IEEE Congress on Evolutionary Computation (CEC) 2020-07-01

Expensive objectives and constraints are key characteristics of real-world multi-objective optimization problems. In practice, they often occur jointly with inexpensive constraints. This paper presents the Inexpensive Objectives Constraints Self-Adapting Multi-Objective Constraint Optimization algorithm that uses Radial Basis function Approximations (IOC-SAMO-COBRA) for such is motivated by recently proposed Surrogate-Assisted Non-dominated Sorting Genetic Algorithm II (IC-SA-NSGA-II). These...

10.1016/j.swevo.2024.101508 article EN cc-by Swarm and Evolutionary Computation 2024-02-16

Bhuvan Khoshooa* , Julian Blankb Thang Q. Phama Kalyanmoy Deba & Shanelle N. Fostera a Department of Electrical and Computer Engineering, Michigan State University, East Lansing, USAb Science USA

10.1080/0305215x.2022.2152805 article EN Engineering Optimization 2023-01-12

Ali Ahrariab , Julian Blankb* Kalyanmoy Debb & Xianren Lica School of Engineering and Information Technology, University New South Wales, Canberra, Australiab Department Computer Science Engineering, Michigan State University, East Lansing, USAc Research Advanced Ford Motor Company, Dearborn, USA

10.1080/0305215x.2020.1808972 article EN Engineering Optimization 2020-09-09

Significant effort has been made to solve computationally expensive optimization problems in the past two decades, and various methods incorporating surrogates into have proposed. However, most toolboxes do not consist of ready-to-run algorithms for problems, especially combination with other key requirements, such as handling multiple conflicting objectives or constraints. Thus, lack appropriate software packages become a bottleneck solving real-world applications. The proposed framework,...

10.48550/arxiv.2204.05855 preprint EN other-oa arXiv (Cornell University) 2022-01-01

Metaheuristics are known to be effective for solving a broad category of optimization problems. However, most heuristics require different parameter settings appropriately problem class or even specific problem. Researchers address this commonly by performing tuning study (also as hyper-parameter optimization) developing control mechanism that changes parameters dynamically. Whereas is computationally expensive and limits the configuration stay constant throughout run, also challenging task...

10.1109/cec55065.2022.9870219 article EN 2022 IEEE Congress on Evolutionary Computation (CEC) 2022-07-18

In many practical multi-objective optimization problems, evaluations of objectives and constraints are computationally time-consuming because they require expensive simulations complicated models. this paper, we propose a metamodel-based evolutionary algorithm to make balance between error uncertainty progress. contrast other trust region methods, our method deals with multiple regions. These regions can grow or shrink in size according the deviation metamodel prediction high-fidelity...

10.1145/3205651.3205727 article EN Proceedings of the Genetic and Evolutionary Computation Conference Companion 2018-07-06

Sustainable forest management is a crucial element in combating climate change, plastic pollution, and other unsolved challenges of the 21st century. Forests not only produce wood - renewable resource that increasingly replacing fossil-based materials but also preserve biodiversity store massive amounts carbon. Thus, truly optimal policy has to balance profit-oriented logging with ecological societal interests, should thus be solved as multi-objective optimization problem. Economic research,...

10.1145/3377930.3389837 article EN Proceedings of the Genetic and Evolutionary Computation Conference 2020-06-25

In the last two decades, significant effort has been made to solve computationally expensive optimization problems using surrogate models. Regardless of whether surrogates are primary drivers an algorithm or improve convergence existing method, most proposed concepts rather specific and not very generalizable. Some important considerations selecting a baseline algorithm, suitable methodology, surrogate's involvement in overall design. This paper proposes probabilistic surrogate-assisted...

10.1145/3449639.3459297 article EN Proceedings of the Genetic and Evolutionary Computation Conference 2021-06-21

Ultra high-speed and reliable next-generation 6G mobile networks are recognized as key enablers for many innovative scenarios in smart cities – from vehicular use cases surveillance to healthcare. However, deployment of such network requires tremendous amount time involves various costs. For that reason, optimal planning is utmost importance development cities. In this paper, we explore the potential multi-objective linear optimization synergy with model-driven approach order achieve...

10.1109/telsiks52058.2021.9606345 article EN 2021 15th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS) 2021-10-20

The underlying infrastructure paradigms behind the novel usage scenarios and services are becoming increasingly complex—from everyday life in smart cities to industrial environments. Both number of devices involved their heterogeneity make allocation software components quite challenging. Despite enormous flexibility enabled by component-based engineering, finding optimal artifacts pool available computation units could bring many benefits, such as improved quality service (QoS), reduced...

10.3390/a14120354 article EN cc-by Algorithms 2021-12-06

Significant effort has been made to solve computationally expensive optimization problems in the past two decades, and various methods incorporating surrogates into have proposed. Most research focuses on either exploiting surrogate by defining a utility problem or customizing an existing method use one multiple approximation models. However, only little attention paid generic concepts applicable different types of algorithms simultaneously. Thus this paper proposes generalized probabilistic...

10.48550/arxiv.2204.04054 preprint EN other-oa arXiv (Cornell University) 2022-01-01

The careful selection of Best Management Practices (BMPs) to reduce loading, such as nitrogen, phosphorus, and sediments, can substantially improve the water quality water-sheds. This paper introduces first implementation a hybrid customized evolutionary multi-objective (EMO) algorithm Chesapeake Bay Watershed's (CBW) quality. To make scalable, we inject few solutions obtained using an integer programming (IPOPT) in initial population EMO. Also, repair operator is applied satisfy every...

10.1109/cec55065.2022.9870286 article EN 2022 IEEE Congress on Evolutionary Computation (CEC) 2022-07-18
Coming Soon ...