Abstract
The original schedule may not be optimal or feasible due to delivery delay caused by disruption. To solve the vehicle rescheduling problem with delivery delay based on loss aversion in prospect theory and customer heterogeneity, a mathematical model is established to minimize the sum of distance cost and penalty cost. Next, an improved compressed annealing algorithm with heterogeneous pressure is proposed to solve the model. Finally, numerical experiments are executed on the basis of 30 classic Solomon benchmarks to test the performance of the proposed solution approach. Sensitivity tests are carried out for the customer waiting sensitivity parameter, the length of delay time, and the time when the delivery delay occurs. The computational results show that, compared to the traditional rescheduling method, the higher the degree of customer heterogeneity, the longer the length of delay time, and, the earlier the distribution delay occurs, the stronger the validity and practicability of the model and algorithm proposed in this paper.
Funder
Program for the Philosophy and Social Sciences Research of Higher Learning Institutions of Shanxi
Subject
Process Chemistry and Technology,Chemical Engineering (miscellaneous),Bioengineering
Reference54 articles.
1. Optimal routing policy problems in stochastic time-dependent networks;Gao;Transp. Res. Part B Meth.,2006
2. Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming;Schmid;Eur. J. Oper. Res.,2012
3. Scenario-based planning for partially dynamic vehicle routing with stochastic customers;Bent;Oper. Res.,2004
4. Real-time control of freight forwarder transportation networks by integrating multimodal transport chains;Bock;Eur. J. Oper. Res.,2010
5. Zeimpekis, V., Tarantilis, C.D., Giaglis, G.M., and Minis, I. (2007). Dynamic Fleet Management: Concepts, Systems, Algorithms & Case Studies, Springer US.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献