Share This Article:

Heterogeneous Fleet Vehicle Routing Problem with Selec-tion of Inter-Depots

Abstract Full-Text HTML Download Download as PDF (Size:367KB) PP. 78-82
DOI: 10.4236/ti.2013.41B013    3,193 Downloads   4,552 Views   Citations


The paper presents heterogeneous fleet vehicle routing problem with selection of inter-depots. The goal of the proposed model is to schedule shipments of goods from the central depot to the inter-depots and finally to the endpoint customers, so that as inter-depots are considered the existing capacities of endpoints customers. In given type of transportation it can be expected to use two types of vehicles: large capacity vehicles ensuring the distribution of goods from the central warehouse and small capacity vehicles ensuring the delivery of goods from inter-depots for late shipment to other cus-tomers. The principle of the model is illustrated on three demonstrative instances.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

Č. Zuzana, P. Juraj, B. Ivan and R. Marian, "Heterogeneous Fleet Vehicle Routing Problem with Selec-tion of Inter-Depots," Technology and Investment, Vol. 4 No. 1B, 2013, pp. 78-82. doi: 10.4236/ti.2013.41B013.


[1] N. R. Achuthan, L. Caccetta and S. P. Hill, “An Im-proved Branch-and-Cut Algorithm for the Capacited Vehicle Routing Problem”, Transportation Science, Vol. No. 37, 2003, pp. 153-169.
[2] Z.Cickova, I. Brezina and J. Pekár, “A memetic algorithm for solving the ve-hicle routing problem”, In Mathematical methods in Economics 2011, 29th international conference, Praha, Professional Publishing, 2011, pp. 125-128.
[3] I. Bre-zina, Z.Cickova and J. Pekár, “Evolutionary approach as an alternative method for solving the vehicle routing problem”, Economic review, Vol. 41, No. 2, 2012, pp. 137-147.
[4] Z.Cickova, I. Brezina and J. Pekár, “Al-ternative method for solving traveling salesman problem by evolutionary algorithm”, Management information systems. No. 1, 2008, pp. 17-22.
[5] I. Brezina, Z.Cickova and J. Pekár, “Application of evolutionary ap-proach to solving vehicle routing problem with time windows”, Economic review, Vol. 38, No. 4, 2009, pp. 529-539.
[6] J. Pekár, I. Brezina, Z. ?i?ková and M. Reiff, “Modelovanie rozmiestňovania recykla?nych centier “, EKONóM, Bratislava, 2012.
[7] Z.Cickova, I. Brezina and J. Pekár, “SOMA for solving the vehicle routing problem with time windows “, In Zbornik radova : SYM-OP-IS 2008, Soko Banja. Beograd, 2008, pp. 305-308.
[8] J. F. Bard, G. Kontoravdis and G. Yu, “A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows”. Transportation Science, Vol. 36, 2002, pp. 250–269.
[9] D. Burchett and E. Campion, “Mix Fleet Vehicle Routing Problem - An Application of Tabu Search in the Grocery Delivery In-dustry”. University of Canterbury, New Zealand, 2002.
[10] S. Irnich, “A Multi-Depot Pickup and Deli-very Problem with a Single Hub and Heterogenous Ve-hicles”. European Journal of Operational Research, Vol. 122, No. 1, 2000, pp. 310-328.
[11] B. L. Golden, A. A. Assad, L. Levy and F. G. Gheysens, “The feet size and mix vehicle routing problem”, Computers & Operations Research, Vol. 11, 1984, pp. 49–66.
[12] A. Subrama-nian, P. H. V. Penna, E. Uchoa and L. S. Ochi, “A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem”, European Journal of Operational Research, Vol. 221, 2012, pp. 285–295.
[13] J. Pekár, I. Brezina and Z.cickova, “Two-stage vehicle routing problem with dynamic selection of entrepots”, In EURO 2012 : 25th European conference on operational research, 8-11 July 2012, Vilnius, Lithuania, 2012, pp. 124-125.

comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.