Advertisement

4OR

, Volume 16, Issue 4, pp 447–448 | Cite as

Aggregated formulations, exact and heuristic algorithms for pickup and delivery routing problems

  • Bruno P. Bruck
PhD Thesis
  • 90 Downloads

This is a summary of the author’s Ph.D. thesis supervised by Manuel Iori and defended on March 21, 2016 at the Università degli Studi di Modena e Reggio Emilia. The thesis is written in English and is available from the author upon request at bruno.p.bruck@gmail.com and can be downloaded from https://morethesis.unimore.it/theses/available/etd-03142016-105813.

In this work we focus on the study and development of efficient exact and heuristic algorithms to solve vehicle routing problems with pickups and deliveries. More specifically, we are interested in variants that have relevant real world applications. We first address the class of one-to-many-to-one single vehicle routing problems with pickups and deliveries, and concentrate our efforts on the most studied problem of this class, known as the single vehicle routing problem with deliveries and selective pickups. While most exact approaches in the literature are based on disaggregated formulations, we focus instead on aggregated ones....

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

There are no affiliations available

Personalised recommendations