On the Integration of a TSP Heuristic into an EA for the Bi-objective Ring Star Problem

@inproceedings{Liefooghe2008OnTI,
  title={On the Integration of a TSP Heuristic into an EA for the Bi-objective Ring Star Problem},
  author={Arnaud Liefooghe and Laetitia Vermeulen-Jourdan and Nicolas Jozefowiez and El-Ghazali Talbi},
  booktitle={Hybrid Metaheuristics},
  year={2008}
}
This paper discusses a new hybrid solution method for a bi-objective routing problem, namely the bi-objective ring star problem. The bi-objective ring star problem is a generalization of the ring star problem in which the assignment cost has been dissociated from the cost of visiting a subset of nodes. Here, we investigate the possible contribution of incorporating specialized TSP heuristics into a multi-objective evolutionary algorithm. Experiments show that the use of this hybridization… 
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
TLDR
A generic branch-and-cut algorithm applicable to the solution of multiobjective optimization problems for which a lower bound can be defined as a polynomially solvable multi objective problem is described.
The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems
TLDR
This paper adapts a recent and popular indicator-based selection method proposed by Zitzler and Künzli in 2004, in order to define a population-based multi-objective local search, designed to be easily adaptable, parameter independent and to have a high convergence rate.
Optimisation combinatoire multi-objectif : des méthodes aux problèmes, de la Terre à (presque) la Lune
Ce manuscrit presente une partie des travaux que j'ai realises a la suite de ma these. Le document se focalise particulierement sur les etudes menees dans le cadre de l'optimisation combinatoire

References

SHOWING 1-10 OF 28 REFERENCES
Metaheuristics for the Bi-objective Ring Star Problem
TLDR
Three metaheuristics are designed to approximate the whole set of efficient solutions for the bi-objective ring star problem, and the proposed methods are rigorously compared to each other using different performance metrics.
The bi-objective covering tour problem
Metaheuristics and Their Hybridization to Solve the Bi-objective Ring Star Problem: a Comparative Study
TLDR
Two cooperative strategies that combines two multiple objective metaheuristics: an elitist evolutionary algorithm and a population-based local search are proposed that apply to well-known benchmark test instances and demonstrate their effectiveness in comparison to non-hybrid algorithms and to state-of-the-art methods.
Multi-objective Meta-heuristics for the Traveling Salesman Problem with Profits
TLDR
The purpose of this study is to find solutions to the bi-objective routing problem known as the traveling salesman problem with profits using the notion of Pareto optimality, i.e. by searching for efficient solutions and constructing an efficient frontier.
A tabu search heuristic for the undirected selective travelling salesman problem
Locating median cycles in networks
The Ring Star Problem: Polyhedral analysis and exact algorithm
TLDR
This article formulates the Ring Star Problem as a mixed-integer linear program and strengthens it with the introduction of several families of valid inequalities that are shown to be facet-defining and are used to develop a branch-and-cut algorithm.
Multi-objective vehicle routing problems
Efficient heuristics for Median Cycle Problems
This article proposes a number of efficient heuristics for two versions of the Median Cycle Problem. In both versions, the aim is to construct a simple cycle containing a subset of the vertices of a
TSPLIB - A Traveling Salesman Problem Library
This paper contains the description of a traveling salesman problem library (TSPLIB) which is meant to provide researchers with a broad set of test problems from various sources and with various
...
...