An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method

DOI10.1016/j.ejor.2004.08.029zbMath1079.90122OpenAlexW2171267841MaRDI QIDQ2572861

Lothar Thiele, Marco Laumanns, Eckart Zitzler

Publication date: 4 November 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.08.029

zbMATH Keywords

Pareto setMultiple objective optimizationEpsilon-constraint methodGenerating methodsNon-dominated set

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (91)

Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ A survey of variants and extensions of the location-routing problem ⋮ An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ On the representation of the search region in multi-objective optimization ⋮ Bi-objective multi-mode project scheduling under risk aversion ⋮ The multi-objective generalized consistent vehicle routing problem ⋮ A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience ⋮ A multi-criteria approach for hospital capacity analysis ⋮ Solution approaches for equitable multiobjective integer programming problems ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ A math-heuristic for the warehouse location-routing problem in disaster relief ⋮ Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case ⋮ Multi-directional local search ⋮ On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming ⋮ Multicriteria optimization approach to deploy humanitarian logistic operations integrally during floods ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Finding all nondominated points of multi-objective integer programs ⋮ Distribution based representative sets for multi-objective integer programs ⋮ An exact approach for the minimum-cost bounded-error calibration tree problem ⋮ Spatial and temporal robustness for scheduling a target tracking mission using wireless sensor networks ⋮ Split algorithms for multiobjective integer programming problems ⋮ The daily routing and scheduling problem of home health care: based on costs and participants’ preference satisfaction ⋮ A criterion space decomposition approach to generalized tri-objective tactical resource allocation ⋮ Multi-objective optimization for the design of salary structures ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ A new modeling approach for the biobjective exact optimization of satellite payload configuration ⋮ Efficient multi-objective metaheuristic algorithm for sustainable harvest planning problem ⋮ Robust generalized Merton-type financial portfolio models with generalized utility ⋮ Modelling beneficiaries' choice in disaster relief logistics ⋮ An STL-based Approach to Resilient Control for Cyber-Physical Systems ⋮ Freshness-driven vehicle routing problem: modeling and application to the fresh agricultural product pick-storage-transportation ⋮ A multi-objective approach for designing a tire closed-loop supply chain network considering producer responsibility ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ Exact hybrid algorithms for solving a bi-objective vehicle routing problem ⋮ A biobjective optimization model for deadline satisfaction in line-of-balance scheduling with work interruptions consideration ⋮ Disjunctive Programming for Multiobjective Discrete Optimisation ⋮ Multiobjective evolutionary algorithms to identify highly autocorrelated areas: the case of spatial distribution in financially compromised farms ⋮ Multi-objective optimization using statistical models ⋮ An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics ⋮ Finding representative systems for discrete bicriterion optimization problems ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions ⋮ Bridging game theory and the knapsack problem: a theoretical formulation ⋮ A multi-objective, hub-and-spoke model to design and manage biofuel supply chains ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits ⋮ On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems ⋮ Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems ⋮ Efficient computation of the search region in multi-objective optimization ⋮ Multi-objective integer programming: an improved recursive algorithm ⋮ IPSSIS: an integrated multicriteria decision support system for equity portfolio construction and selection ⋮ The bi-objective pollution-routing problem ⋮ A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems ⋮ Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems ⋮ The bi-objective stochastic covering tour problem ⋮ Equity portfolio construction and selection using multiobjective mathematical programming ⋮ Lexicographically-ordered constraint satisfaction problems ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming ⋮ A heuristic two-phase solution approach for the multi-objective dial-a-ride problem ⋮ Objectives and methods in multi-objective routing problems: a survey and classification scheme ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem ⋮ Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years ⋮ An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets ⋮ Stochastic multi-objective optimization: a survey on non-scalarizing methods ⋮ A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method ⋮ Prepositioning emergency earthquake response supplies: a new multi-objective particle swarm optimization algorithm ⋮ An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function ⋮ On efficiency of a single variable bi-objective optimization algorithm ⋮ Multiobjective Integer Programming: Synergistic Parallel Approaches ⋮ The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing ⋮ Bi-objective stochastic programming models for determining depot locations in disaster relief operations ⋮ Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems ⋮ Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem ⋮ Outer Branching: How to Optimize under Partial Orders? ⋮ Labeling algorithms for multiple objective integer knapsack problems ⋮ Multi-objective integer programming: a general approach for generating all non-dominated solutions ⋮ Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms ⋮ Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core ⋮ Activities planning and resources assignment on distinct places: a mathematical model ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach ⋮ Interactive bicriterion decision support for a large scale industrial scheduling system ⋮ Bi-objective facility location under uncertainty with an application in last-mile disaster relief ⋮ Computing the nadir point for multiobjective discrete optimization problems ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

Uses Software

• PISA
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
• Nonlinear multiobjective optimization
• Multicriteria optimization
• On the analysis of the \((1+1)\) evolutionary algorithm
• Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization

This page was built for publication: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method