Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at
the delivery location
期刊名称： Networks
作者： Sarasola, Briseida, Doerner, Karl F.
年份： 2020年
期号： 第1期
关键词： adaptive large neighborhood search; cooperation; metaheuristic; self-
adaptive
imposed time windows; synchronized transportation; vehicle routing problem
摘要：A vehicle routing problem with synchronization constraints arises in urban freight transportation, in which context customers require deliveries from one or more logistics service providers. These deliveries should be efficient to reduce idle times at the delivery locations. Idle time is defined as nonse
rvice time between the first and the last delivery received by the customer. We propose a strategy which relies on self-imposed time windows, and we compare our approach with an exact determination of a feasible schedule and fixed time windows. The results show that idle times can be reduced by 54.12%-79.77%, with an average cost rise of 9.87%. In addition, self-imposed time windows provide solutions with 15.74%-21.43% lower costs than feasibility checks for short runtimes and 13.71%-21.15% lower than fixed time windows.
内容由中国教育图书进出口有限公司引进

版权声明：本站内容均来自互联网，仅供演示用，请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系QQ:729038198，我们将在24小时内删除。