Solving the capacitated vehicle routing problem with two-dimensional loading constraints using a parallel VNS approach Online publication date: Mon, 19-Dec-2022
by Ines Sbai; Saoussen Krichen; Olfa Limam
International Journal of Metaheuristics (IJMHEUR), Vol. 8, No. 1, 2022
Abstract: A combination of the two most important problems in logistics called the capacitated vehicle routing problem with two-dimensional loading constraint is studied in this article. It aims in designing the most appropriate pathways, starting and terminating at a central depot, minimising the total transportation cost with a homogenous fleet of vehicles. Items loaded in each vehicle's trip must satisfy the two-dimensional of orthogonal packing constraint. Since the problem is an NP-hard optimisation problem, a large number of approaches have been proposed. Whereas, finding the exact solution via optimisation is still a challenging problem due to their complexity. In order to increase the exploration in the solution space, we propose the parallel variable neighbourhood search algorithm. It is tested with 180 benchmark instances and compared with state-of-the-art approaches. The results showed that our approach is competitive in terms of the quality of solutions found.
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 Metaheuristics (IJMHEUR):
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