Speed-up techniques for solving large-scale biobjective TSP

DOI10.1016/J.COR.2009.01.005MaRDI QIDQ1038291zbMATH OpenOpenAlexFDO

Authors Thibaut Lust, Andrzej Jaszkiewicz

Publication date 17 November 2009

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2009.01.005

zbMATH Keywords

TSPlocal searchhybrid metaheuristicsspeed-up techniquesmultiobjective combinatorial optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Two-phase Pareto local search for the biobjective traveling salesman problem
• Proper balance between search towards and along Pareto front: biobjective TSP case study
• scientific article; zbMATH DE number 1975100
• The multiobjective traveling salesman problem: A survey and a new approach
• A two-phase method for bi-objective combinatorial optimization and its application to the TSP with profits

Cites work

• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 1975100 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 2102230 (Why is no real title available?)
• scientific article; zbMATH DE number 2102231 (Why is no real title available?)
• scientific article; zbMATH DE number 915988 (Why is no real title available?)
• scientific article; zbMATH DE number 3246773 (Why is no real title available?)
• Bicriteria Transportation Problem
• Bound sets for biobjective combinatorial optimization problems
• Chained Lin-Kernighan for large traveling salesman problems
• Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis)
• Fast Algorithms for Geometric Traveling Salesman Problems
• First vs. best improvement: an empirical study
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Multi-objective optimization using evolutionary algorithms
• Multicriteria Optimization
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• TSPLIB—A Traveling Salesman Problem Library
• Two phase algorithms for the bi-objective assignment problem
• Two-phase Pareto local search for the biobjective traveling salesman problem

Cited in

(8)

• On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
• A hybrid approach for biobjective optimization
• Two-phase Pareto local search for the biobjective traveling salesman problem
• Many-objective Pareto local search
• An evolutionary approach to generalized biobjective traveling salesperson problem
• Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
• Proper balance between search towards and along Pareto front: biobjective TSP case study

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Speed-up techniques for solving large-scale biobjective TSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1038291)