Competition and Cooperation in Pickup and Multiple Delivery Problems.

Communications in Computer and Information Science(2017)

引用 0|浏览14
暂无评分
摘要
Logistics is a highly competitive industry; large hauliers use their size to benefit from economies of scale while small logistics companies are often well placed to service local clients. To obtain economies of scale, small hauliers may seek to cooperate by sharing loads. This paper investigates the potential for cost savings and problems associated with this idea. We study dynamic scheduling of shared loads for real-world truck haulage in the UK and model it as a dynamic pickup and multiple delivery problem (PMDP). In partnership with Transfaction Ltd., we propose realistic cost and revenue functions to investigate how companies of different sizes could cooperate to both reduce their operational costs and to increase profitability in a number of different scenarios.
更多
查看译文
关键词
Greedy Randomise Adaptive Search Procedure, Tabu List, Variable Neighbourhood Descent, Local Search Operator, Sample Carrier
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要