A VNS solution and objectives tradeoffs for real-life large-scale vehicle routing problems Online publication date: Mon, 31-Jan-2022
by Yongzhong Wu; Mianmian Huang; Jianjun Yu; Qiran Wang
International Journal of Industrial and Systems Engineering (IJISE), Vol. 39, No. 4, 2021
Abstract: With the fast development of urban logistics, real-life vehicle routing problems (VRP) are characterised by their large size and complicated objectives and constraints. In contrast, most research on VRP has been based on classic test cases which are relatively small and have standard objectives. By investigating the case of a real urban security carrier in China, this paper proposes an efficient variable neighbourhood search (VNS) for large-scale VRP with various objectives and constraints, including number of vehicles, total travel time, total travel distance, total waiting time and total late time. The method is used to explore the tradeoffs among different objectives and constraints. It is found that although these objectives and constraints are contradictory by nature, increasing the weighting factor of one does not necessarily undermine (or at least not significantly undermine) the others. Such dynamics in the tradeoffs among different objectives provides users with more flexibility.
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