IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v56y2013icp22-35.html
   My bibliography  Save this article

The Fleet Size and Mix Vehicle Routing Problem with Backhauls: Formulation and Set Partitioning-based Heuristics

Author

Listed:
  • Salhi, Said
  • Wassan, Niaz
  • Hajarat, Mutaz

Abstract

In this paper we present a new variant of the classical Vehicle Routing Problem – the Fleet Size and Mix Vehicle Routing Problem with Backhauls (FSMVRPB). An ILP formulation of the FSMVRPB is presented. Optimal solutions for small size instances are produced and upper and lower bounds are generated for larger ones. In this paper we also propose a Set Partitioning Problem (SPP) based heuristic. Three frameworks are developed and tested on a set of new FSMVRPB data instances which we generated. Computational results are presented which can be used for future benchmarking.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transe:v:56:y:2013:i:c:p:22-35
    DOI: 10.1016/j.tre.2013.05.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554513001142
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2013.05.005?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. N A Wassan & I H Osman, 2002. "Tabu search variants for the mix fleet vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(7), pages 768-782, July.
    3. Aristide Mingozzi & Simone Giorgi & Roberto Baldacci, 1999. "An Exact Method for the Vehicle Routing Problem with Backhauls," Transportation Science, INFORMS, vol. 33(3), pages 315-329, August.
    4. 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.
    5. Beasley, JE, 1983. "Route first--Cluster second methods for vehicle routing," Omega, Elsevier, vol. 11(4), pages 403-408.
    6. 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.
    7. Billy E. Gillett & Leland R. Miller, 1974. "A Heuristic Algorithm for the Vehicle-Dispatch Problem," Operations Research, INFORMS, vol. 22(2), pages 340-349, April.
    8. Salhi, S. & Sari, M., 1997. "A multi-level composite heuristic for the multi-depot vehicle fleet mix problem," European Journal of Operational Research, Elsevier, vol. 103(1), pages 95-112, November.
    9. Paolo Toth & Daniele Vigo, 1997. "An Exact Algorithm for the Vehicle Routing Problem with Backhauls," Transportation Science, INFORMS, vol. 31(4), pages 372-385, November.
    10. Brandao, Jose, 2006. "A new tabu search algorithm for the vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 173(2), pages 540-555, September.
    11. N Wassan, 2007. "Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1630-1641, December.
    12. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    13. 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.
    14. 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.
    15. Niaz A. Wassan & A. Hameed Wassan & Gábor Nagy, 2008. "A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 368-386, May.
    16. S Salhi & G Nagy, 1999. "A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(10), pages 1034-1042, October.
    17. Salhi, S & Sari, M & Saidi, D & Touati, Nac, 1992. "Adaptation of some vehicle fleet mix heuristics," Omega, Elsevier, vol. 20(5-6), pages 653-660.
    18. 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.
    19. Nagy, Gabor & Salhi, Said, 2005. "Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 162(1), pages 126-141, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Neves-Moreira, Fábio & Pereira da Silva, Diogo & Guimarães, Luís & Amorim, Pedro & Almada-Lobo, Bernardo, 2018. "The time window assignment vehicle routing problem with product dependent deliveries," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 163-183.
    2. Marques, Alexandra & Soares, Ricardo & Santos, Maria João & Amorim, Pedro, 2020. "Integrated planning of inbound and outbound logistics with a Rich Vehicle Routing Problem with backhauls," Omega, Elsevier, vol. 92(C).
    3. 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.
    4. Sun, Lijun & Zhang, Yuankai & Hu, Xiangpei, 2021. "Economical-traveling-distance-based fleet composition with fuel costs: An application in petrol distribution," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    5. Wu, Guoyuan & Peng, Dongbo & Boriboonsomsin, Kanok, 2024. "Developing an Efficient Dispatching Strategy to Support Commercial Fleet Electrification," Institute of Transportation Studies, Working Paper Series qt2qz0n2gv, Institute of Transportation Studies, UC Davis.
    6. Pawel Sitek & Jarosław Wikarek, 2019. "Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach," Annals of Operations Research, Springer, vol. 273(1), pages 257-277, February.
    7. Yang, Senyan & Ning, Lianju & Shang, Pan & (Carol) Tong, Lu, 2020. "Augmented Lagrangian relaxation approach for logistics vehicle routing problem with mixed backhauls and time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 135(C).
    8. Maria João Santos & Pedro Amorim & Alexandra Marques & Ana Carvalho & Ana Póvoa, 2020. "The vehicle routing problem with backhauls towards a sustainability perspective: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 358-401, July.
    9. Dinçer Konur & Joseph Geunes, 2019. "Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system," Annals of Operations Research, Springer, vol. 273(1), pages 527-559, February.
    10. José Brandão, 2016. "A deterministic iterated local search algorithm for the vehicle routing problem with backhauls," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 445-465, July.
    11. Adil Baykasoğlu & Nurhan Dudaklı & Kemal Subulan & A. Serdar Taşan, 2022. "An integrated fleet planning model with empty vehicle repositioning for an intermodal transportation system," Operational Research, Springer, vol. 22(3), pages 2063-2098, July.
    12. Ozgur Kabadurmus & Mehmet S. Erdogan, 2023. "A green vehicle routing problem with multi-depot, multi-tour, heterogeneous fleet and split deliveries: a mathematical model and heuristic approach," Journal of Combinatorial Optimization, Springer, vol. 45(3), pages 1-29, April.
    13. C. Y. Lam, 2021. "Optimizing logistics routings in a network perspective of supply and demand nodes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(1), pages 357-377, March.
    14. 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.
    15. Fatih Kocatürk & G. Yazgı Tütüncü & Said Salhi, 2021. "The multi-depot heterogeneous VRP with backhauls: formulation and a hybrid VNS with GRAMPS meta-heuristic approach," Annals of Operations Research, Springer, vol. 307(1), pages 277-302, December.
    16. Du, Jia Yan & Brunner, Jens O. & Kolisch, Rainer, 2014. "Planning towing processes at airports more efficiently," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 293-304.
    17. Yuan, Yuan & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric & Vigo, Daniele, 2021. "A column generation based heuristic for the generalized vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    18. Yuan, Jun & Shi, Xunpeng & He, Junliang, 2024. "LNG market liberalization and LNG transportation: Evaluation based on fleet size and composition model," Applied Energy, Elsevier, vol. 358(C).

    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. 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.
    4. 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.
    5. Maria João Santos & Pedro Amorim & Alexandra Marques & Ana Carvalho & Ana Póvoa, 2020. "The vehicle routing problem with backhauls towards a sustainability perspective: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 358-401, July.
    6. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    7. N Wassan, 2007. "Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1630-1641, December.
    8. 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.
    9. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
    10. 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.
    11. 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.
    12. Niaz A. Wassan & A. Hameed Wassan & Gábor Nagy, 2008. "A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 368-386, May.
    13. Bortfeldt, Andreas & Hahn, Thomas & Männel, Dirk & Mönch, Lars, 2015. "Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints," European Journal of Operational Research, Elsevier, vol. 243(1), pages 82-96.
    14. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "Implicit depot assignments and rotations in vehicle routing heuristics," European Journal of Operational Research, Elsevier, vol. 237(1), pages 15-28.
    15. Imai, Akio & Nishimura, Etsuko & Current, John, 2007. "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, Elsevier, vol. 176(1), pages 87-105, January.
    16. Dominguez, Oscar & Guimarans, Daniel & Juan, Angel A. & de la Nuez, Ignacio, 2016. "A Biased-Randomised Large Neighbourhood Search for the two-dimensional Vehicle Routing Problem with Backhauls," European Journal of Operational Research, Elsevier, vol. 255(2), pages 442-462.
    17. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    18. Henriette Koch & Maximilian Schlögell & Andreas Bortfeldt, 2020. "A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls," Journal of Scheduling, Springer, vol. 23(1), pages 71-93, February.
    19. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2018. "A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1029-1075, October.
    20. Ganesh, K. & Narendran, T.T., 2007. "CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up," European Journal of Operational Research, Elsevier, vol. 178(3), pages 699-717, May.

    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:transe:v:56:y:2013:i:c:p:22-35. 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/wps/find/journaldescription.cws_home/600244/description#description .

    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.