Reference model of milk-run traffic systems prototyping

Bocewicz Grzegorz, Nielsen Izabela, Gola Arkadiusz and Banaszak Zbigniew

International Journal of Production Research, 2021, vol. 59, issue 15, 4495-4512

Abstract: A declarative model is developed in this study. It allows us to formulate a constraint satisfaction problem that supports making decisions in the process of seeking a periodic distribution policy with a plan of whom to serve, how much to deliver, by which fleet of logistic trains travelling regularly, and on which routes. Implemented through a constrained, programming-driven solver, it allows for the formulation of forward and reverse milk-run vehicle routing and scheduling problems, subject to the constraints imposed by an in-plant distribution network. Consequently, it can be used to determine the number of transport trips and their organisation in time and space needed for the timely delivery of material to specific loading/unloading points. In this context, the proposed model meets the needs of an interactive search for solutions by the alternate and iterative formulation of successive forward and reverse decision problems.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2020.1766717 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:59:y:2021:i:15:p:4495-4512

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2020.1766717

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().