Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Mixed Integer Programming formulations for the balanced Traveling Salesman Problem with a lexicographic objective

Luc Libralesso 1
1 G-SCOP_OC [2020-....] - Optimisation Combinatoire [2020-....]
G-SCOP [2020-....] - Laboratoire des sciences pour la conception, l'optimisation et la production [2020-....]
Abstract : This paper presents a Mixed Integer Program to solve the Balanced TSP. It exploits the underlying structure of the instances and is able to find optimal solutions for all the instances provided in the Metaheuristics Summer School competition. We study the efficiency of this new model on several variants of the Balanced TSP. The proposed method was ranked first in the MESS18 Metaheuristic competition among 9 submissions.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02569456
Contributor : Luc Libralesso <>
Submitted on : Monday, May 11, 2020 - 1:05:25 PM
Last modification on : Wednesday, August 5, 2020 - 3:01:08 AM

File

MIP_formulations_for_the_balan...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02569456, version 1

Collections

Citation

Luc Libralesso. Mixed Integer Programming formulations for the balanced Traveling Salesman Problem with a lexicographic objective. 2020. ⟨hal-02569456⟩

Share

Metrics

Record views

14

Files downloads

30