Some compact expressions are defined to evaluate the average distance traveled in vehicle routing problems in circular and elliptic zones. These formulas have been carried out empirically from the results obtained by the application to a set of problems of heuristic algorithms (Clarke and Wright, Fisher and Jaikumar, and Gillet and Miller) and Daganzo's method based on continuous approximations of the demand spatial distribution. The problems are solved and designed automatically by a computer. Vehicle capacity has been the only constraint considered in the tour design. If N is the number of points and C is the vehicle capacity, it has been shown that the Clarke and Wright algorithm provides the best solutions especially when N < 50 or N/C < 14. However, solutions with Daganzo's method are not adequate when N/C ≤ 3.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Formulas for Estimating Average Distance Traveled in Vehicle Routing Problems in Elliptic Zones


    Additional title:

    Transportation Research Record


    Contributors:


    Publication date :

    2004-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Formulas for Estimating Average Distance Traveled in Vehicle Routing Problems in Elliptic Zones

    Robuste, F. / Estrada, M. / Lopez-Pita, A. et al. | British Library Conference Proceedings | 2004



    Estimating vehicle miles traveled combined with ITS data

    Teng, Hualiang | Online Contents | 2011


    Review of Methods for Estimating Vehicle Miles Traveled

    Kumapley, R. K. / Fricker, J. D. / National Research Council; Transportation Research Board | British Library Conference Proceedings | 1996


    Review of Methods for Estimating Vehicle Miles Traveled

    Kumapley, Robert K. / Fricker, Jon D. | Transportation Research Record | 1996