论文信息 - A local-search-based solution for milkrun logistics optimization - 字舞流文

A local-search-based solution for milkrun logistics optimization

László Monostori | Dávid Gyulai

[1] Florian Klug. Logistikmanagement in der Automobilindustrie , 2010 .

[2] M. Yue,et al. A simple proof of the inequality MFFD(L)≤71/60 OPT(L) + 1,L for the MFFD bin-packing algorithm , 1991 .

[3] Andreas Reinholz,et al. A Modelling and Optimization Framework for Real-World Vehicle Routing Problems , 2008 .

[4] Hoong Chuin Lau,et al. Vehicle routing problem with time windows and a limited number of vehicles , 2003, Eur. J. Oper. Res..

[5] Wheeler Ruml,et al. A Comparison of Greedy Search Algorithms , 2010, SOCS.

[6] Michel Gendreau,et al. A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[7] Maged M. Dessouky,et al. An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem , 2004, Transp. Sci..

[8] George B. Dantzig,et al. The Truck Dispatching Problem , 1959 .

[9] Gilles Pesant,et al. Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis , 2012, Transp. Sci..