Developing a model for the stochastic time-dependent vehicle-routingproblem

Oren E. Nahum; Yuval Hadas

doi:10.1109/iccie.2009.5223595

Developing a model for the stochastic time-dependent vehicle-routingproblem

Oren E. Nahum
, Yuval Hadas

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

14 Scopus citations

Abstract

Vehicle-routing problems (VRP) have been studied in depth. Many variants ofthe problem exist, most of them trying to find a set of routes with theshortest distance possible for a fleet of vehicles. This paper combines twoimportant variants, the stochastic VRP and the time-dependent VRP, to form anddefine the Stochastic Time-Dependent VRP. An efficient heuristic that is a newvariant of the well-known saving algorithm is introduced. The algorithmincorporates simulation that enables an estimate of each route's probability ofbeing the quickest. This new algorithm yields fast results that are 10% higherthan optimal solutions. Such results are similar to the performance of thesaving algorithm when compared to the capacitated VRP.

Original language	English
Title of host publication	2009 International Conference on Computers and Industrial Engineering, CIE 2009
Publisher	IEEE Computer Society
Pages	118-123
Number of pages	6
ISBN (Print)	9781424441365
DOIs	https://doi.org/10.1109/iccie.2009.5223595
State	Published - 2009
Event	2009 International Conference on Computers and Industrial Engineering, CIE 2009 - Troyes, France Duration: 6 Jul 2009 → 9 Jul 2009

Publication series

Name	2009 International Conference on Computers and Industrial Engineering, CIE 2009

Conference

Conference	2009 International Conference on Computers and Industrial Engineering, CIE 2009
Country/Territory	France
City	Troyes
Period	6/07/09 → 9/07/09

Keywords

Heuristics
Simulation
Vehicle routing

Access to Document

10.1109/iccie.2009.5223595

Cite this

Nahum, O. E., & Hadas, Y. (2009). Developing a model for the stochastic time-dependent vehicle-routingproblem. In 2009 International Conference on Computers and Industrial Engineering, CIE 2009 (pp. 118-123). Article 5223595 (2009 International Conference on Computers and Industrial Engineering, CIE 2009). IEEE Computer Society. https://doi.org/10.1109/iccie.2009.5223595

@inproceedings{c671d6e4f23b4ab6aafd997661adcc7c,

title = "Developing a model for the stochastic time-dependent vehicle-routingproblem",

abstract = "Vehicle-routing problems (VRP) have been studied in depth. Many variants ofthe problem exist, most of them trying to find a set of routes with theshortest distance possible for a fleet of vehicles. This paper combines twoimportant variants, the stochastic VRP and the time-dependent VRP, to form anddefine the Stochastic Time-Dependent VRP. An efficient heuristic that is a newvariant of the well-known saving algorithm is introduced. The algorithmincorporates simulation that enables an estimate of each route's probability ofbeing the quickest. This new algorithm yields fast results that are 10\% higherthan optimal solutions. Such results are similar to the performance of thesaving algorithm when compared to the capacitated VRP.",

keywords = "Heuristics, Simulation, Vehicle routing",

author = "Nahum, \{Oren E.\} and Yuval Hadas",

year = "2009",

doi = "10.1109/iccie.2009.5223595",

language = "אנגלית",

isbn = "9781424441365",

series = "2009 International Conference on Computers and Industrial Engineering, CIE 2009",

publisher = "IEEE Computer Society",

pages = "118--123",

booktitle = "2009 International Conference on Computers and Industrial Engineering, CIE 2009",

address = "ארצות הברית",

note = "2009 International Conference on Computers and Industrial Engineering, CIE 2009 ; Conference date: 06-07-2009 Through 09-07-2009",

}

Nahum, OE & Hadas, Y 2009, Developing a model for the stochastic time-dependent vehicle-routingproblem. in 2009 International Conference on Computers and Industrial Engineering, CIE 2009., 5223595, 2009 International Conference on Computers and Industrial Engineering, CIE 2009, IEEE Computer Society, pp. 118-123, 2009 International Conference on Computers and Industrial Engineering, CIE 2009, Troyes, France, 6/07/09. https://doi.org/10.1109/iccie.2009.5223595

Developing a model for the stochastic time-dependent vehicle-routingproblem. / Nahum, Oren E.; Hadas, Yuval.
2009 International Conference on Computers and Industrial Engineering, CIE 2009. IEEE Computer Society, 2009. p. 118-123 5223595 (2009 International Conference on Computers and Industrial Engineering, CIE 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Developing a model for the stochastic time-dependent vehicle-routingproblem

AU - Nahum, Oren E.

AU - Hadas, Yuval

PY - 2009

Y1 - 2009

N2 - Vehicle-routing problems (VRP) have been studied in depth. Many variants ofthe problem exist, most of them trying to find a set of routes with theshortest distance possible for a fleet of vehicles. This paper combines twoimportant variants, the stochastic VRP and the time-dependent VRP, to form anddefine the Stochastic Time-Dependent VRP. An efficient heuristic that is a newvariant of the well-known saving algorithm is introduced. The algorithmincorporates simulation that enables an estimate of each route's probability ofbeing the quickest. This new algorithm yields fast results that are 10% higherthan optimal solutions. Such results are similar to the performance of thesaving algorithm when compared to the capacitated VRP.

AB - Vehicle-routing problems (VRP) have been studied in depth. Many variants ofthe problem exist, most of them trying to find a set of routes with theshortest distance possible for a fleet of vehicles. This paper combines twoimportant variants, the stochastic VRP and the time-dependent VRP, to form anddefine the Stochastic Time-Dependent VRP. An efficient heuristic that is a newvariant of the well-known saving algorithm is introduced. The algorithmincorporates simulation that enables an estimate of each route's probability ofbeing the quickest. This new algorithm yields fast results that are 10% higherthan optimal solutions. Such results are similar to the performance of thesaving algorithm when compared to the capacitated VRP.

KW - Heuristics

KW - Simulation

KW - Vehicle routing

UR - https://www.scopus.com/pages/publications/77956097656

U2 - 10.1109/iccie.2009.5223595

DO - 10.1109/iccie.2009.5223595

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:77956097656

SN - 9781424441365

T3 - 2009 International Conference on Computers and Industrial Engineering, CIE 2009

SP - 118

EP - 123

BT - 2009 International Conference on Computers and Industrial Engineering, CIE 2009

PB - IEEE Computer Society

T2 - 2009 International Conference on Computers and Industrial Engineering, CIE 2009

Y2 - 6 July 2009 through 9 July 2009

ER -

Developing a model for the stochastic time-dependent vehicle-routingproblem

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this