The goal of IJTTE is to broaden the knowledge of traffic and transport experts and academicians by promoting free access and provide valuable insight to transport related information, research and ideas. IJTTE will serve as a great resource for researchers and students across the globe.
Volume List  / Volume 3 (3)

Article

THE VEHICLE ROUTING PROBLEM WITH LIMITED VEHICLE CAPACITIES

DOI: 10.7708/ijtte.2013.3(3).03


3 / 3 / 260-268 Pages

Author(s)

Fernando Taracena Sanz - Instituto Tecnológico de Querétaro, Av. Tecnológico y Mariano Escobedo, Querétaro, Qro. México -

Elías Neftalí Escobar Gómez - Instituto Tecnológico de Tuxtla Gutiérrez, Carretera Panamericana Km. 1080, Tuxtla Gutiérrez, Chiapas, México -


Abstract

The vehicle routing problem (VRP) has been an important research topic during the last decades because of his vital role in the productive systems efficiency. Most of the work done in this area has been directed to solve large scale problems which may not apply for small companies which are a very important engine of the world economy. This paper approaches the problem when limited vehicle resources are present and road transportation is used. This study assumes variable customer orders. Variable volume and weight vehicle capacities are considered and the proposed algorithm develops the vehicle delivery routes and the set of customer orders to deliver per vehicle minimizing a cost objective function. In sampling small company’s logistics costs, big cost savings are found when using the proposed method.


Download Article

Number of downloads: 3206

Keywords:
vehicle routing; mathematical programming; tabu search; cut cost;


Acknowledgements:

We want to thank Mr. Enrique Martinez Sanchez for providing us with the data required to test the model.


References:

Baker, B.M.; Ayechew, M.A. 2003. A Genetic Algorithm for the Vehicle Routing Problem, Computers and Operations Research. DOI: http://dx.doi.org/10.1016/S0305-0548(02)00051-5, 30(5): 787-800.

 

Bell, J.E.; McMullen, P.R. 2004. Ant Colony Optimization Techniques for the Vehicle Routing Problem, Advanced Engineering Informatics. DOI: http://dx.doi.org/10.1016/j.aei.2004.07.001, 18(1): 41-48.

 

Calvete, H.I.; Galé, C.; Oliveros, M.J.; Sanchez-Valverde, B. 2004. Vehicle Routing Problem with Soft Time Windows: An Optimization Based Approach. Monografías del Seminario Matemático García de Galdeano, 31: 295-304.

 

Chang, Y.; Chen, L. 2007. Solve the Vehicle Routing Problem with Time Windows via a Genetic Algorithm, Discrete and Continuous Dynamical Systems Supplement. 240-249.

 

Chuin Lau, H.; Sim, M.; Meng Teo, K. 2003. Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles, European Journal of Operational Research. DOI: http://dx.doi.org/10.1016/S0377-2217(02)00363-6, 148(3): 559-569.

 

Clarke, G.; Wright, W. 1964. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research. DOI: http://dx.doi.org/10.1287/opre.12.4.568, 12(4): 568-581.

 

Dantzig, G.B.; Ramser, J.H. 1959. The Truck Dispatching Problem, Management Science. DOI: http://dx.doi.org/10.1287/mnsc.6.1.80, 6(1): 80-91.

 

Daza, J.M.; Montoya, J.R.; Narducci, F. 2009. Resolución del Problema de Enrutamiento de Vehículos con Limitaciones de Capacidad utilizando un Procedimiento metaheurístico de dos Fases. Revista EIA, ISSN 1794-1237, N°12. 23-38.

 

Gendreau, M.; Hertz, A.; Laporte, G. 1994. A Tabu Search Heuristic for the Vehicle Routing Problem, Management Science. DOI: http://dx.doi.org/10.1287/mnsc.40.10.1276, 40(10): 1276-1290.

 

Gillett, B.; Miller, L. 1974. A heuristic algorithm for the vehicle-dispatch problem, Operations Research. DOI: http://dx.doi.org/10.1287/opre.22.2.340, 22(2): 340-349.

 

Goel, A.; Gruhn, V. 2008. A General Vehicle Routing Problem, European Journal of Operational Research. DOI: http://dx.doi.org/10.1016/j.ejor.2006.12.065, 191(3): 650-660.

 

Laporte, G. 1992. The Vehicle Routing Problem: An overview of exact and approximate algorithms, European Journal of Operational Research. DOI: http://dx.doi.org/10.1016/0377-2217(92)90192-C, 59(3): 345-358.

 

Marinakis, Y.; Marinaki, M. 2010. A hybrid genetic – Particle Swarm Optimization Algorithm for the Vehicle Routing Problem, Expert Systems with Applications. DOI: http://dx.doi.org/10.1016/j.eswa.2009.06.085, 37(2): 1446-1455.

 

Tang Montané, F.A.; Galvao, R.D. 2006. A Tabu Search Algorithm for the Vehicle Routing Problem with Simultaneous Pick-up and Delivery Service, Computers and Operations Research. DOI: http://dx.doi.org/10.1016/j.cor.2004.07.009, 33(3): 595-619.

 

Yeun, L.C.; Ismail, W.R.; Omar, K.; Zirour, M. 2008. Vehicle Routing Problem: Models and Solutions, Journal of Quality Measurement and Analysis, 4(1): 205-218.


Quoted IJTTE Works

There is no quoted studies.



Related Keywords

A SOLUTION FOR THE BI-OBJECTIVE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS USING LOCAL SEARCH AND GENETIC ALGORITHMS

LOCATING FLOW-CAPTURING FACILITIES IN TRANSPORTATION NETWORKS: A FUZZY SETS THEORY APPROACH