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, it is shown that simple heuristics have strong properties of asymptotically optimal behavior. Submitted for publication
Hierarchial Vehicle Routing Problems
1982
22 pages
Report
No indication
English
Hierarchial shape representation and shape-preserving approximations [3458-33]
British Library Conference Proceedings | 1998
|Wavelet interpolation networks for hierarchial approximation (Invited Paper) [3813-24]
British Library Conference Proceedings | 1999
|Hierarchial Classification of SAR Data with Feature Extraction Method Based on Texture Features
British Library Conference Proceedings | 2003
|