The vehicle routing problem with one-dimensional loading constraints

Junmin Yi, Zhixiong Su and Yihui Qiu

International Journal of Industrial and Systems Engineering, 2017, vol. 27, issue 3, 412-426

Abstract: This paper proposes a vehicle routing problem with one-dimensional loading constraints, originating from a pick-up route planning of milk-run operations in the automotive industry. With analysis on milk-run routing-loading decisions, a wall-building approximation method is applied to vehicle loading, and then the routing problem is introduced as a new CVRP problem with special constraints of one-dimensional loading rather than the 3L-CVRP's full dimensional loading, hence a 1L-CVRP problem emerges. The 1L-CVRP instances with case data are solved by genetic algorithms and discussions are conducted on results, approximation error study and application conditions. With its modelling, solution and application, the systematic scheme of this 1L-CVRP is aimed at enriching the newly-proposed nL-CVRP framework with more dimensionality and instances. In addition, this study also serves as a straightforward paradigm for real-world logistics routing and loading applications.

Keywords: loading constraints; packing problem; dimensions; genetic algorithm; milk-run; wall-building; approximation; vehicle routing problem; VRP. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=87193 (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:ids:ijisen:v:27:y:2017:i:3:p:412-426

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().