Bektas, Tolga 
ORCID: 0000-0003-0634-144X, Gouveia, Luis and Santos, Daniel
(2020)
Compact Formulations for Multi-depot Routing Problems: Theoretical and Computational Comparisons.
Computers and Operations Research, 124.
p. 105084.
|
Text
Compact_formulations_for_multi_depot_routing_problems.pdf - Author Accepted Manuscript Download (302kB) | Preview |
Abstract
Multi-depot routing problems mainly arise in distribution logistics where a fleet of vehicles are used to serve clients from a number of (potential) depots. The problem concerns deciding on the routes of each vehicle and the depots from which the vehicles depart, so as to minimize the total cost of travel. This paper reviews a number of existing compact formulations, and proposes new ones, for two types of multi-depot routing problems, one that includes the depot selection decisions, and the other where depots are pre-selected. The formulations are compared theoretically in terms of the strength of their linear programming relaxation, and computationally in terms of the running time needed to solve the instances to optimality.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Vehicle routing, Multi-depot, Location-routing, Integer linear programming |
| Depositing User: | Symplectic Admin |
| Date Deposited: | 10 Aug 2020 07:51 |
| Last Modified: | 18 Jan 2023 23:38 |
| DOI: | 10.1016/j.cor.2020.105084 |
| Related URLs: | |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3096901 |
Dimensions
Dimensions
