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


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Hierarchial Vehicle Routing Problems


    Contributors:

    Publication date :

    1982


    Size :

    22 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English




    Hierarchial shape representation and shape-preserving approximations [3458-33]

    Cornea, A. E. / Cornea, M. R. / Jawerth, B. D. et al. | British Library Conference Proceedings | 1998


    Wavelet interpolation networks for hierarchial approximation (Invited Paper) [3813-24]

    Bernard, C. P. / Mallat, S. G. / Slotine, J. J. et al. | British Library Conference Proceedings | 1999




    Hierarchial Classification of SAR Data with Feature Extraction Method Based on Texture Features

    Kasapoglu, G. / Yazgan, B. | British Library Conference Proceedings | 2003