Two-phase Pareto local search for the biobjective traveling salesman problem

DOI10.1007/s10732-009-9103-9zbMath1189.90145OpenAlexW1990912193MaRDI QIDQ972646

Thibaut Lust, Jacques jun. Teghem

Publication date: 21 May 2010

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-009-9103-9

zbMATH Keywords

Pareto local searchtwo-phase methodbiobjective traveling salesman problemcombinatorial multiobjective optimizationdata perturbation techniqueperformance assessment of multiobjective metaheuristicssupported efficient solutions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (24)

Variable and large neighborhood search to solve the multiobjective set covering problem ⋮ Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ A coordinate-exchange two-phase local search algorithm for the D- and I-optimal designs of split-plot experiments ⋮ Tangency portfolios in the LP solvable portfolio selection models ⋮ Anytime Pareto local search ⋮ Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows ⋮ A multi-objective green UAV routing problem ⋮ Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign ⋮ Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem ⋮ Many-objective Pareto local search ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ A hybrid approach for biobjective optimization ⋮ Proper balance between search towards and along Pareto front: biobjective TSP case study ⋮ Peeking beyond peaks: challenges and research potentials of continuous multimodal multi-objective optimization ⋮ A two-phase multi-objective metaheuristic for a green UAV grid routing problem ⋮ Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times ⋮ Improving the anytime behavior of two-phase local search ⋮ 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 ⋮ Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms ⋮ Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems ⋮ Non-dominated solutions for time series learning and forecasting. Generating models with a generic two-phase Pareto loca search with VND ⋮ Speed-up techniques for solving large-scale biobjective TSP ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach

Uses Software

• TSPLIB
• LKH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis)
• Bound sets for biobjective combinatorial optimization problems
• Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
• Connectedness of efficient solutions in multiple criteria combinatorial optimization
• On spanning tree problems with multiple objectives
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Two phase algorithms for the bi-objective assignment problem
• On local optima in multiobjective combinatorial optimization problems
• Chained Lin-Kernighan for Large Traveling Salesman Problems
• A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
• Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis
• Bicriteria Transportation Problem
• TSPLIB—A Traveling Salesman Problem Library
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
• Multicriteria Optimization
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Genetic local search for multi-objective combinatorial optimization

This page was built for publication: Two-phase Pareto local search for the biobjective traveling salesman problem