Escobar Velasquez, John Willmer
(2013)
Heuristic algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem, [Dissertation thesis], Alma Mater Studiorum Università di Bologna.
Dottorato di ricerca in
Automatica e ricerca operativa, 25 Ciclo. DOI 10.6092/unibo/amsdottorato/5258.
Documenti full-text disponibili:
Abstract
The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to
be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot. This thesis addresses heuristics algorithms based on the well-know granular search idea introduced by Toth and Vigo (2003) to solve the CLRP and the MDVRP. Extensive computational experiments on benchmark instances for both problems have been performed to determine the effectiveness of the proposed algorithms.
This work is organized as follows:
Chapter 1 describes a detailed overview and a methodological review of the literature for the the Capacitated Location-Routing Problem (CLRP) and the Multi-Depot Vehicle Routing Problem (MDVRP).
Chapter 2 describes a two-phase hybrid heuristic algorithm to solve the CLRP.
Chapter 3 shows a computational comparison of heuristic algorithms for the CLRP.
Chapter 4 presents a hybrid granular tabu search approach for solving the MDVRP.
Abstract
The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to
be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot. This thesis addresses heuristics algorithms based on the well-know granular search idea introduced by Toth and Vigo (2003) to solve the CLRP and the MDVRP. Extensive computational experiments on benchmark instances for both problems have been performed to determine the effectiveness of the proposed algorithms.
This work is organized as follows:
Chapter 1 describes a detailed overview and a methodological review of the literature for the the Capacitated Location-Routing Problem (CLRP) and the Multi-Depot Vehicle Routing Problem (MDVRP).
Chapter 2 describes a two-phase hybrid heuristic algorithm to solve the CLRP.
Chapter 3 shows a computational comparison of heuristic algorithms for the CLRP.
Chapter 4 presents a hybrid granular tabu search approach for solving the MDVRP.
Tipologia del documento
Tesi di dottorato
Autore
Escobar Velasquez, John Willmer
Supervisore
Dottorato di ricerca
Scuola di dottorato
Scienze e ingegneria dell'informazione
Ciclo
25
Coordinatore
Settore disciplinare
Settore concorsuale
Parole chiave
Capacitated Location-Routing Problem
Multi-Depot Vehicle Routing Problem
Granular Tabu Search
Simulated Annealing
Variable Neighborhood Search
Heuristic Algorithms
Computational Comparison
URN:NBN
DOI
10.6092/unibo/amsdottorato/5258
Data di discussione
3 Aprile 2013
URI
Altri metadati
Tipologia del documento
Tesi di dottorato
Autore
Escobar Velasquez, John Willmer
Supervisore
Dottorato di ricerca
Scuola di dottorato
Scienze e ingegneria dell'informazione
Ciclo
25
Coordinatore
Settore disciplinare
Settore concorsuale
Parole chiave
Capacitated Location-Routing Problem
Multi-Depot Vehicle Routing Problem
Granular Tabu Search
Simulated Annealing
Variable Neighborhood Search
Heuristic Algorithms
Computational Comparison
URN:NBN
DOI
10.6092/unibo/amsdottorato/5258
Data di discussione
3 Aprile 2013
URI
Statistica sui download
Gestione del documento: