Fleet management for pickup and delivery problems with multiple locations and preferences

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

1 Citation (Scopus)

Abstract

To provide more routing flexibility and improve service in delivery processes, we extend the Pickup and Delivery Problem with multiple time-location combinations for service. Furthermore, we introduce preference possibilities for each option, and aim for finding solutions that balance minimizing total travel costs and customer or operator dissatisfaction. We compare an Adaptive Large Neighborhood Search metaheuristic with solving the problem exactly. Simulation experiments indicate that a multiple-location scenario is highly beneficial compared to the corresponding single-location scenario and that the metaheuristic always finds the optimum if this could be computed by the exact solver.
Original languageEnglish
Title of host publicationDynamics in Logistics
Subtitle of host publicationProceedings of the 6th International Conference LDIC 2018, Bremen, Germany
EditorsMichael Freitag, Herbert Kotzab, Jürgen Pannek
Place of PublicationCham, Switzerland
PublisherSpringer
Pages86-94
ISBN (Electronic)978-3-319-74225-0
ISBN (Print)978-3-319-74224-3
DOIs
Publication statusPublished - 2018
EventLDIC 2018: 6th International Conference on Dynamics in Logistics - Bremen, Germany
Duration: 20 Feb 201822 Feb 2018

Publication series

NameLecture Notes in Logistics
ISSN (Print)2194-8917
ISSN (Electronic)2194-8925

Conference

ConferenceLDIC 2018: 6th International Conference on Dynamics in Logistics
CountryGermany
CityBremen
Period20/02/1822/02/18

Keywords

  • Vehicle routing
  • Pickup and delivery problem
  • GPDPTWP
  • Multiple locations
  • Time windows
  • Preferences
  • Customer satisfaction

Fingerprint

Dive into the research topics of 'Fleet management for pickup and delivery problems with multiple locations and preferences'. Together they form a unique fingerprint.

Cite this