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

Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil

Author

Listed:
  • Belfiore, PatrI´cia
  • Yoshida Yoshizaki, Hugo Tsugunobu

Abstract

In this paper, we consider a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries that occurs in a major Brazilian retail group. A single depot attends 519 stores of the group distributed in 11 Brazilian states. To find good solutions to this problem, we propose heuristics as initial solutions and a scatter search (SS) approach. Next, the produced solutions are compared with the routes actually covered by the company. Our results show that the total distribution cost can be reduced significantly when such methods are used. Experimental testing with benchmark instances is used to assess the merit of our proposed procedure.

Suggested Citation

  • Belfiore, PatrI´cia & Yoshida Yoshizaki, Hugo Tsugunobu, 2009. "Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil," European Journal of Operational Research, Elsevier, vol. 199(3), pages 750-758, December.
    • Handle: RePEc:eee:ejores:v:199:y:2009:i:3:p:750-758
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00697-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. F-H Liu & S-Y Shen, 1999. "The fleet size and mix vehicle routing problem with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(7), pages 721-732, July.
    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. J. M. Belenguer & M. C. Martinez & E. Mota, 2000. "A Lower Bound for the Split Delivery Vehicle Routing Problem," Operations Research, INFORMS, vol. 48(5), pages 801-810, October.
    4. Yamashita, Denise Sato & Armentano, Vinicius Amaral & Laguna, Manuel, 2006. "Scatter search for project scheduling with resource availability cost," European Journal of Operational Research, Elsevier, vol. 169(2), pages 623-637, March.
    5. W Dullaert & G K Janssens & K Sörensen & B Vernimmen, 2002. "New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(11), pages 1232-1238, November.
    6. Alegre, Jesus & Laguna, Manuel & Pacheco, Joaquin, 2007. "Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts," European Journal of Operational Research, Elsevier, vol. 179(3), pages 736-746, June.
    7. A Corberán & E Fernández & M Laguna & R Martí, 2002. "Heuristic solutions to the problem of routing school buses with multiple objectives," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(4), pages 427-435, April.
    8. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    9. 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.
    10. A. W. J. Kolen & A. H. G. Rinnooy Kan & H. W. J. M. Trienekens, 1987. "Vehicle Routing with Time Windows," Operations Research, INFORMS, vol. 35(2), pages 266-273, April.
    11. C. Archetti & M. G. Speranza & A. Hertz, 2006. "A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem," Transportation Science, INFORMS, vol. 40(1), pages 64-73, February.
    12. Moshe Dror & Pierre Trudeau, 1989. "Savings by Split Delivery Routing," Transportation Science, INFORMS, vol. 23(2), pages 141-145, May.
    13. Salhi, Said & Rand, Graham K., 1993. "Incorporating vehicle routing into the vehicle fleet composition problem," European Journal of Operational Research, Elsevier, vol. 66(3), pages 313-330, May.
    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. 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.
    2. Manuel Sanchez & Lorena Pradenas & Jean-Christophe Deschamps & Victor Parada, 2016. "Reducing the carbon footprint in a vehicle routing problem by pooling resources from different companies," Netnomics, Springer, vol. 17(1), pages 29-45, July.
    3. Liu, Yu-Hsin, 2011. "Incorporating scatter search and threshold accepting in finding maximum likelihood estimates for the multinomial probit model," European Journal of Operational Research, Elsevier, vol. 211(1), pages 130-138, May.
    4. 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.
    5. Mangesh Gharote & Rahul Patil & Sachin Lodha, 2017. "Scatter search for trainees to software project requirements stable allocation," Journal of Heuristics, Springer, vol. 23(4), pages 257-283, August.
    6. Alcaraz, Juan J. & Caballero-Arnaldos, Luis & Vales-Alonso, Javier, 2019. "Rich vehicle routing problem with last-mile outsourcing decisions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 263-286.
    7. Jianli Shi & Jin Zhang & Kun Wang & Xin Fang, 2018. "Particle Swarm Optimization for Split Delivery Vehicle Routing Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(02), pages 1-42, April.
    8. 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.
    9. João L. V. Manguino & Débora P. Ronconi, 2022. "Step cost functions in a fleet size and mix vehicle routing problem with time windows," Annals of Operations Research, Springer, vol. 316(2), pages 1013-1038, September.
    10. 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).
    11. Salani, Matteo & Vacca, Ilaria, 2011. "Branch and price for the vehicle routing problem with discrete split deliveries and time windows," European Journal of Operational Research, Elsevier, vol. 213(3), pages 470-477, September.
    12. Park, Junhyuk & Tae, Hyunchul & Kim, Byung-In, 2012. "A post-improvement procedure for the mixed load school bus routing problem," European Journal of Operational Research, Elsevier, vol. 217(1), pages 204-213.
    13. Daqing Wu & Chenxiang Wu, 2022. "Research on the Time-Dependent Split Delivery Green Vehicle Routing Problem for Fresh Agricultural Products with Multiple Time Windows," Agriculture, MDPI, vol. 12(6), pages 1-28, May.
    14. Yangkun Xia & Zhuo Fu & Lijun Pan & Fenghua Duan, 2018. "Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order," PLOS ONE, Public Library of Science, vol. 13(5), pages 1-19, May.
    15. 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.
    16. Chen Chao & Tian Zhihui & Yao Baozhen, 2019. "Optimization of two-stage location–routing–inventory problem with time-windows in food distribution network," Annals of Operations Research, Springer, vol. 273(1), pages 111-134, February.
    17. Xiaxia Ma & Wenliang Bian & Wenchao Wei & Fei Wei, 2022. "Customer-Centric, Two-Product Split Delivery Vehicle Routing Problem under Consideration of Weighted Customer Waiting Time in Power Industry," Energies, MDPI, vol. 15(10), pages 1-23, May.

    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. Patrícia Belfiore & Luiz Fávero, 2007. "Scatter search for the fleet size and mix vehicle routing problem with time windows," 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. 15(4), pages 351-368, November.
    2. 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.
    3. 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.
    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. Jeffrey W. Ohlmann & Michael J. Fry & Barrett W. Thomas, 2008. "Route Design for Lean Production Systems," Transportation Science, INFORMS, vol. 42(3), pages 352-370, August.
    6. 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.
    7. Nicola Bianchessi & Stefan Irnich, 2016. "Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows," Working Papers 1620, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    8. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    9. Mauro Dell'Amico & Michele Monaci & Corrado Pagani & Daniele Vigo, 2007. "Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 41(4), pages 516-526, November.
    10. Kritikos, Manolis N. & Ioannou, George, 2013. "The heterogeneous fleet vehicle routing problem with overloads and time windows," International Journal of Production Economics, Elsevier, vol. 144(1), pages 68-75.
    11. Jianli Shi & Jin Zhang & Kun Wang & Xin Fang, 2018. "Particle Swarm Optimization for Split Delivery Vehicle Routing Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(02), pages 1-42, April.
    12. Guy Desaulniers, 2010. "Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 58(1), pages 179-192, February.
    13. Olli Bräysy & Wout Dullaert & Geir Hasle & David Mester & Michel Gendreau, 2008. "An Effective Multirestart Deterministic Annealing Metaheuristic for the Fleet Size and Mix Vehicle-Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 42(3), pages 371-386, August.
    14. C. Archetti & M. Bouchard & G. Desaulniers, 2011. "Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows," Transportation Science, INFORMS, vol. 45(3), pages 285-298, August.
    15. Lin, Yen-Hung & Batta, Rajan & Rogerson, Peter A. & Blatt, Alan & Flanigan, Marie, 2011. "A logistics model for emergency supply of critical items in the aftermath of a disaster," Socio-Economic Planning Sciences, Elsevier, vol. 45(4), pages 132-145, December.
    16. 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.
    17. Vicky Mak & Andreas Ernst, 2007. "New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(1), pages 69-98, August.
    18. Leonardo Berbotto & Sergio García & Francisco Nogales, 2014. "A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem," Annals of Operations Research, Springer, vol. 222(1), pages 153-173, November.
    19. Bortfeldt, Andreas & Yi, Junmin, 2020. "The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 282(2), pages 545-558.
    20. 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.

    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:199:y:2009:i:3:p:750-758. 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.