Design and analysis of stochastic local search for the multiobjective traveling salesman problem
From MaRDI portal
Publication:1010272
DOI10.1016/j.cor.2008.11.013zbMath1179.90302OpenAlexW2071540136MaRDI QIDQ1010272
Publication date: 3 April 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10316/9994
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems, Anytime Pareto local search, Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows, Design of a heuristic algorithm for the generalized multi-objective set covering problem, Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem, A hybrid approach for biobjective optimization, Improving the anytime behavior of two-phase local search, Approaching the rank aggregation problem by local search-based metaheuristics, A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems, On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
- Algorithms to solve the orienteering problem: A comparison
- The traveling salesman. Computational solutions for RSP applications
- On spanning tree problems with multiple objectives
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- The plane with parallel coordinates
- Algorithms for solving the two-criterion large-scale travelling salesman problem
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Permutation tests. A practical guide to resampling methods for testing hypotheses.
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem
- CHESS -- changing horizon efficient set search: a simple principle for multiobjective optimization
- Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP
- Multiple Comparisons
- Handbook of Approximation Algorithms and Metaheuristics
- Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis
- A Gray code for compositions
- On cardinality of the set of alternatives in discrete many-criterion problems
- Fast Algorithms for Geometric Traveling Salesman Problems
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Genetic local search for multi-objective combinatorial optimization
