Integer Programming Based Approaches for ...
Document type :
Partie d'ouvrage
Title :
Integer Programming Based Approaches for Multi-Trip Location Routing
Author(s) :
Macedo, Rita [Auteur]
Lille économie management - UMR 9221 [LEM]
Alves, Cláudio [Auteur]
Carvalho, José Valério [Auteur]
Hanafi, Said [Auteur]
Mladenovic, Nenad [Auteur]
Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 [LAMIH]
Ramos, Bruna [Auteur]
Universidade do Minho = University of Minho [Braga]
Lille économie management - UMR 9221 [LEM]
Alves, Cláudio [Auteur]
Carvalho, José Valério [Auteur]
Hanafi, Said [Auteur]
Mladenovic, Nenad [Auteur]
Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 [LAMIH]
Ramos, Bruna [Auteur]
Universidade do Minho = University of Minho [Braga]
Book title :
Lecture Notes in Economics and Mathematical Systems
Publisher :
Springer International Publishing
Publication date :
2016
English keyword(s) :
multi-trip location routing
HAL domain(s) :
Mathématiques [math]
Mathématiques [math]/Statistiques [math.ST]
Mathématiques [math]/Statistiques [math.ST]
English abstract : [en]
The multi-trip location routing problem consists in selecting the depots to open and the routes that should be performed to serve a set of clients at minimum cost. The multi-trip variant considers the possibility for a ...
Show more >The multi-trip location routing problem consists in selecting the depots to open and the routes that should be performed to serve a set of clients at minimum cost. The multi-trip variant considers the possibility for a vehicle to perform more than a single route during the planning period, and hence it applies typically to cases in which the trips are performed within a small geographic area and involves for example the transportation of perishable goods. As a consequence, the inherent complexity of the problem increases as it has now to determine which routes should be assigned to the vehicles. In this paper, we explore an improved network flow formulation for this problem, and we compare it with another compact formulation proposed in the literature. We describe also an iterative rounding heuristic that relies on this model. We show through computational experiments on benchmark instances that the model provides good lower bounds, and that it can be used both by commercial solvers and heuristics to derive good quality solutions for the problem.Show less >
Show more >The multi-trip location routing problem consists in selecting the depots to open and the routes that should be performed to serve a set of clients at minimum cost. The multi-trip variant considers the possibility for a vehicle to perform more than a single route during the planning period, and hence it applies typically to cases in which the trips are performed within a small geographic area and involves for example the transportation of perishable goods. As a consequence, the inherent complexity of the problem increases as it has now to determine which routes should be assigned to the vehicles. In this paper, we explore an improved network flow formulation for this problem, and we compare it with another compact formulation proposed in the literature. We describe also an iterative rounding heuristic that relies on this model. We show through computational experiments on benchmark instances that the model provides good lower bounds, and that it can be used both by commercial solvers and heuristics to derive good quality solutions for the problem.Show less >
Language :
Anglais
Audience :
Internationale
Popular science :
Non
Collections :
Source :