Premium
Hierarchical vehicle routing problems
Author(s) -
Marchetti Spaccamela A.,
Rinnooy Kan A. H. G.,
Stougie L.
Publication year - 1984
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230140408
Subject(s) - heuristics , vehicle routing problem , mathematical optimization , probabilistic logic , computer science , simple (philosophy) , routing (electronic design automation) , stochastic programming , mathematics , artificial intelligence , computer network , philosophy , epistemology
Hierarchical vehicle routing problems, in which the decision to acquire a number of vehicles has to be based on imperfect (probabilistic) information about the location of future customers, allow a natural formulation as two‐stage stochastic programming problems, where the objective is to minimize the sum of the acquisition cost and the length of the longest route assigned to any vehicle. For several versions of this difficult optimization problem, we show that simple heuristics have strong properties of asymptotically optimal behavior.