Exact Algorithms for Different Classes of Vehicle Routing Problems
We deal with five problems arising in the field of logistics: the Asymmetric TSP (ATSP), the TSP with Time Windows (TSPTW), the VRP with Time Windows (VRPTW), the Multi-Trip VRP (MTVRP), and the Two-Echelon Capacitated VRP (2E-CVRP). The ATSP requires finding a lest-cost Hamiltonian tour in a digra...
Main Author: | Roberti, Roberto <1982> |
---|---|
Other Authors: | Mingozzi, Aristide |
Format: | Doctoral Thesis |
Language: | en |
Published: |
Alma Mater Studiorum - Università di Bologna
2012
|
Subjects: | |
Online Access: | http://amsdottorato.unibo.it/4350/ |
Similar Items
-
Exact and Heuristic Algorithms for Routing Problems
by: Battarra, Maria <1981>
Published: (2010) -
Formulations and Algorithms for Routing Problems
by: Salari, Majid <1982>
Published: (2010) -
Heuristic algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem
by: Escobar Velasquez, John Willmer <1980>
Published: (2013) -
Algorithms for Combinatorial Optimization Problems
by: Naji Azimi, Zahra <1982>
Published: (2010) -
Mathematical Optimization for Routing and Logistic Problems
by: Gambella, Claudio <1988>
Published: (2016)