Two-phase Pareto local search for the biobjective traveling salesman problem
From MaRDI portal
Publication:972646
DOI10.1007/S10732-009-9103-9zbMATH Open1189.90145OpenAlexW1990912193MaRDI QIDQ972646FDOQ972646
Authors: Thibaut Lust, Jacques 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
Recommendations
- scientific article; zbMATH DE number 1975100
- Proper balance between search towards and along Pareto front: biobjective TSP case study
- The multiobjective traveling salesman problem: A survey and a new approach
- Speed-up techniques for solving large-scale biobjective TSP
- scientific article; zbMATH DE number 2102231
Pareto local searchtwo-phase methodbiobjective traveling salesman problemcombinatorial multiobjective optimizationdata perturbation techniqueperformance assessment of multiobjective metaheuristicssupported efficient solutions
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- TSPLIB—A Traveling Salesman Problem Library
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria Optimization
- Two phase algorithms for the bi-objective assignment problem
- Genetic local search for multi-objective combinatorial optimization
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
- Bicriteria Transportation Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Bound sets for biobjective combinatorial optimization problems
- On spanning tree problems with multiple objectives
- On local optima in multiobjective combinatorial optimization problems
- Chained Lin-Kernighan for large traveling salesman problems
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- Title not available (Why is that?)
- Clusters of non-dominated solutions in multiobjective combinatorial optimization: an experimental analysis
- Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis)
- Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
Cited In (31)
- Evolutionary Multi-Criterion Optimization
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
- Variable and large neighborhood search to solve the multiobjective set covering problem
- Title not available (Why is that?)
- 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
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
- Many-objective Pareto local search
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
- Speed-up techniques for solving large-scale biobjective TSP
- Tangency portfolios in the lp solvable portfolio selection models
- Relaxations and duality for multiobjective integer programming
- Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms
- Title not available (Why is that?)
- The multiobjective traveling salesman problem: A survey and a new approach
- Anytime Pareto local search
- A two-phase multi-objective metaheuristic for a green UAV grid routing problem
- 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
- Improving the anytime behavior of two-phase local search
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times
- A hybrid approach for biobjective optimization
- Peeking beyond peaks: challenges and research potentials of continuous multimodal multi-objective optimization
- Fundamentals of Computation Theory
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
- Proper balance between search towards and along Pareto front: biobjective TSP case study
- Non-dominated solutions for time series learning and forecasting. Generating models with a generic two-phase Pareto loca search with VND
- Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems
Uses Software
This page was built for publication: Two-phase Pareto local search for the biobjective traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972646)
