4.7 Article

Efficient optimization of many objectives by approximation-guided evolution

期刊

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 243, 期 2, 页码 465-479

出版社

ELSEVIER
DOI: 10.1016/j.ejor.2014.11.032

关键词

Multi-objective optimization; Approximation; Comparative study

向作者/读者索取更多资源

Multi-objective optimization problems arise frequently in applications, but can often only be solved approximately by heuristic approaches. Evolutionary algorithms have been widely used to tackle multi-objective problems. These algorithms use different measures to ensure diversity in the objective space but are not guided by a formal notion of approximation. We present a framework for evolutionary multi-objective optimization that allows to work with a formal notion of approximation. This approximation-guided evolutionary algorithm (AGE) has a worst-case runtime linear in the number of objectives and works with an archive that is an approximation of the non-dominated objective vectors seen during the run of the algorithm. Our experimental results show that AGE finds competitive or better solutions not only regarding the achieved approximation, but also regarding the total hypervolume. For all considered test problems, even for many (i.e., more than ten) dimensions, AGE discovers a good approximation of the Pareto front. This is not the case for established algorithms such as NSGA-II, SPEA2, and SMS-EMOA. In this paper we compare AGE with two additional algorithms that use very fast hypervolume-approximations to guide their search. This significantly speeds up the runtime of the hypervolume-based algorithms, which now allows a comparison of the underlying selection schemes. (C) 2014 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Computer Science, Theory & Methods

Runtime analysis of RLS and (1+1) EA for the dynamic weighted vertex cover problem

Mojgan Pourhassan, Vahid Roostapour, Frank Neumann

THEORETICAL COMPUTER SCIENCE (2020)

Article Computer Science, Artificial Intelligence

Robust Fitting in Computer Vision: Easy or Hard?

Tat-Jun Chin, Zhipeng Cai, Frank Neumann

INTERNATIONAL JOURNAL OF COMPUTER VISION (2020)

Article Computer Science, Software Engineering

Better software analytics via DUO: Data mining algorithms using/used-by optimizers

Amritanshu Agrawal, Tim Menzies, Leandro L. Minku, Markus Wagner, Zhe Yu

EMPIRICAL SOFTWARE ENGINEERING (2020)

Editorial Material Computer Science, Artificial Intelligence

Special Issue on Benchmarking of Computational Intelligence Algorithms in the Applied Soft Computing Journal

Thomas Weise, Markus Wagner, Bin Li, Xingyi Zhang, Joerg Laessig

APPLIED SOFT COMPUTING (2020)

Article Computer Science, Artificial Intelligence

A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem

Jonatas B. C. Chagas, Julian Blank, Markus Wagner, Marcone J. F. Souza, Kalyanmoy Deb

Summary: This paper proposes a method to solve a bi-objective variant of the well-studied traveling thief problem (TTP) by using a biased-random key genetic algorithm with customizations, incorporating domain knowledge, and addressing the bi-objective aspect through an elite population based on non-dominated rank and crowding distance. The method has shown success in BI-TTP competitions at EMO and GECCO conferences, consistently producing high-quality solutions.

JOURNAL OF HEURISTICS (2021)

Article Computer Science, Artificial Intelligence

Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations

Francesco Quinzan, Andreas Goebel, Markus Wagner, Tobias Friedrich

Summary: The study proposes a new mutation operator for evolutionary algorithms and analyzes its performance on a specific class of problems, showing that it competes effectively with existing operators. The new operator is able to find a (1/3)-approximation ratio on certain types of problems in polynomial time, outperforming combinatorial local search algorithms with constant probability. Experimental evaluations demonstrate the superiority of the new operator over uniform mutation and dynamic schemes in real-world graph and air pollution problems.

NATURAL COMPUTING (2021)

Article Computer Science, Artificial Intelligence

Toward more efficient heuristic construction of Boolean functions

Domagoj Jakobovic, Stjepan Picek, Marcella S. R. Martins, Markus Wagner

Summary: Boolean functions have various applications in different fields, and heuristics play a vital role in their construction. This research investigates the influence of different optimization criteria and variation operators through fitness landscape analysis and Local Optima Networks, observing correlations between local optima fitness, interconnection degree, and basin sizes.

APPLIED SOFT COMPUTING (2021)

Article Computer Science, Software Engineering

GTOPX space mission benchmarks

Martin Schlueter, Mehdi Neshat, Mohamed Wahib, Masaharu Munetomo, Markus Wagner

Summary: The GTOPX space mission benchmark collection is an extension of the GTOP database, featuring ten benchmark instances representing real-world interplanetary space trajectory design problems. By linking to Python and Matlab based on dynamic link libraries, GTOPX ensures fast and accurate reproduction of benchmark results in all programming languages. GTOPX aims to support researchers who wish to tackle nonlinear challenges with advanced algorithms.

SOFTWAREX (2021)

Article Operations Research & Management Science

Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach

Jonatas B. C. Chagas, Markus Wagner

Summary: In this article, we address the Thief Orienteering Problem (ThOP) by combining swarm intelligence with a randomized packing heuristic, achieving significant improvements on almost all 432 benchmarking instances.

OPTIMIZATION LETTERS (2022)

Article Computer Science, Information Systems

Amplifying influence through coordinated behaviour in social networks

Derek Weber, Frank Neumann

Summary: Political misinformation, astroturfing and organised trolling are online malicious behaviors with significant real-world effects that can influence democratic systems and government policy. Studying these behaviors requires focusing on the small groups behind campaigns and utilizing novel temporal window approaches to detect latent networks of cooperating accounts.

SOCIAL NETWORK ANALYSIS AND MINING (2021)

Review Computer Science, Information Systems

Self-adaptive systems: A systematic literature review across categories and domains

Terence Wong, Markus Wagner, Christoph Treude

Summary: Self-adaptive systems (SAS) are characterized by their context-awareness and ability to act on the context to achieve sustained goal achievement. The field of autonomic computing research has experienced significant development over the past 20 years, with applications in various domains.

INFORMATION AND SOFTWARE TECHNOLOGY (2022)

Proceedings Paper Computer Science, Artificial Intelligence

Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem

Feng Shi, Xiankun Yan, Frank Neumann

Summary: This paper investigates a chance-constrained version of the Makespan Scheduling problem and analyzes the performance of two algorithms. The processing times of jobs in real life scenarios are often stochastic and may be influenced by external factors.

PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XVII, PPSN 2022, PT II (2022)

Proceedings Paper Computer Science, Software Engineering

Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems

Hirad Assimi, Frank Neumann, Markus Wagner, Xiaodong Li

Summary: This study addresses the truss optimization problem using exact enumeration and novelty-driven optimization approaches. Experimental results demonstrate that the proposed method outperforms existing methods and obtains multiple high-quality solutions.

EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, EVOCOP 2022 (2022)

Proceedings Paper Computer Science, Theory & Methods

Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily

Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton

Summary: Recent interest has been in studying non-uniform random k-SAT models to address the non-uniformity of formulas in real-world applications, challenging the algorithmic complexity of heterogeneous distributions. It is known that dense formulas guaranteed to be satisfiable are easy on average. A broad class of non-uniform random k-SAT models are characterized by distributions over variables that satisfy a balancing condition.

THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, SAT 2021 (2021)

Review Management

Survey of optimization models for power system operation and expansion planning with demand response

Vinicius N. Motta, Miguel F. Anjos, Michel Gendreau

Summary: This survey presents a review of optimization approaches for the integration of demand response in power systems planning and highlights important future research directions.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

R-SALSA: A branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines

Philipp Schulze, Armin Scholl, Rico Walter

Summary: This paper proposes an improved branch-and-bound algorithm, R-SALSA, for solving the simple assembly line balancing problem, which performs well in balancing workloads and providing initial solutions.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Adaptive scheduling in service systems: A Dynamic programming approach

Roshan Mahes, Michel Mandjes, Marko Boon, Peter Taylor

Summary: This paper discusses appointment scheduling and presents a phase-type-based approach to handle variations in service times. Numerical experiments with dynamic scheduling demonstrate the benefits of rescheduling.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Discrete scheduling and critical utilization

Oleg S. Pianykh, Sebastian Perez, Chengzhao Richard Zhang

Summary: Efficient scheduling is crucial for optimizing resource allocation and system performance. This study focuses on critical utilization and efficient scheduling in discrete scheduling systems, and compares the results with classical queueing theory.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Review Management

Supply chain network design with financial considerations: A comprehensive review

Hamed Jahani, Babak Abbasi, Jiuh-Biing Sheu, Walid Klibi

Summary: Supply chain network design is a large and growing area of research. This study comprehensively surveys and analyzes articles published from 2008 to 2021 to detect and report financial perspectives in SCND models. The study also identifies research gaps and offers future research directions.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

A branch-and-cut algorithm for the connected max- k-cut problem

Patrick Healy, Nicolas Jozefowiez, Pierre Laroche, Franc Marchetti, Sebastien Martin, Zsuzsanna Roka

Summary: The Connected Max-k-Cut Problem is an extension of the well-known Max-Cut Problem, where the objective is to partition a graph into k connected subgraphs by maximizing the cost of inter-partition edges. The researchers propose a new integer linear program and a branch-and-cut algorithm for this problem, and also use graph isomorphism to structure the instances and facilitate their resolution. Extensive computational experiments show that, if k > 2, their approach outperforms existing algorithms in terms of quality.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Estimating production functions through additive models based on regression splines

Victor J. Espana, Juan Aparicio, Xavier Barber, Miriam Esteve

Summary: This paper introduces a new methodology based on the machine learning technique MARS for estimating production functions that satisfy classical production theory axioms. The new approach overcomes the overfitting problem of DEA through generalized cross-validation and demonstrates better performance in reducing mean squared error and bias compared to DEA and C2NLS methods.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Time-flexible min completion time variance in a single machine by quadratic programming

Stefano Nasini, Rabia Nessah

Summary: In this paper, the authors investigate the impact of time flexibility in job scheduling, showing that it can significantly affect operators' ability to solve the problem efficiently. They propose a new methodology based on convex quadratic programming approaches that allows for optimal solutions in large-scale instances.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Convex support vector regression

Zhiqiang Liao, Sheng Dai, Timo Kuosmanen

Summary: Nonparametric regression subject to convexity or concavity constraints is gaining popularity in various fields. The conventional convex regression method often suffers from overfitting and outliers. This paper proposes the convex support vector regression method to address these issues and demonstrates its advantages in prediction accuracy and robustness through numerical experiments.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

A simulation evacuation framework for effective disaster preparedness strategies and response decision making

Kuo-Hao Chang, Ying-Zheng Wu, Wen-Ray Su, Lee-Yaw Lin

Summary: The damage and destruction caused by earthquakes necessitates the evacuation of affected populations. Simulation models, such as the Stochastic Pedestrian Cell Transmission Model (SPCTM), can be utilized to enhance disaster and evacuation management. The analysis of SPCTM provides insights for government officials to formulate effective evacuation strategies.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

An effective hybrid evolutionary algorithm for the clustered orienteering problem

Qinghua Wu, Mu He, Jin-Kao Hao, Yongliang Lu

Summary: This paper studies a variant of the orienteering problem known as the clustered orienteering problem. In this problem, customers are grouped into clusters and a profit is associated with each cluster, collected only when all customers in the cluster are served. The proposed evolutionary algorithm, incorporating a backbone-based crossover operator and a destroy-and-repair mutation operator, outperforms existing algorithms on benchmark instances and sets new records on some instances. It also demonstrates scalability on large instances and has shown superiority over three state-of-the-art COP algorithms. The algorithm is also successfully applied to a dynamic version of the COP considering stochastic travel time.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Improving uplift model evaluation on randomized controlled trial data

Bjorn Bokelmann, Stefan Lessmann

Summary: Estimating treatment effects is an important task for data analysts, and uplift models provide support for efficient allocation of treatments. However, evaluating uplift models is challenging due to variance issues. This paper theoretically analyzes the variance of uplift evaluation metrics, proposes variance reduction methods based on statistical adjustment, and demonstrates their benefits on simulated and real-world data.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Newsvendor conditional value-at-risk minimisation: A feature-based approach under adaptive data selection

Congzheng Liu, Wenqi Zhu

Summary: This paper proposes a feature-based non-parametric approach to minimizing the conditional value-at-risk in the newsvendor problem. The method is able to handle both linear and nonlinear profits without prior knowledge of the demand distribution. Results from numerical and real-life experiments demonstrate the robustness and effectiveness of the approach.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Right-left asymmetry of the eigenvector method: A simulation study

Laszlo Csato

Summary: This paper compares the performance of the eigenvalue method and the row geometric mean as two weighting procedures. Through numerical experiments, it is found that the priorities derived from the two eigenvectors in the eigenvalue method do not always agree, while the row geometric mean serves as a compromise between them.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)

Article Management

Compete or cooperate? Effects of channel relationships on government policies for sustainability

Guowei Dou, Tsan-Ming Choi

Summary: This study investigates the impact of channel relationships between manufacturers on government policies and explores the effectiveness of positive incentives versus taxes in increasing social welfare. The findings suggest that competition may be more effective in improving sustainability and social welfare. Additionally, government incentives for green technology may not necessarily enhance sustainability.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2024)