Anticipatory algorithms for same-day courier dispatching

Gianpaolo Ghiani, Emanuele Manni, Antonella Quaranta, Chefi Triki

Research output: Contribution to journalArticle

41 Citations (Scopus)

Abstract

This paper describes anticipatory algorithms for the dynamic vehicle dispatching problem with pickups and deliveries, a problem faced by local area courier companies. These algorithms evaluate alternative solutions through a short-term demand sampling and a fully sequential procedure for indifference zone selection. They also exploit an unified and integrated approach in order to address all the issues involved in real-time fleet management, namely assigning requests to vehicles, routing the vehicles, scheduling the routes and relocating idle vehicles. Computational results show that the anticipatory algorithms provide consistently better solutions than their reactive counterparts.

Original languageEnglish
Pages (from-to)96-106
Number of pages11
JournalTransportation Research Part E: Logistics and Transportation Review
Volume45
Issue number1
DOIs
Publication statusPublished - Jan 2009

Fingerprint

Vehicle routing
Pickups
scheduling
Scheduling
Sampling
demand
management
Dispatching
Industry
time
Vehicle scheduling
Integrated approach
Indifference
Pickup and delivery

Keywords

  • Courier industry
  • Idle vehicle relocation
  • Real-time vehicle routing and dispatching
  • Waiting strategies

ASJC Scopus subject areas

  • Business and International Management
  • Management Science and Operations Research
  • Transportation

Cite this

Anticipatory algorithms for same-day courier dispatching. / Ghiani, Gianpaolo; Manni, Emanuele; Quaranta, Antonella; Triki, Chefi.

In: Transportation Research Part E: Logistics and Transportation Review, Vol. 45, No. 1, 01.2009, p. 96-106.

Research output: Contribution to journalArticle

Ghiani, Gianpaolo ; Manni, Emanuele ; Quaranta, Antonella ; Triki, Chefi. / Anticipatory algorithms for same-day courier dispatching. In: Transportation Research Part E: Logistics and Transportation Review. 2009 ; Vol. 45, No. 1. pp. 96-106.
@article{4e1f4c34c48e46a1b6fdfe9612b59b73,
title = "Anticipatory algorithms for same-day courier dispatching",
abstract = "This paper describes anticipatory algorithms for the dynamic vehicle dispatching problem with pickups and deliveries, a problem faced by local area courier companies. These algorithms evaluate alternative solutions through a short-term demand sampling and a fully sequential procedure for indifference zone selection. They also exploit an unified and integrated approach in order to address all the issues involved in real-time fleet management, namely assigning requests to vehicles, routing the vehicles, scheduling the routes and relocating idle vehicles. Computational results show that the anticipatory algorithms provide consistently better solutions than their reactive counterparts.",
keywords = "Courier industry, Idle vehicle relocation, Real-time vehicle routing and dispatching, Waiting strategies",
author = "Gianpaolo Ghiani and Emanuele Manni and Antonella Quaranta and Chefi Triki",
year = "2009",
month = "1",
doi = "10.1016/j.tre.2008.08.003",
language = "English",
volume = "45",
pages = "96--106",
journal = "Transportation Research, Part E: Logistics and Transportation Review",
issn = "1366-5545",
publisher = "Elsevier Limited",
number = "1",

}

TY - JOUR

T1 - Anticipatory algorithms for same-day courier dispatching

AU - Ghiani, Gianpaolo

AU - Manni, Emanuele

AU - Quaranta, Antonella

AU - Triki, Chefi

PY - 2009/1

Y1 - 2009/1

N2 - This paper describes anticipatory algorithms for the dynamic vehicle dispatching problem with pickups and deliveries, a problem faced by local area courier companies. These algorithms evaluate alternative solutions through a short-term demand sampling and a fully sequential procedure for indifference zone selection. They also exploit an unified and integrated approach in order to address all the issues involved in real-time fleet management, namely assigning requests to vehicles, routing the vehicles, scheduling the routes and relocating idle vehicles. Computational results show that the anticipatory algorithms provide consistently better solutions than their reactive counterparts.

AB - This paper describes anticipatory algorithms for the dynamic vehicle dispatching problem with pickups and deliveries, a problem faced by local area courier companies. These algorithms evaluate alternative solutions through a short-term demand sampling and a fully sequential procedure for indifference zone selection. They also exploit an unified and integrated approach in order to address all the issues involved in real-time fleet management, namely assigning requests to vehicles, routing the vehicles, scheduling the routes and relocating idle vehicles. Computational results show that the anticipatory algorithms provide consistently better solutions than their reactive counterparts.

KW - Courier industry

KW - Idle vehicle relocation

KW - Real-time vehicle routing and dispatching

KW - Waiting strategies

UR - http://www.scopus.com/inward/record.url?scp=57149125424&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57149125424&partnerID=8YFLogxK

U2 - 10.1016/j.tre.2008.08.003

DO - 10.1016/j.tre.2008.08.003

M3 - Article

AN - SCOPUS:57149125424

VL - 45

SP - 96

EP - 106

JO - Transportation Research, Part E: Logistics and Transportation Review

JF - Transportation Research, Part E: Logistics and Transportation Review

SN - 1366-5545

IS - 1

ER -