Referenced Items are not available for this document.
Despite the fact that the vehicle routing problem (VRP) with its variants has been widely explored in operations research, there is very little published research on the VRP concerning real world constraint combinations and large problem sizes. In this work a heuristic solution approach for the VRP with real world constraints is presented driven by the requirements defined by clients in the courier, express and parcel (CEP) delivery industry in order to support their routing plan decisions and driver assignments. The solution algorithm used combines several local-search-based heuristics with constructive elements to solve the VRP with driver learning (VRPDL). As conceptual proof large instances for the capacitated VRP (CVRP) including 560 to 1200 customers are tested and compared to known benchmark results. From those instances new sub-instances are created and sequentially tested adding the driver learning constraint. Finally, the solver is applied to real world CEP instances with driver learning.
Published in:
System Science (HICSS), 2012 45th Hawaii International Conference on
Date of Conference: 4-7 Jan. 2012
- Page(s):
- 1315 - 1322
- ISSN :
- 1530-1605
- E-ISBN :
- 978-0-7695-4525-7
- Print ISBN:
- 978-1-4577-1925-7
- INSPEC Accession Number:
- 12541104
- Conference Location :
- Maui, HI
- Digital Object Identifier :
- 10.1109/HICSS.2012.633
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
