文章基本信息

标题：Milk-run routing and scheduling subject to different pick-up/delivery profiles and congestion-avoidance constraints
本地全文：下载
作者：Grzegorz Bocewicz ; Peter Nielsen ; Banaszak Zbigniew 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2019
卷号：52
期号：8
页码：313-320
DOI：10.1016/j.ifacol.2019.08.089
语种：English
出版社：Elsevier
摘要：AbstractTwo kinds of intertwined decisions: the routing decisions, which determine the set of sequences of stations visited by each tugger train’s route, and the scheduling decisions, which plan congestion-free movements of tugger train fleets, are considered. The problem under study can be seen as extension of the pick-up and delivery problem with time windows in which different profiles of separately executed delivery and pick-up operations are assumed. The NP-hard character of the problem considered follows from its roots derived from the vehicle routing and the deadlock-avoidance problems. In this regard, a constraint programming paradigm allowing the further integration of multi-period, multi-trip and multi-commodity flows with various customers’ demands as well as distribution network topology constraints is applied. Consequently, a recursive formulation of a well-known constraint satisfaction problem is proposed. The computer experiments provided illustrate the possibility of using the approach presented in systems of real-life scale.
关键词：KeywordsMilk-run systemvehicle routing problemcongestion avoidanceconstraint programming