Loading…

Improved Harris Hawks Optimizer algorithm to solve the multi-depot open vehicle routing problem

The Multi-Depot Open Vehicle Routing Problem (MDOVRP) is only one example of several optimization problems that are classified as NP-hard. Therefore, heuristic and metaheuristic approaches are helpful in obtaining a near-optimal solution. A hybrid HHO algorithm called HHO-PSO is proposed in this wor...

Full description

Saved in:
Bibliographic Details
Published in:Evolutionary intelligence 2024, Vol.17 (4), p.2495-2513
Main Authors: Peng, Zhihao, Pirozmand, Poria, Xiong, Yaohua
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c319t-d840dba4c0e632a440b2dc9993f8f2128b1294e4a8c764212e0e2f3511985add3
cites cdi_FETCH-LOGICAL-c319t-d840dba4c0e632a440b2dc9993f8f2128b1294e4a8c764212e0e2f3511985add3
container_end_page 2513
container_issue 4
container_start_page 2495
container_title Evolutionary intelligence
container_volume 17
creator Peng, Zhihao
Pirozmand, Poria
Xiong, Yaohua
description The Multi-Depot Open Vehicle Routing Problem (MDOVRP) is only one example of several optimization problems that are classified as NP-hard. Therefore, heuristic and metaheuristic approaches are helpful in obtaining a near-optimal solution. A hybrid HHO algorithm called HHO-PSO is proposed in this work to address the MDOVRP. The goal is to minimize costs for the routes of a fleet of vehicles that start moving from depots and fulfill customers’ demands. To improve the exploration of the Harris Hawks Optimization (HHO) algorithm, the exploration method of Particle Swarm Optimization (PSO) which is more robust, is used in this paper. Experimental results proved that the proposed hybrid algorithm works better than the original PSO and HHO in discrete space in terms of balance, exploitation, and exploration to solve the MDOVRP. Moreover, the suggested algorithm is compared to five cutting-edge approaches on 24 MDOVRP instances with a broad number of customers. The computational findings reveal that the suggested approach outperformed the other comparable metaheuristic techniques in solving the MDOVRP.
doi_str_mv 10.1007/s12065-023-00898-0
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3079871271</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3079871271</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-d840dba4c0e632a440b2dc9993f8f2128b1294e4a8c764212e0e2f3511985add3</originalsourceid><addsrcrecordid>eNp9kMtKxDAUhosoOI6-gKuA6-rJpW2ylEGdgQE3ug5pezrTsW1qkhnRpzda0Z2r_3D4L_AlySWFawpQ3HjKIM9SYDwFkEqmcJTMqMxFmilaHP_eoE6TM-93ADmDQswSvepHZw9Yk6VxrvVR3l48eRxD27cf6IjpNta1YduTYIm33QFJ2CLp911o0xpHG4gdcSAH3LZVh8TZfWiHDYmtZYf9eXLSmM7jxY_Ok-f7u6fFMl0_PqwWt-u04lSFtJYC6tKICjDnzAgBJasrpRRvZMMokyVlSqAwsipyER8IyBqeUapkZuqaz5OrqTfuvu7RB72zezfESc2hULKgrKDRxSZX5az3Dhs9urY37l1T0F8g9QRSR5D6G6SGGOJTyEfzsEH3V_1P6hOIh3ap</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3079871271</pqid></control><display><type>article</type><title>Improved Harris Hawks Optimizer algorithm to solve the multi-depot open vehicle routing problem</title><source>Springer Nature:Jisc Collections:Springer Nature Read and Publish 2023-2025: Springer Reading List</source><creator>Peng, Zhihao ; Pirozmand, Poria ; Xiong, Yaohua</creator><creatorcontrib>Peng, Zhihao ; Pirozmand, Poria ; Xiong, Yaohua</creatorcontrib><description>The Multi-Depot Open Vehicle Routing Problem (MDOVRP) is only one example of several optimization problems that are classified as NP-hard. Therefore, heuristic and metaheuristic approaches are helpful in obtaining a near-optimal solution. A hybrid HHO algorithm called HHO-PSO is proposed in this work to address the MDOVRP. The goal is to minimize costs for the routes of a fleet of vehicles that start moving from depots and fulfill customers’ demands. To improve the exploration of the Harris Hawks Optimization (HHO) algorithm, the exploration method of Particle Swarm Optimization (PSO) which is more robust, is used in this paper. Experimental results proved that the proposed hybrid algorithm works better than the original PSO and HHO in discrete space in terms of balance, exploitation, and exploration to solve the MDOVRP. Moreover, the suggested algorithm is compared to five cutting-edge approaches on 24 MDOVRP instances with a broad number of customers. The computational findings reveal that the suggested approach outperformed the other comparable metaheuristic techniques in solving the MDOVRP.</description><identifier>ISSN: 1864-5909</identifier><identifier>EISSN: 1864-5917</identifier><identifier>DOI: 10.1007/s12065-023-00898-0</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithms ; Applications of Mathematics ; Artificial Intelligence ; Bioinformatics ; Control ; Customers ; Engineering ; Heuristic methods ; Mathematical and Computational Engineering ; Mechatronics ; Optimization ; Particle swarm optimization ; Research Paper ; Robotics ; Statistical Physics and Dynamical Systems ; Vehicle routing</subject><ispartof>Evolutionary intelligence, 2024, Vol.17 (4), p.2495-2513</ispartof><rights>The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-d840dba4c0e632a440b2dc9993f8f2128b1294e4a8c764212e0e2f3511985add3</citedby><cites>FETCH-LOGICAL-c319t-d840dba4c0e632a440b2dc9993f8f2128b1294e4a8c764212e0e2f3511985add3</cites><orcidid>0000-0002-8340-7003</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Peng, Zhihao</creatorcontrib><creatorcontrib>Pirozmand, Poria</creatorcontrib><creatorcontrib>Xiong, Yaohua</creatorcontrib><title>Improved Harris Hawks Optimizer algorithm to solve the multi-depot open vehicle routing problem</title><title>Evolutionary intelligence</title><addtitle>Evol. Intel</addtitle><description>The Multi-Depot Open Vehicle Routing Problem (MDOVRP) is only one example of several optimization problems that are classified as NP-hard. Therefore, heuristic and metaheuristic approaches are helpful in obtaining a near-optimal solution. A hybrid HHO algorithm called HHO-PSO is proposed in this work to address the MDOVRP. The goal is to minimize costs for the routes of a fleet of vehicles that start moving from depots and fulfill customers’ demands. To improve the exploration of the Harris Hawks Optimization (HHO) algorithm, the exploration method of Particle Swarm Optimization (PSO) which is more robust, is used in this paper. Experimental results proved that the proposed hybrid algorithm works better than the original PSO and HHO in discrete space in terms of balance, exploitation, and exploration to solve the MDOVRP. Moreover, the suggested algorithm is compared to five cutting-edge approaches on 24 MDOVRP instances with a broad number of customers. The computational findings reveal that the suggested approach outperformed the other comparable metaheuristic techniques in solving the MDOVRP.</description><subject>Algorithms</subject><subject>Applications of Mathematics</subject><subject>Artificial Intelligence</subject><subject>Bioinformatics</subject><subject>Control</subject><subject>Customers</subject><subject>Engineering</subject><subject>Heuristic methods</subject><subject>Mathematical and Computational Engineering</subject><subject>Mechatronics</subject><subject>Optimization</subject><subject>Particle swarm optimization</subject><subject>Research Paper</subject><subject>Robotics</subject><subject>Statistical Physics and Dynamical Systems</subject><subject>Vehicle routing</subject><issn>1864-5909</issn><issn>1864-5917</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9kMtKxDAUhosoOI6-gKuA6-rJpW2ylEGdgQE3ug5pezrTsW1qkhnRpzda0Z2r_3D4L_AlySWFawpQ3HjKIM9SYDwFkEqmcJTMqMxFmilaHP_eoE6TM-93ADmDQswSvepHZw9Yk6VxrvVR3l48eRxD27cf6IjpNta1YduTYIm33QFJ2CLp911o0xpHG4gdcSAH3LZVh8TZfWiHDYmtZYf9eXLSmM7jxY_Ok-f7u6fFMl0_PqwWt-u04lSFtJYC6tKICjDnzAgBJasrpRRvZMMokyVlSqAwsipyER8IyBqeUapkZuqaz5OrqTfuvu7RB72zezfESc2hULKgrKDRxSZX5az3Dhs9urY37l1T0F8g9QRSR5D6G6SGGOJTyEfzsEH3V_1P6hOIh3ap</recordid><startdate>2024</startdate><enddate>2024</enddate><creator>Peng, Zhihao</creator><creator>Pirozmand, Poria</creator><creator>Xiong, Yaohua</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-8340-7003</orcidid></search><sort><creationdate>2024</creationdate><title>Improved Harris Hawks Optimizer algorithm to solve the multi-depot open vehicle routing problem</title><author>Peng, Zhihao ; Pirozmand, Poria ; Xiong, Yaohua</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-d840dba4c0e632a440b2dc9993f8f2128b1294e4a8c764212e0e2f3511985add3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Applications of Mathematics</topic><topic>Artificial Intelligence</topic><topic>Bioinformatics</topic><topic>Control</topic><topic>Customers</topic><topic>Engineering</topic><topic>Heuristic methods</topic><topic>Mathematical and Computational Engineering</topic><topic>Mechatronics</topic><topic>Optimization</topic><topic>Particle swarm optimization</topic><topic>Research Paper</topic><topic>Robotics</topic><topic>Statistical Physics and Dynamical Systems</topic><topic>Vehicle routing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Peng, Zhihao</creatorcontrib><creatorcontrib>Pirozmand, Poria</creatorcontrib><creatorcontrib>Xiong, Yaohua</creatorcontrib><collection>CrossRef</collection><jtitle>Evolutionary intelligence</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Peng, Zhihao</au><au>Pirozmand, Poria</au><au>Xiong, Yaohua</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Improved Harris Hawks Optimizer algorithm to solve the multi-depot open vehicle routing problem</atitle><jtitle>Evolutionary intelligence</jtitle><stitle>Evol. Intel</stitle><date>2024</date><risdate>2024</risdate><volume>17</volume><issue>4</issue><spage>2495</spage><epage>2513</epage><pages>2495-2513</pages><issn>1864-5909</issn><eissn>1864-5917</eissn><abstract>The Multi-Depot Open Vehicle Routing Problem (MDOVRP) is only one example of several optimization problems that are classified as NP-hard. Therefore, heuristic and metaheuristic approaches are helpful in obtaining a near-optimal solution. A hybrid HHO algorithm called HHO-PSO is proposed in this work to address the MDOVRP. The goal is to minimize costs for the routes of a fleet of vehicles that start moving from depots and fulfill customers’ demands. To improve the exploration of the Harris Hawks Optimization (HHO) algorithm, the exploration method of Particle Swarm Optimization (PSO) which is more robust, is used in this paper. Experimental results proved that the proposed hybrid algorithm works better than the original PSO and HHO in discrete space in terms of balance, exploitation, and exploration to solve the MDOVRP. Moreover, the suggested algorithm is compared to five cutting-edge approaches on 24 MDOVRP instances with a broad number of customers. The computational findings reveal that the suggested approach outperformed the other comparable metaheuristic techniques in solving the MDOVRP.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s12065-023-00898-0</doi><tpages>19</tpages><orcidid>https://orcid.org/0000-0002-8340-7003</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 1864-5909
ispartof Evolutionary intelligence, 2024, Vol.17 (4), p.2495-2513
issn 1864-5909
1864-5917
language eng
recordid cdi_proquest_journals_3079871271
source Springer Nature:Jisc Collections:Springer Nature Read and Publish 2023-2025: Springer Reading List
subjects Algorithms
Applications of Mathematics
Artificial Intelligence
Bioinformatics
Control
Customers
Engineering
Heuristic methods
Mathematical and Computational Engineering
Mechatronics
Optimization
Particle swarm optimization
Research Paper
Robotics
Statistical Physics and Dynamical Systems
Vehicle routing
title Improved Harris Hawks Optimizer algorithm to solve the multi-depot open vehicle routing problem
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T22%3A12%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Improved%20Harris%20Hawks%20Optimizer%20algorithm%20to%20solve%20the%20multi-depot%20open%20vehicle%20routing%20problem&rft.jtitle=Evolutionary%20intelligence&rft.au=Peng,%20Zhihao&rft.date=2024&rft.volume=17&rft.issue=4&rft.spage=2495&rft.epage=2513&rft.pages=2495-2513&rft.issn=1864-5909&rft.eissn=1864-5917&rft_id=info:doi/10.1007/s12065-023-00898-0&rft_dat=%3Cproquest_cross%3E3079871271%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c319t-d840dba4c0e632a440b2dc9993f8f2128b1294e4a8c764212e0e2f3511985add3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=3079871271&rft_id=info:pmid/&rfr_iscdi=true