Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
From MaRDI portal
Publication:274932
DOI10.1016/J.AMC.2014.03.110zbMath1334.90153OpenAlexW2062284372MaRDI QIDQ274932
George Mavrotas, Kostas Florios
Publication date: 25 April 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://mpra.ub.uni-muenchen.de/105074/1/MPRA_paper_105074.pdf
traveling salesman problemset covering problem\(\varepsilon\)-constraintexact Pareto setmulti-objective
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Related Items (10)
A constraint handling technique using compound distance for solving constrained multi-objective optimization problems ⋮ Design of a heuristic algorithm for the generalized multi-objective set covering problem ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ A hybrid approach for biobjective optimization ⋮ Network Models for Multiobjective Discrete Optimization ⋮ An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems ⋮ A tolerance function for the multiobjective set covering problem ⋮ An algorithm for approximating the Pareto set of the multiobjective set covering problem ⋮ Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines ⋮ Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
- Pyramidal tours and multiple objectives
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
- Symmetric traveling salesman problems
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Approximation algorithms for multi-criteria traveling salesman problems
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Speed-up techniques for solving large-scale biobjective TSP
- On the solution of traveling salesman problems
- The traveling salesman problem: An overview of exact and approximate algorithms
- The Euclidean traveling salesman problem is NP-complete
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- An integrated multi-objective framework for solving multi-period project selection problems
- Multi-objective integer programming: an improved recursive algorithm
- Multiobjective traveling salesperson problem on Halin graphs
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
- Two phase algorithms for the bi-objective assignment problem
- A survey of recent developments in multiobjective optimization
- Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP
- 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
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- Integer Programming Formulation of Traveling Salesman Problems
- The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
- Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem
- TSPLIB—A Traveling Salesman Problem Library
- Solving a multiobjective traveling salesman problem by dynamic programming
- Genetic local search for multi-objective combinatorial optimization
This page was built for publication: Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
