Title
A Heuristic Algorithm For The Load-Dependent Capacitated Vehicle Routing Problem With Time Windows
Abstract
In this paper we introduce an extension of the vehicle routing problem with time windows (VRPTW) called the Load-dependent Capacitated Vehicle Routing Problem with Time Windows (LDVRPTW). This problem differs from the classical VRP and VRPTW on the transportation costs, which are calculated not only on the travel distance, but also the loads on the arcs. We propose a metaheuristic to address this LDVRPTW problem. The proposed algorithm is tested on benchmark instances on special case problems of LDVRPTW. Numerical results show that on some LDVRPTW variants our metaheuristic outperforms the available state-of-the-art exact and heuristic methods.
Year
Venue
Keywords
2015
2015 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM)
Vehicle Routing, Load-dependent, Time windows, Metaheuristic
Field
DocType
Citations 
Mathematical optimization,Vehicle routing problem,Heuristic,Heuristic (computer science),Destination-Sequenced Distance Vector routing,Space exploration,Engineering,Operations management,Metaheuristic,Special case
Conference
0
PageRank 
References 
Authors
0.34
6
3
Name
Order
Citations
PageRank
Ran Liu1373.81
Z. B. Jiang224236.08
Biao Yuan3143.58