An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
From MaRDI portal
Publication:2016277
DOI10.1016/j.amc.2013.03.002zbMath1290.90055OpenAlexW2090930452MaRDI QIDQ2016277
George Mavrotas, Kostas Florios
Publication date: 20 June 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.03.002
Related Items
Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ Multi-mode resource constrained project scheduling problem along with contractor selection ⋮ SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation ⋮ Design of a heuristic algorithm for the generalized multi-objective set covering problem ⋮ 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 ⋮ Efficient automated schematic map drawing using multiobjective mixed integer programming ⋮ An exact algorithm for biobjective mixed integer linear programming problems ⋮ An integrated bi-objective U-shaped assembly line balancing and parts feeding problem: optimization model and exact solution method ⋮ A hybrid approach for biobjective optimization ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ A multi-product model for evaluating and selecting two layers of suppliers considering environmental factors ⋮ Distribution based representative sets for multi-objective integer programs ⋮ A multi-objective decision-making model for supplier selection considering transport discounts and supplier capacity constraints ⋮ A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem ⋮ Dynamic routing-scheduling problem for home health care considering caregiver-patient compatibility ⋮ Advanced network connectivity features and zonal requirements in covering location problems ⋮ A hub-and-spoke architecture for a parcel delivery system using the cross-docking distribution strategy ⋮ A multi-criteria decision framework for sustainable supplier selection and order allocation using multi-objective optimization and fuzzy approach ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ An extended ϵ‐constraint method for a multiobjective finite‐horizon Markov decision process ⋮ A multi-objective mixed integer linear programming model for thesis defence scheduling ⋮ A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising ⋮ An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain ⋮ Multi-objective decision method for airport landside rapid transit network design ⋮ Investigating of transportation systems development for urban districts, costs and social equity: a case of Sanandaj, Kurdistan ⋮ The open location-routing problem for multi-objective optimization of sustainable supply chain considering social concerns ⋮ A data-driven optimization model to response to COVID-19 pandemic: a case study ⋮ An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics ⋮ Environmental corporate responsibility for investments evaluation: an alternative multi-objective programming model ⋮ A multi-objective, hub-and-spoke model to design and manage biofuel supply chains ⋮ Planning tank-truck hazardous materials shipments in intercity road transportation networks ⋮ A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems ⋮ A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems ⋮ Decision support models in climate policy ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chain problem ⋮ An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets ⋮ Multi-objective evolutionary algorithms for a reliability location problem ⋮ Multi-objective optimization model for a downstream oil and gas supply chain ⋮ A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level ⋮ Ambulance routing in disaster response considering variable patient condition: NSGA-II and MOPSO algorithms ⋮ Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach ⋮ A novel hybrid multi-objective algorithm to solve the generalized cubic cell formation problem ⋮ Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches
Uses Software
Cites Work
- Multi-directional local search
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- A review of interactive methods for multiobjective integer and mixed-integer programming
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- An exact method for computing the nadir values in multiple objective linear programming
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming 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
- An algorithm for the bi-criterion integer programming problem
- Zero-one programming with multiple criteria
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- An algorithm for the multiple objective integer linear programming problem
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A survey and annotated bibliography of multiobjective combinatorial optimization
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- An algorithm for optimizing a linear function over an integer efficient set
- An improved algorithm for solving biobjective integer programs
- Selection among ranked projects under segmentation, policy and logical constraints
- Finding representative systems for discrete bicriterion optimization problems
- A survey of recent developments in multiobjective optimization
- A method for generating all efficient solutions of 0-1 multi-objective linear programming problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- Approximating Multiobjective Knapsack Problems
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Linear multiple objective programs with zero–one variables
- Constructing robust crew schedules with bicriteria optimization
- Multi‐objective combinatorial optimization problems: A survey
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
