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

Content Provider	Springer Nature Link
Author	Lust, Thibaut Teghem, Jacques
Copyright Year	2009
Abstract	In this work, we present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first phase of the method, an initial population composed of a good approximation of the extreme supported efficient solutions is generated. We use as second phase a Pareto Local Search method applied to each solution of the initial population. We show that using the combination of these two techniques: good initial population generation plus Pareto Local Search gives better results than state-of-the-art algorithms. Two other points are introduced: the notion of ideal set and a simple way to produce near-efficient solutions of multiobjective problems, by using an efficient single-objective solver with a data perturbation technique.
Starting Page	475
Ending Page	510
Page Count	36
File Format	PDF
ISSN	13811231
Journal	Journal of Heuristics
Volume Number	16
Issue Number	3
e-ISSN	15729397
Language	English
Publisher	Springer US
Publisher Date	2009-02-21
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Combinatorial multiobjective optimization Biobjective traveling salesman problem Two-phase method Supported efficient solutions Pareto local search Data perturbation technique Performance assessment of multiobjective metaheuristics Calculus of Variations and Optimal Control; Optimization Artificial Intelligence (incl. Robotics) Operations Research/Decision Theory Operations Research, Mathematical Programming
Content Type	Text
Resource Type	Article
Subject	Control and Optimization Artificial Intelligence Management Science and Operations Research Computer Networks and Communications Information Systems Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems

Dynamics of Local Search Trajectory in Traveling Salesman Problem

Metaheuristics for the team orienteering problem

A composite-neighborhood tabu search approach to the traveling tournament problem

A tabu search heuristic using genetic diversification for the clustered traveling salesman problem

Variable and large neighborhood search to solve the multiobjective set covering problem

Local search heuristics for the multidimensional assignment problem

Further Extension of the TSP Assign Neighborhood

Stochastic Pareto local search: Pareto neighbourhood exploration and perturbation strategies

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

Similar Documents

On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems

Dynamics of Local Search Trajectory in Traveling Salesman Problem

Metaheuristics for the team orienteering problem

A composite-neighborhood tabu search approach to the traveling tournament problem

A tabu search heuristic using genetic diversification for the clustered traveling salesman problem

Variable and large neighborhood search to solve the multiobjective set covering problem

Local search heuristics for the multidimensional assignment problem

Further Extension of the TSP Assign Neighborhood

Stochastic Pareto local search: Pareto neighbourhood exploration and perturbation strategies

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