Exact Algorithms for Different Classes of Vehicle Routing Problems


Autoria(s): Roberti, Roberto
Contribuinte(s)

Mingozzi, Aristide

Toth, Paolo

Data(s)

02/04/2012

Resumo

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 digraph. We survey models and classical relaxations, and describe the most effective exact algorithms from the literature. A survey and analysis of the polynomial formulations is provided. The considered algorithms and formulations are experimentally compared on benchmark instances. The TSPTW requires finding, in a weighted digraph, a least-cost Hamiltonian tour visiting each vertex within a given time window. We propose a new exact method, based on new tour relaxations and dynamic programming. Computational results on benchmark instances show that the proposed algorithm outperforms the state-of-the-art exact methods. In the VRPTW, a fleet of identical capacitated vehicles located at a depot must be optimally routed to supply customers with known demands and time window constraints. Different column generation bounding procedures and an exact algorithm are developed. The new exact method closed four of the five open Solomon instances. The MTVRP is the problem of optimally routing capacitated vehicles located at a depot to supply customers without exceeding maximum driving time constraints. Two set-partitioning-like formulations of the problem are introduced. Lower bounds are derived and embedded into an exact solution method, that can solve benchmark instances with up to 120 customers. The 2E-CVRP requires designing the optimal routing plan to deliver goods from a depot to customers by using intermediate depots. The objective is to minimize the sum of routing and handling costs. A new mathematical formulation is introduced. Valid lower bounds and an exact method are derived. Computational results on benchmark instances show that the new exact algorithm outperforms the state-of-the-art exact methods.

Formato

application/pdf

Identificador

http://amsdottorato.unibo.it/4350/2/Roberti_Roberto_tesi.pdf

urn:nbn:it:unibo-4316

Roberti, Roberto (2012) Exact Algorithms for Different Classes of Vehicle Routing Problems, [Dissertation thesis], Alma Mater Studiorum Università di Bologna. Dottorato di ricerca in Automatica e ricerca operativa <http://amsdottorato.unibo.it/view/dottorati/DOT478/>, 24 Ciclo. DOI 10.6092/unibo/amsdottorato/4350.

Idioma(s)

en

Publicador

Alma Mater Studiorum - Università di Bologna

Relação

http://amsdottorato.unibo.it/4350/

Direitos

info:eu-repo/semantics/openAccess

Palavras-Chave #MAT/09 Ricerca operativa
Tipo

Tesi di dottorato

NonPeerReviewed