IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i14p10982-d1193199.html

A New Hybrid Algorithm for Vehicle Routing Optimization

Author

Listed:
  • Zhiqiang Liu

    (School of Software, Henan Polytechnic University, Jiaozuo 454003, China
    School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, China)

  • Weidong Wang

    (School of Physics and Electronic Information Engineering, Henan Polytechnic University, Jiaozuo 454000, China)

  • Junyi He

    (School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, China)

  • Jianjun Zhang

    (School of Electrical Engineering and Automation, Henan Polytechnic University, Jiaozuo 454000, China)

  • Jing Wang

    (School of Software, Henan Polytechnic University, Jiaozuo 454003, China)

  • Shasha Li

    (School of Electrical Engineering and Automation, Henan Polytechnic University, Jiaozuo 454000, China)

  • Yining Sun

    (BYD Baolong Factory, No. 1 Baohe Road, Longgang District, Shenzhen 518116, China)

  • Xianyang Ren

    (School of Management Engineering and Business, Hebei University of Engineering, Handan 056038, China)

Abstract

To solve the vehicle routing problem with simultaneous pickup–delivery and time windows (VRPSDPTW), a sine cosine and firefly perturbed sparrow search algorithm (SFSSA) is presented. Based on the standard sparrow search algorithm, the initial population uses tent chaotic mapping to change the population diversity; then, the discoverer location is updated using the sine cosine fluctuation range of the random weight factor, and finally the global population location is updated using the firefly perturbation strategy. In this study, SFSSA was compared with a genetic algorithm (GA), parallel simulated annealing algorithm (p-SA), discrete cuckoo search algorithm (DCS), and novel mimetic algorithm with efficient local search and extended neighborhood (MATE) adopting improved Solomon’s benchmark test cases. The computational results showed that the proposed SFSSA was able to achieve the current optimal solutions for 100% of the nine small-to-medium instances. For large-scale instances, SFSSA obtained the current optimal solutions for 25 out of 56 instances. The experimental findings demonstrated that SFSSA was an effective method for solving the VRPSPDTW problem.

Suggested Citation

  • Zhiqiang Liu & Weidong Wang & Junyi He & Jianjun Zhang & Jing Wang & Shasha Li & Yining Sun & Xianyang Ren, 2023. "A New Hybrid Algorithm for Vehicle Routing Optimization," Sustainability, MDPI, vol. 15(14), pages 1-15, July.
    • Handle: RePEc:gam:jsusta:v:15:y:2023:i:14:p:10982-:d:1193199
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/14/10982/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/15/14/10982/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Santos, Maria João & Jorge, Diana & Ramos, Tânia & Barbosa-Póvoa, Ana, 2023. "Green reverse logistics: Exploring the vehicle routing problem with deliveries and pickups," Omega, Elsevier, vol. 118(C).
    2. Jinghua Li & Hui Guo & Qinghua Zhou & Boxin Yang, 2019. "Vehicle Routing and Scheduling Optimization of Ship Steel Distribution Center under Green Shipbuilding Mode," Sustainability, MDPI, vol. 11(15), pages 1-20, August.
    3. Li, Jiliu & Xu, Min & Sun, Peng, 2022. "Two-echelon capacitated vehicle routing problem with grouping constraints and simultaneous pickup and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 261-291.
    4. 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.
    5. Tawhid, Mohamed A. & Ibrahim, Abdelmonem M., 2022. "Improved salp swarm algorithm combined with chaos," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 202(C), pages 113-148.
    6. Lei Chen & Haiyan Ma & Yi Wang & Feng Li, 2022. "Vehicle Routing Problem for the Simultaneous Pickup and Delivery of Lithium Batteries of Small Power Vehicles under Charging and Swapping Mode," Sustainability, MDPI, vol. 14(16), pages 1-23, August.
    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. Raúl Soto-Concha & John Willmer Escobar & Daniel Morillo-Torres & Rodrigo Linfati, 2025. "The Vehicle-Routing Problem with Satellites Utilization: A Systematic Review of the Literature," Mathematics, MDPI, vol. 13(7), pages 1-29, March.
    2. Nur Indrianti & Raden Achmad Chairdino Leuveano & Salwa Hanim Abdul-Rashid & Muhammad Ihsan Ridho, 2025. "Green Vehicle Routing Problem Optimization for LPG Distribution: Genetic Algorithms for Complex Constraints and Emission Reduction," Sustainability, MDPI, vol. 17(3), pages 1-25, January.
    3. Xu, Song & Ou, Xiangyue & Govindan, Kannan & Chen, Mingzhou & Yang, Wenting, 2025. "An adaptive genetic hyper-heuristic algorithm for a two-echelon vehicle routing problem with dual-customer satisfaction in community group-buying," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).
    4. Qing, Ling & Yin, Yunqiang & Ignatius, Joshua & Wang, Dujuan, 2026. "Robust multi-period blood inventory routing under multiple uncertainties," European Journal of Operational Research, Elsevier, vol. 328(1), pages 137-161.
    5. Débora P. Ronconi & João L. V. Manguino, 2025. "GRASP and VNS approaches for a vehicle routing problem with step cost functions," Annals of Operations Research, Springer, vol. 350(1), pages 37-62, July.
    6. Yi-Kuei Lin & Cheng-Fu Huang & Yi-Chieh Liao, 2019. "Reliability of a stochastic intermodal logistics network under spoilage and time considerations," Annals of Operations Research, Springer, vol. 277(1), pages 95-118, June.
    7. Filippo Focacci & Andrea Lodi & Michela Milano, 2002. "A Hybrid Exact Algorithm for the TSPTW," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 403-417, November.
    8. Zhang, Ying & Qi, Mingyao & Miao, Lixin & Liu, Erchao, 2014. "Hybrid metaheuristic solutions to inventory location routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 305-323.
    9. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    10. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    11. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    12. Yiling Li & Zhiwen Yang & Si Zhang & Wenting Liu, 2024. "A Study of the Capacitated Vehicle Routing Problem with Time-Window and Three-Dimensional Loading Constraints in Land–Sea Transport," Sustainability, MDPI, vol. 16(23), pages 1-26, November.
    13. Bai, Xiaoshan & Li, Baode & Ullah, Inam & Wu, Zongze & Basheer, Shakila & Bashir, Ali Kashif, 2025. "Energy-efficient routing for IoT-enabled multi-truck multi-drone pickup and delivery systems," Applied Energy, Elsevier, vol. 400(C).
    14. Sébastien Mouthuy & Florence Massen & Yves Deville & Pascal Van Hentenryck, 2015. "A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows," Transportation Science, INFORMS, vol. 49(2), pages 223-238, May.
    15. Tingxin Wen & Haoting Meng, 2025. "Time-Dependent Multi-Center Semi-Open Heterogeneous Fleet Path Optimization and Charging Strategy," Mathematics, MDPI, vol. 13(7), pages 1-27, March.
    16. Zheng, Hankun & Sun, Huijun & Dai, Peiling & Wu, Jianjun, 2025. "Distributionally robust alternative service design responding to joint closures in multimodal transit systems," Omega, Elsevier, vol. 137(C).
    17. Long Wang & Jiongzhi Zheng & Zhengda Xiong & Kun He, 2026. "Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem and its Variants," Journal of Heuristics, Springer, vol. 32(1), pages 1-32, March.
    18. Wu, Yuehui & Fang, Hui & Qureshi, Ali Gul & Yamada, Tadashi, 2025. "Capacitated hub location routing problem with time windows and stochastic demands for the design of intra-city express systems," European Journal of Operational Research, Elsevier, vol. 326(2), pages 255-269.
    19. Yuanyuan Li & Claudia Archetti & Ivana Ljubić, 2024. "Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates," Transportation Science, INFORMS, vol. 58(5), pages 1143-1165, September.
    20. Cheng, Chun & Adulyasak, Yossiri & Rousseau, Louis-Martin, 2020. "Drone routing with energy function: Formulation and exact algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 364-387.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:gam:jsusta:v:15:y:2023:i:14:p:10982-:d:1193199. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.