Minimum cost VRP with time-dependent speed data and congestion charge

A heuristic algorithm, called LANCOST, is introduced for vehicle routing and scheduling problems to minimize the total travel cost, where the total travel cost includes fuel cost, driver cost and congestion charge. The fuel cost required is influenced by the speed. The speed for a vehicle to travel along any road in the network varies according to the time of travel. The variation in speed is caused by congestion which is greatest during morning and evening rush hours. If a vehicle enters the congestion charge zone at any time, a fixed charge is applied. A benchmark dataset is designed to test the algorithm. The algorithm is also used to schedule a fleet of delivery vehicles operating in the London area. The paper introduces a new heuristic algorithm to solve the cost optimization vehicle routing problem in a time-varying road network with congestion charge.The performance of the heuristic is tested by a specially designed benchmark dataset.The heuristic is also tested using real-world traffic data and road networks where a congestion charge scheme is in operation.

[1]  Michel Gendreau,et al.  An Adaptive Large Neighborhood Search for a Vehicle Routing Problem with Multiple Trips , 2010 .

[2]  Michel Gendreau,et al.  Vehicle Routeing with Multiple Use of Vehicles , 1996 .

[3]  Ryan G. Conrad,et al.  Algorithms to Quantify Impact of Congestion on Time-Dependent Real-World Urban Freight Distribution Networks , 2010 .

[4]  Nico Vandaele,et al.  Vehicle routing with dynamic travel times: A queueing approach , 2008, Eur. J. Oper. Res..

[5]  Paolo Toth,et al.  An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.

[6]  Nicos Christofides,et al.  An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts , 2008, Math. Program..

[7]  Miguel A. Figliozzi,et al.  The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics , 2012 .

[8]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[9]  Miguel A. Figliozzi,et al.  Vehicle Routing Problem for Emissions Minimization , 2010 .

[10]  Gilbert Laporte,et al.  The Pollution-Routing Problem , 2011 .

[11]  Alfredo Olivera,et al.  Adaptive memory programming for the vehicle routing problem with multiple trips , 2007, Comput. Oper. Res..

[12]  Bülent Çatay,et al.  Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge , 2014, Eur. J. Oper. Res..

[13]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[14]  Teodor Gabriel Crainic,et al.  A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows , 2013, Eur. J. Oper. Res..

[15]  Gilbert Laporte,et al.  A comparative analysis of several vehicle emission models for road freight transportation , 2011 .

[16]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[17]  Ismail Karaoglan,et al.  A branch-and-cut algorithm for the vehicle routing problem with multiple use of vehicles , 2015 .

[18]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[19]  Daniele Vigo,et al.  An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem , 2009, Comput. Oper. Res..

[20]  Will Maden,et al.  A Road TimetableTM to aid vehicle routing and scheduling , 2006, Comput. Oper. Res..

[21]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[22]  Richard W. Eglese,et al.  Vehicle routing and scheduling with time-varying data: A case study , 2010, J. Oper. Res. Soc..