IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v221y2012i2p285-295.html
   My bibliography  Save this article

A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem

Author

Listed:
  • Subramanian, Anand
  • Penna, Puca Huachi Vaz
  • Uchoa, Eduardo
  • Ochi, Luiz Satoru

Abstract

This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The HFVRP generalizes the classical Capacitated Vehicle Routing Problem by considering the existence of different vehicle types, with distinct capacities and costs. The objective is to determine the best fleet composition as well as the set of routes that minimize the total costs. The proposed hybrid algorithm is composed by an Iterated Local Search (ILS) based heuristic and a Set Partitioning (SP) formulation. The SP model is solved by means of a Mixed Integer Programming solver that interactively calls the ILS heuristic during its execution. The developed algorithm was tested in benchmark instances with up to 360 customers. The results obtained are quite competitive with those found in the literature and new improved solutions are reported.

Suggested Citation

  • Subramanian, Anand & Penna, Puca Huachi Vaz & Uchoa, Eduardo & Ochi, Luiz Satoru, 2012. "A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 221(2), pages 285-295.
    • Handle: RePEc:eee:ejores:v:221:y:2012:i:2:p:285-295
    DOI: 10.1016/j.ejor.2012.03.016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712002093
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.03.016?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Liu, Shuguang & Huang, Weilai & Ma, Huiming, 2009. "An effective genetic algorithm for the fleet size and mix vehicle routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(3), pages 434-445, May.
    2. Renaud, Jacques & Boctor, Fayez F., 2002. "A sweep-based algorithm for the fleet size and mix vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 140(3), pages 618-628, August.
    3. Li, Xiangyong & Tian, Peng & Aneja, Y.P., 2010. "An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(6), pages 1111-1127, November.
    4. Y H Lee & J I Kim & K H Kang & K H Kim, 2008. "A heuristic for vehicle fleet mix problem using tabu search and set partitioning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 833-841, June.
    5. Tarantilis, C. D. & Kiranoudis, C. T. & Vassiliadis, V. S., 2004. "A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 152(1), pages 148-158, January.
    6. C.D. Tarantilis & C.T. Kiranoudis, 2002. "BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management," Annals of Operations Research, Springer, vol. 115(1), pages 227-241, September.
    7. Imran, Arif & Salhi, Said & Wassan, Niaz A., 2009. "A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 509-518, September.
    8. C D Tarantilis & C T Kiranoudis & V S Vassiliadis, 2003. "A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(1), pages 65-71, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "Thirty years of heterogeneous vehicle routing," European Journal of Operational Research, Elsevier, vol. 249(1), pages 1-21.
    2. Puca Huachi Vaz Penna & Anand Subramanian & Luiz Satoru Ochi & Thibaut Vidal & Christian Prins, 2019. "A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet," Annals of Operations Research, Springer, vol. 273(1), pages 5-74, February.
    3. Salhi, Said & Wassan, Niaz & Hajarat, Mutaz, 2013. "The Fleet Size and Mix Vehicle Routing Problem with Backhauls: Formulation and Set Partitioning-based Heuristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 56(C), pages 22-35.
    4. Liu, Shuguang, 2013. "A hybrid population heuristic for the heterogeneous vehicle routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 67-78.
    5. Houda Derbel & Bassem Jarboui & Rim Bhiri, 2019. "A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem," Annals of Operations Research, Springer, vol. 272(1), pages 243-272, January.
    6. Lai, David S.W. & Caliskan Demirag, Ozgun & Leung, Janny M.Y., 2016. "A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 32-52.
    7. Tarantilis, C.D. & Kiranoudis, C.T., 2007. "A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector," European Journal of Operational Research, Elsevier, vol. 179(3), pages 806-822, June.
    8. Imran, Arif & Salhi, Said & Wassan, Niaz A., 2009. "A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 509-518, September.
    9. C D Tarantilis & E E Zachariadis & C T Kiranoudis, 2008. "A guided tabu search for the heterogeneous vehicle routeing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1659-1673, December.
    10. Tu, Wei & Fang, Zhixiang & Li, Qingquan & Shaw, Shih-Lung & Chen, BiYu, 2014. "A bi-level Voronoi diagram-based metaheuristic for a large-scale multi-depot vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 84-97.
    11. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
    12. Oscar Dominguez & Angel A. Juan & Barry Barrios & Javier Faulin & Alba Agustin, 2016. "Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet," Annals of Operations Research, Springer, vol. 236(2), pages 383-404, January.
    13. C D Tarantilis & G Ioannou & C T Kiranoudis & G P Prastacos, 2005. "Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 588-596, May.
    14. Fan, Qiaochu & van Essen, J. Theresia & Correia, Gonçalo H.A., 2024. "A bi-level framework for heterogeneous fleet sizing of ride-hailing services considering an approximated mixed equilibrium between automated and non-automated traffic," European Journal of Operational Research, Elsevier, vol. 315(3), pages 879-898.
    15. Oscar Dominguez & Angel Juan & Barry Barrios & Javier Faulin & Alba Agustin, 2016. "Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet," Annals of Operations Research, Springer, vol. 236(2), pages 383-404, January.
    16. Mehdi Nourinejad & Matthew J. Roorda, 2017. "A continuous approximation model for the fleet composition problem on the rectangular grid," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 373-401, March.
    17. Mesut Yavuz & Ismail Çapar, 2017. "Alternative-Fuel Vehicle Adoption in Service Fleets: Impact Evaluation Through Optimization Modeling," Transportation Science, INFORMS, vol. 51(2), pages 480-493, May.
    18. Tütüncü, G. YazgI, 2010. "An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls," European Journal of Operational Research, Elsevier, vol. 201(2), pages 593-600, March.
    19. Brandão, José, 2009. "A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 716-728, June.
    20. Lahyani, Rahma & Khemakhem, Mahdi & Semet, Frédéric, 2015. "Rich vehicle routing problems: From a taxonomy to a definition," European Journal of Operational Research, Elsevier, vol. 241(1), pages 1-14.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:221:y:2012:i:2:p:285-295. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.