|Table of Contents|

Optimization on tractor-and-trailer transportation scheduling with uncertain empty-trailer tasks(PDF)

《交通运输工程学报》[ISSN:1671-1637/CN:61-1369/U]

Issue:
2016年05期
Page:
103-111
Research Field:
交通运输规划与管理
Publishing date:

Info

Title:
Optimization on tractor-and-trailer transportation scheduling with uncertain empty-trailer tasks
Author(s):
YANG Zhen-hua1;  YANG Guang-min1; 2;  XU Qi1;  GUO Shu-juan1;  JIN Zhi-hong1
1. School of Transportation Management, Dalian Maritime University, Dalian 116026, Liaoning, China; 2. Yunnan Science Research Institute of Communications and Transportation, Kunming 650011, Yunnan, China
Keywords:
tractor-and-trailer transportation;  heuristic algorithm;  scheduling optimization;  empty-trailer supply and demand;  task switching distance;  node task surplus
PACS:
U492.22
DOI:
-
Abstract:
In actual road network, the optimization model on tractor-and-trailer transportation scheduling with uncertain empty-trailer tasks was built. A two-stage heuristic algorithm was designed to solve the model. At the first stage, the transportation scheme of empty-trailer task was decided by two strategies, minimizing the transportation distance of empty-trailer and minimizing the total surplus of origin destination(OD)points for heavy-trailer tasks respectively. At the second stage, the task node surplus and the greed thought were combined to determine the execution sequence of all tasks. Numerical examples were used to analyze the performance of the algorithm. Analysis result shows that empty-trailer transportation cost and total cost are 325.5 and 1 010.5 yuan respectively, which respectively save by 10.44% and 3.62% compared to the original scheme, and less tractors are used. Based on the numerical example of tractor-and-trailer transportation among cities in Liaoning Province, the optimal values under two strategies, minimizing the transportation distance of empty-trailer and minimizing the total surplus of OD points for heavy-trailer tasks are 2 561.3 and 2 464.6 yuan respectively, average solving times are 21.5 and 27.3 s respectively, and the results under the second strategy have good stability. The total costs computed by using simulated annealing algorithm are all above 3 100 yuan, and the solving times are all above 80 s. So, the algorithm in this paper has higher precision and efficiency, and the strategy of minimizing total surplus of OD points for heavy-trailer tasks has obvious advantages on tractor-and-trailer transportation scheduling problem with uncertain empty-trailer tasks. 7 tabs, 8 figs, 25 refs.

References:

[1] CHAO I M. A tabu search method for the truck and trailer routing problem[J]. Computers and Operations Research, 2002, 29(1): 33-51.
[2] LIN S W, YU V F, CHOU S Y. Solving the truck and trailer routing problem based on a simulated annealing heuristic[J]. Computers and Operations Research, 2009, 36(5): 1683-1692.
[3] LIN S W, YU V F, CHOU S Y. A note on the truck and trailer routing problem[J]. Expert Systems with Applications, 2010, 37(1): 899-903.
[4] LIN S W, YU V F, LU C C. A simulated annealing heuristic for the truck and trailer routing problem with time windows[J]. Expert Systems with Applications, 2011, 38(12): 15244-15252.
[5] VILLEGAS J G, PRINS C, PRODHON C, et al. GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots[J]. Engineering Applications of Artificial Intelligence, 2010, 23(5): 780-794.
[6] VILLEGAS J G, PRINS C, PRODHON C, et al. A GRASP with evolutionary path relinking for the truck and trailer routing problem[J]. Computers and Operations Research, 2011, 38(9): 1319-1334.
[7] VILLEGAS J G, PRINS C, PRODHON C, et al. A matheuristic for the truck and trailer routing problem[J]. European Journal of Operational Research, 2013, 230(2): 231-244.
[8] DERIGS U, PULLMANN M, VOGEL U. Truck and trailer routing—problems, heuristics and computational experience[J]. Computers and Operations Research, 2013, 40(2): 536-546.
[9] ZHANG Rui-you, LU J C, WANG Ding-wei. Container drayage problem with flexible orders and its near real-time solution strategies[J]. Transportation Research Part E: Logistics and Transportation Review, 2014, 61: 235-251.
[10] SCHEUERER S. A tabu search heuristic for the truck and trailer routing problem[J]. Computers and Operations Research, 2006, 33(4): 894-909.
[11] MIRMOHAMMADSADEGHI S, AHMED S. Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry[J]. Mathematical Problems in Engineering, 2015, 2015: 1-14.
[12] 胡志华,陶 莎.基于混合进化算法的甩挂配送问题[J].公路交通科技,2013,30(5):147-152.HU Zhi-hua, TAO Sha. Distribution by trailer pick-up transport based on hybrid evolutionary algorithm[J]. Journal of Highway and Transportation Research and Development, 2013, 30(5): 147-152.(in Chinese)
[13] TAN K C, CHEW Y H, LEE L H. A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems[J]. European Journal of Operational Research, 2006, 172(3): 855-885.
[14] LEE L H, TAN K C, OU K, et al. Vehicle capacity planning system: a case study on vehicle routing problem with time windows[J]. IEEE Transactions on Systems, Man, and Cybernetics—Part A: Systems and Humans, 2003, 33(2): 169-178.
[15] XUE Zhao-jie, ZHANG Can-rong, LIN Wei-hua, et al. A tabu search heuristic for the local container drayage problem under a new operation mode[J]. Transportation Research Part E: Logistics and Transportation Review, 2014, 62: 136-150.
[16] XUE Zhao-jie, LIN Wei-hua, MIAO Li-xin, et al. Local container drayage problem with tractor and trailer operating in separable mode[J]. Flexible Services and Manufacturing Journal, 2015, 27(2): 431-450.
[17] XUE Zhao-jie, ZHANG Can-rong, YANG Peng, et al. A combinatorial benders’ cuts algorithm for the local container drayage problem[J]. Mathematical Problems in Engineering, 2015, 2015: 1-7.
[18] FRANCIS P, ZHANG Guang-ming, SMILOWITZ K. Improved modeling and solution methods for the multi-resource routing problem[J]. European Journal of Operational Research, 2007, 180(3): 1045-1059.
[19] CHENG Yao-rong, LIANG Bo, ZHOU Mei-hua. Optimization for vehicle scheduling in iron and steel works based on semi-trailer swap transport[J]. Journal of Central South University of Technology, 2010, 17(4): 873-879.
[20] LI Hong-qi, LU Yue, ZHANG Jun, et al. Solving the tractor and semi-trailer routing problem based on a heuristic approach[J]. Mathematical Problems in Engineering, 2012, 2012: 1-12.
[21] 余 莉,林 桦,陈伯如.网络型甩挂运输模式下的车辆调度问题[J].交通运输工程与信息学报,2014,12(2):58-64.YU Li, LIN Hua, CHEN Bo-ru. Research of vehicle scheduling problem of the network drop and pull transport[J]. Journal of Transportation Engineering and Information, 2014, 12(2): 58-64.(in Chinese)
[22] 薛 亮,马健霄,余 伟.甩挂运输具体应用分析[J].交通运输系统工程与信息,2011,11(5):200-205.XUE Liang, MA Jian-xiao, YU Wei. Application analysis of drop and pull transport[J]. Journal of Transportation Systems Engineering and Information Technology, 2011, 11(5): 200-205.(in Chinese)
[23] 钟慧玲,吴 聪,张冠湘,等.内河港口甩挂运输组织中场站选址问题研究[J].交通运输系统工程与信息,2013,13(3):126-131,137.ZHONG Hui-ling, WU Cong, ZHANG Guan-xiang, et al. Freight station location of inland port semi-trailer swap transport organization[J]. Journal of Transportation Systems Engineering and Information Technology, 2013, 13(3): 126-131, 137.(in Chinese)
[24] 胡志华,曹 杨,王云霞.集装箱集散的空重箱循环甩挂调度方法[J].武汉理工大学学报,2012,34(10):68-73.HU Zhi-hua, CAO Yang, WANG Yun-xia. Cyclic tractor-and-trailer scheduling for consolidation and distribution of loaded and empty containers[J]. Journal of Wuhan University of Technology, 2012, 34(10): 68-73.(in Chinese)
[25] 胡志华.集装箱码头间互拖的集卡甩挂运输调度问题[J].重庆交通大学学报:自然科学版,2013,32(2):313-317.HU Zhi-hua. Scheduling of container truck-and-trailer transport between two ports[J]. Journal of Chongqing Jiaotong University: Natural Science, 2013, 32(2): 313-317.(in Chinese)

Memo

Memo:
-
Last Update: 2016-10-20