The vehicle routing problem with one-dimensional loading constraints Online publication date: Wed, 11-Oct-2017
by Junmin Yi; Zhixiong Su; Yihui Qiu
International Journal of Industrial and Systems Engineering (IJISE), Vol. 27, No. 3, 2017
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook