Modelization of Time-Dependent Urban Freight Problems by Using a Multiple Number of Distribution Centers

The aim of the paper is to model urban distribution vehicle routing problems by means of hubs in large cities. The idea behind the urban distribution center (DC) is to provide buffer points where cargo and packages which are to be delivered to shops and businesses can be stored beforehand. At these centers, there will be other kinds of routing problems corresponding to other fairly similar distribution problems. In this paper, a new vehicle routing model (based on the known Time-Dependent Vehicle Routing Problem with Time Windows, TDVRPTW) has been carried out and a change in the traditional approach is proposed, by adopting a system in which some customers are served by urban DCs while remaining customers are served by traditional routes. This study is also motivated by recent developments in real time traffic data acquisition systems, as well as national and international policies aimed at reducing concentrations of greenhouse gases emitted by traditional vans. By using k DCs, the whole problem is now composed of k+1 problems: one special VRPTW for each DC in addition to the main problem, in which some customers and k DC are serviced. The model has been tested by simulating one real case of pharmaceutical distribution within the city of Zaragoza.

[1]  Hui-Chieh Li,et al.  Vehicle routing problem with time-windows for perishable food delivery , 2007 .

[2]  Hideki Hashimoto,et al.  An iterated local search algorithm for the time-dependent vehicle routing problem with time windows , 2008, Discret. Optim..

[3]  Eiichi Taniguchi,et al.  Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows , 2006 .

[4]  Pierluigi Coppola,et al.  Intra-Period (Within-Day) Dynamic Models for Continuous Services , 2003 .

[5]  Roberto Cordone,et al.  A Heuristic for the Vehicle Routing Problem with Time Windows , 2001, J. Heuristics.

[6]  M. O’Mahony,et al.  Urban Freight in Dublin City Center, Ireland , 2005 .

[7]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[8]  Daniel Serra,et al.  Incorporating Waiting Time in Competitive Location Models , 2007 .

[9]  Gilbert Laporte,et al.  Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .

[10]  Fred W. Glover,et al.  Búsqueda Tabú , 2003, Inteligencia Artif..

[11]  Roberto Montemanni,et al.  Time dependent vehicle routing problem with a multi ant colony system , 2008, Eur. J. Oper. Res..

[12]  Urban Freight in Dublin City Centre: Survey Analysis and Strategy Evaluation , 2004 .

[13]  Víctor Yepes Piqueras.  Optimización heurística económica aplicada a las redes de transporte del tipo VRPTW. , 2011 .

[14]  Gilbert Laporte,et al.  Waiting strategies for the dynamic pickup and delivery problem with time windows , 2004 .

[15]  Mei-Shiang Chang,et al.  The real-time time-dependent vehicle routing problem , 2006 .

[16]  Wout Dullaert,et al.  A Fast Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows , 2003, Int. J. Artif. Intell. Tools.

[17]  Fred W. Glover,et al.  Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..

[18]  Daniel L. K. Yamins,et al.  Growing Urban Roads , 2003 .

[19]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[20]  Olli Bräysy,et al.  A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows , 2003, INFORMS J. Comput..

[21]  Hugh Finlay,et al.  Urban Freight in Dublin City Center, Ireland: Survey Analysis and Strategy Evaluation , 2005 .

[22]  Terry L. Friesz,et al.  Dynamic pricing in an urban freight environment , 2008 .