Volume 11 Issue 1
. 
Turn off MathJax
Article Contents
Article Navigation >  Journal of Traffic and Transportation Engineering  > 2011  >  11(1): 95-99
Next Previous
XING Zhan-wen, GUO Xiao-fen, WEI Juan. Solution of vehicle routing problem with backhauls considering cost of arranging freight in carriage[J]. Journal of Traffic and Transportation Engineering, 2011, 11(1): 95-99. doi: 10.19818/j.cnki.1671-1637.2011.01.016
Citation: XING Zhan-wen, GUO Xiao-fen, WEI Juan. Solution of vehicle routing problem with backhauls considering cost of arranging freight in carriage[J]. Journal of Traffic and Transportation Engineering, 2011, 11(1): 95-99. doi: 10.19818/j.cnki.1671-1637.2011.01.016
shu

Solution of vehicle routing problem with backhauls considering cost of arranging freight in carriage

doi: 10.19818/j.cnki.1671-1637.2011.01.016
  • 1.

    School of Automobile, Chang'an University, Xi'an 710064, Shaanxi, China

  • 2.

    School of Economics and Management, Beijing Jiaotong University, Beijing 100044, China

More Information
  • Author Bio:

    XING Zhan-wen(1974-), male, doctoral student, +86-29-82334728, nmgxzw@126.com

    GUO Xiao-fen(1939-), male, professor, +86-29-82334728, xfg@chd.edu.cn

  • Received Date: 2010-09-29
  • Publish Date: 2011-02-25
    Abstract
  • Considering the cost of arranging freight in carriage, a mathematic model of vehicle routing problem with backhauls was set up, and was solved by using tabu search algorithm. The vehicle routes of a large logistics enterprise with its intraday tasks including delivery and collection business in Beijing were optimized by using the model and the algorithm, and the optimization was completed in 5 s. Calculation result shows that under the condition that the total distance increases by 7.8%, the distribution cost of vehicle reduces by 24.5% compared with saving algorithm, and the equilibrium value increases by 9.3%. The model and the algorithm reduce the workloads of dispatchers and save the transport costs of logistics enterprises.

     

    • FullText(HTML)
  • loading
    • References(13)
  • [1]
    GUO Fu, LONG Ying. On the algorithm for VRPBTW(vehicle routing problem with backhauls and time windows)[J]. Journal of Northeastern University: Natural Science, 2006, 27(5): 575-578. (in Chinese) doi: 10.3321/j.issn:1005-3026.2006.05.027
    [2]
    GOETSCHALCKX M, JACOBS-BLECHA C. The vehicle routing problem with backhauls[J]. European Journal of Operational Research, 1989, 42(1): 39-51. doi: 10.1016/0377-2217(89)90057-X
    [3]
    DUHAMEL C, POTVI N J Y, ROUSSEAU J M. A tabu search heuristic for the vehicle routing problem with backhauls and time windows[J]. Transportation Science, 1997, 31(1): 49-59. doi: 10.1287/trsc.31.1.49
    [4]
    TOTHP, VIGO D. A heuristic algorithmfor the symmetric and asymmetric vehicle routing problems with backhauls[J]. European Journal of Operational Research, 1999, 113(3): 528-543. doi: 10.1016/S0377-2217(98)00086-1
    [5]
    MI NGOZZI A, GIORGI S, BALDACCI R. An exact method for the vehicle routing problem with backhauls[J]. Transportation Science, 1999, 33(3): 315-329. doi: 10.1287/trsc.33.3.315
    [6]
    SALHI S, NAGY G. Acluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling[J]. Journal of the Operational Research Society, 1999, 50(10): 1034-1042. doi: 10.1057/palgrave.jors.2600808
    [7]
    WU Tai-shi, CHEN Jeng-fung, XU Jun-cheng. Solving vehicle routing problem with backhauls[J]. Journal of the Chinese Institute of Industrial Engineers, 2003, 20(6): 651-665. (in Chinese)
    [8]
    KOHEI N. A theorem on the expected complexity of Dijkstra's shortest path algorithm[J]. Journal of Algorithms, 1985, 6(3): 400-408. doi: 10.1016/0196-6774(85)90009-4
    [9]
    BRANDAO J. A new tabu search algorithmfor the vehiclerouting problem with backhauls[J]. European Journal of Operational Research, 2006, 173(2): 540-555.
    [10]
    CLARKE G, WRIGHT J W. Scheduling of vehicles from a central depot to a number of delivery points[J]. Operations Research, 1964, 12(4): 568-581. doi: 10.1287/opre.12.4.568
    [11]
    HU Da-wei, CHEN Cheng, WANG Lai-jun. Hybrid-geneticheuristic algorithmof vehicle routing problem with hard timewindows[J]. Journal of Traffic and Transportation Engineering, 2007, 7(5): 112-117. (in Chinese) http://transport.chd.edu.cn/article/id/200705024
    [12]
    CAO Jian-dong, ZHENG Si-fa, LI AO Yan-nan, et al. Optimization of the urban pick up and delivery problem with hybrid tabu search algorithm[J]. Journal of Wuhan University of Technology: Transportation Science and Engineering, 2009, 33(5): 848-851. (in Chinese) doi: 10.3963/j.issn.1006-2823.2009.05.009
    [13]
    BU Lei, YI N Chuan-zhong, ZHAO Yi. Model and algorithm of vehicle routing problemon railway baggage and parcel[J]. Journal of Tongji University: Natural Science, 2007, 35(8): 1069-1073. (in Chinese) doi: 10.3321/j.issn:0253-374X.2007.08.014
    • Relative Articles
    • Supplements(0)
    • Cited By

Catalog

    Get Citation
    PDF
    XML

    Article Metrics

    Article views (845) PDF downloads(439) Cited by()
    Related

    Copyright《Journal of Traffic and Transportation Engineering》编辑部陕ICP备05001904号-1

    Address ：Editorial Department of Journal of Traffic and Transportation Engineering, Chang 'an University, Middle Section of South Second Ring Road, Xi 'an, Shaanxi（710064） Tel：029-82334388 Email：jygc@chd.edu.cn

    All visit:Today's visit:

    Supported by: Beijing Renhe Information Technology Co. Ltd    

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return