Time-window-based Scheduling Strategy and Optimization for Maximizing the Income of Drop and Pull Transport

Author:

Xu Linlong,Qiu Zheyong,Kang Zibo,Ma Xiaojuan,Xiong Huilin,Yang Lei

Abstract

Abstract As an intensive and efficient way of transportation, drop and pull transport has become the mainstream transportation organization of foreign developed countries and regions. Based on the freight demand vector and aging of a given initial state, this paper established a goal planning and scheduling model based on the maximization of time window revenue to get the most efficient deployment plan under the condition of high customer satisfaction. The genetic algorithm based on task urgency was used to solve this model to obtain the optimal allocation scheme of total income. Finally, the number of algorithm iterations was analyzed, which proved the effectiveness of the algorithm performance. Through the sensitivity analysis of the number of tractors, this paper gave suggestions for more efficient tractor configuration.

Publisher

IOP Publishing

Subject

General Medicine

Reference11 articles.

1. Solving the Multi-Truck and Trailer Routing Problem Based on Tabu Search Algorithm [J];Ma;Chinese Journal of Management Science,2016

2. Swap Trailer Path Planning Based on Simulated Annealing Algorithm [J];Ma;Chinese Journal of Management Science,2016

3. Research on the Countermeasures of Developing the Suspended Transportation in China [J];Xiao;Heilongjiang Transportation Technology,2011

4. A tabu search method for the truck and trailer routing problem [J];Chao;Computers & Operations Research,2002

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3