Look-ahead strategies for dynamic pickup and delivery problems

Research output: Contribution to journalArticleAcademicpeer-review

23 Citations (Scopus)
66 Downloads (Pure)

Abstract

In this paper we consider a dynamic full truckload pickup and delivery problem with time-windows. Jobs arrive over time and are offered in a second-price auction. Individual vehicles bid on these jobs and maintain a schedule of the jobs they have won. We propose a pricing and scheduling strategy based on dynamic programming where not only the direct costs of a job insertion are taken into account, but also the impact on future opportunities. Simulation is used to evaluate the benefits of pricing opportunities compared to simple pricing strategies in various market settings. Numerical results show that the proposed approach provides high quality solutions, in terms of profits, capacity utilization, and delivery reliability.
Original languageEnglish
Pages (from-to)395-421
JournalOR Spectrum = OR Spektrum
Volume32
Issue number2
DOIs
Publication statusPublished - 2010

Keywords

  • IR-78241
  • METIS-268587
  • Dynamic vehicle routing - Multi-agent systems - Auctions - Scheduling

Fingerprint Dive into the research topics of 'Look-ahead strategies for dynamic pickup and delivery problems'. Together they form a unique fingerprint.

Cite this