LD 公司的物流配送路径优化策略研究
##plugins.themes.bootstrap3.article.main##
摘要
整车物流在汽车制造成本中占据十分重要的地位, 在竞争日益激烈的当前, LD 公司不得
不通过物流配送路径优化来降低成本。 本文首先构建了 VPN 模型, 并用节约里程法求解该模型。
然后, 调用 LD 公司某区域的个经销商配送情况作为算例对模型和算法进行了优化的验证, 最后
得出优化结果。 从研究结论来看, 优化后整车配送车辆由 3 辆减少为 2 辆, 配送路径节约了
130 km, 车辆购置费、 维修保养费、 油费、 人工费、 过路费等均有不同程度的降低。 大大节约了
运输路径, 降低了物流成本。 通过验证, 该模型可试图在 LD 公司内部推广, 以求提升 LD 公司
物流配送效率。
##plugins.themes.bootstrap3.article.details##
##submission.howToCite##
Chen, X., & Shang, H. (2017). LD 公司的物流配送路径优化策略研究. 社会科学与管理, 1(2), 76–91. 取读于 从 https://so01.tci-thaijo.org/index.php/CJSSM/article/view/178599
栏目
研究型文章
Chinese Journal of Social Science and Management Editorial Division
The Office of Research and Development, Panyapiwat Institute of Management
85/1 Moo 2, Chaengwattana Rd., Bang Talat, Pakkred, Nonthaburi 11120, Thailand
Tel. 02 855 01048 E-mail: cjssm@pim.ac.th
参考
Azi, N., Gendreau, M. & Potvin, J. Y. (2007). Exact algorithm for a single-vehicle routing problem with time windows and multiple routes. European Journal of Operational Research, 178(3), 755-766.
Baldacci, R., Mingozzi, A. & Roberti, R. (2012). Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research, 218(1), 1-6.
Chen, P., Huang, H. & Dong, X. (2011). Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem. Expert Systems With Applications, 37(2), 1620-1627.
Clarke, G. & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568-581.
Dantzig, G. B. & Ramser, J. H. (1959). The Truck Dispatching Problem. Management Sic, 6(1), 80-91.
Dorigo, M., Maniezzo, V. & Colorni, A. (1996). Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems Man and Cybernetics, 26(1), 29-41.
Fuellerer, G., Doerner, K. F., Hartl, R. F. & Iori, M. (2009). Ant colony Optimization for the two dimension all loading vehicle routing problem. Computer & Operations Research, 36(3), 655-673.
Gendreau, M., Hertz, A. & Laporte, G. (1994). A Tabu Search heuristic for the vehicle routing problem. Management Science, 40(10), 1276-1290.
Lee, C. G., Epelman, M. A., White, C. G. & Bozer, Y. A. (2006). Path approach to the multiple-vehicle routing problem with split pickups. Transportation Research Part B, 40(4), 265-284.
Nikolakopoulos, G., Kortesis, S. & Synefaki, A. (2004). Solving a Vehicle Routing Problem by Balancing the Vehicles Time Utilization. European Journal of Operational Research, 152(2), 520-527.
Torki, A., Somhon, S. & Enkawa, T. (1997). Competitive neural network algorithm for solving vehicle routing Problem. Computers and Industrial Engineering, 33(3-4), 473-476.
Baldacci, R., Mingozzi, A. & Roberti, R. (2012). Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research, 218(1), 1-6.
Chen, P., Huang, H. & Dong, X. (2011). Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem. Expert Systems With Applications, 37(2), 1620-1627.
Clarke, G. & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568-581.
Dantzig, G. B. & Ramser, J. H. (1959). The Truck Dispatching Problem. Management Sic, 6(1), 80-91.
Dorigo, M., Maniezzo, V. & Colorni, A. (1996). Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems Man and Cybernetics, 26(1), 29-41.
Fuellerer, G., Doerner, K. F., Hartl, R. F. & Iori, M. (2009). Ant colony Optimization for the two dimension all loading vehicle routing problem. Computer & Operations Research, 36(3), 655-673.
Gendreau, M., Hertz, A. & Laporte, G. (1994). A Tabu Search heuristic for the vehicle routing problem. Management Science, 40(10), 1276-1290.
Lee, C. G., Epelman, M. A., White, C. G. & Bozer, Y. A. (2006). Path approach to the multiple-vehicle routing problem with split pickups. Transportation Research Part B, 40(4), 265-284.
Nikolakopoulos, G., Kortesis, S. & Synefaki, A. (2004). Solving a Vehicle Routing Problem by Balancing the Vehicles Time Utilization. European Journal of Operational Research, 152(2), 520-527.
Torki, A., Somhon, S. & Enkawa, T. (1997). Competitive neural network algorithm for solving vehicle routing Problem. Computers and Industrial Engineering, 33(3-4), 473-476.