Adaptive Ant Colony Optimization Algorithm Based on Real-Time Logistics Features for Instant Delivery
Ant colony optimization (ACO) algorithm is widely used in the instant delivery order scheduling because of its distributed computing capability. However, the order delivery efficiency decreases when different logistics statuses are faced. In order to improve the performance of ACO, an adaptive ACO a...
Saved in:
| Published in | IEEE transactions on cybernetics Vol. 54; no. 11; pp. 6358 - 6370 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
United States
IEEE
01.11.2024
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 2168-2267 2168-2275 2168-2275 |
| DOI | 10.1109/TCYB.2024.3454346 |
Cover
| Abstract | Ant colony optimization (ACO) algorithm is widely used in the instant delivery order scheduling because of its distributed computing capability. However, the order delivery efficiency decreases when different logistics statuses are faced. In order to improve the performance of ACO, an adaptive ACO algorithm based on real-time logistics features (AACO-RTLFs) is proposed. First, features are extracted from the event dimension, spatial dimension, and time dimension of the instant delivery to describe the real-time logistics status. Five key factors are further selected from the above three features to assist in problem modeling and ACO designing. Second, an adaptive instant delivery model is built considering the customer's acceptable delivery time. The acceptable time is calculated by emergency order mark and weather conditions in the event dimension feature. Third, an adaptive ACO algorithm is proposed to obtain the instant delivery order schedules. The parameters of the probability equation in ACO are adjusted according to the extracted key factors. Finally, the Gurobi solver in Python is used to perform numerical experiments on the classical datasets to verify the effectiveness of the instant delivery model. The proposed AACO-RTLF algorithm shows its advantages in instant delivery order scheduling when compared to the other state-of-the-art algorithms. |
|---|---|
| AbstractList | Ant colony optimization (ACO) algorithm is widely used in the instant delivery order scheduling because of its distributed computing capability. However, the order delivery efficiency decreases when different logistics statuses are faced. In order to improve the performance of ACO, an adaptive ACO algorithm based on real-time logistics features (AACO-RTLFs) is proposed. First, features are extracted from the event dimension, spatial dimension, and time dimension of the instant delivery to describe the real-time logistics status. Five key factors are further selected from the above three features to assist in problem modeling and ACO designing. Second, an adaptive instant delivery model is built considering the customer's acceptable delivery time. The acceptable time is calculated by emergency order mark and weather conditions in the event dimension feature. Third, an adaptive ACO algorithm is proposed to obtain the instant delivery order schedules. The parameters of the probability equation in ACO are adjusted according to the extracted key factors. Finally, the Gurobi solver in Python is used to perform numerical experiments on the classical datasets to verify the effectiveness of the instant delivery model. The proposed AACO-RTLF algorithm shows its advantages in instant delivery order scheduling when compared to the other state-of-the-art algorithms. Ant colony optimization (ACO) algorithm is widely used in the instant delivery order scheduling because of its distributed computing capability. However, the order delivery efficiency decreases when different logistics statuses are faced. In order to improve the performance of ACO, an adaptive ACO algorithm based on real-time logistics features (AACO-RTLFs) is proposed. First, features are extracted from the event dimension, spatial dimension, and time dimension of the instant delivery to describe the real-time logistics status. Five key factors are further selected from the above three features to assist in problem modeling and ACO designing. Second, an adaptive instant delivery model is built considering the customer's acceptable delivery time. The acceptable time is calculated by emergency order mark and weather conditions in the event dimension feature. Third, an adaptive ACO algorithm is proposed to obtain the instant delivery order schedules. The parameters of the probability equation in ACO are adjusted according to the extracted key factors. Finally, the Gurobi solver in Python is used to perform numerical experiments on the classical datasets to verify the effectiveness of the instant delivery model. The proposed AACO-RTLF algorithm shows its advantages in instant delivery order scheduling when compared to the other state-of-the-art algorithms.Ant colony optimization (ACO) algorithm is widely used in the instant delivery order scheduling because of its distributed computing capability. However, the order delivery efficiency decreases when different logistics statuses are faced. In order to improve the performance of ACO, an adaptive ACO algorithm based on real-time logistics features (AACO-RTLFs) is proposed. First, features are extracted from the event dimension, spatial dimension, and time dimension of the instant delivery to describe the real-time logistics status. Five key factors are further selected from the above three features to assist in problem modeling and ACO designing. Second, an adaptive instant delivery model is built considering the customer's acceptable delivery time. The acceptable time is calculated by emergency order mark and weather conditions in the event dimension feature. Third, an adaptive ACO algorithm is proposed to obtain the instant delivery order schedules. The parameters of the probability equation in ACO are adjusted according to the extracted key factors. Finally, the Gurobi solver in Python is used to perform numerical experiments on the classical datasets to verify the effectiveness of the instant delivery model. The proposed AACO-RTLF algorithm shows its advantages in instant delivery order scheduling when compared to the other state-of-the-art algorithms. |
| Author | Du, Yongping Guo, Xinyu Han, Honggui Wang, Jingjing Hou, Ying |
| Author_xml | – sequence: 1 givenname: Ying orcidid: 0000-0002-4480-476X surname: Hou fullname: Hou, Ying email: houying17@sina.com organization: School of Information Science and Technology, the Engineering Research Center of Digital Community, Ministry of Education, the Beijing Laboratory for Urban Mass Transit, and the Beijing Key Laboratory of Computational Intelligence and Intelligence System, Beijing University of Technology, Beijing, China – sequence: 2 givenname: Xinyu surname: Guo fullname: Guo, Xinyu email: gxy525738243@emails.bjut.edu.cn organization: School of Information Science and Technology, the Engineering Research Center of Digital Community, Ministry of Education, the Beijing Laboratory for Urban Mass Transit, and the Beijing Key Laboratory of Computational Intelligence and Intelligence System, Beijing University of Technology, Beijing, China – sequence: 3 givenname: Honggui orcidid: 0000-0001-5617-4075 surname: Han fullname: Han, Honggui email: rechardhan@sina.com organization: School of Information Science and Technology, the Engineering Research Center of Digital Community, Ministry of Education, the Beijing Laboratory for Urban Mass Transit, and the Beijing Key Laboratory of Computational Intelligence and Intelligence System, Beijing University of Technology, Beijing, China – sequence: 4 givenname: Jingjing orcidid: 0000-0003-3385-7572 surname: Wang fullname: Wang, Jingjing email: wangjingjing@bjut.edu.cn organization: School of Information Science and Technology, the Engineering Research Center of Digital Community, Ministry of Education, the Beijing Laboratory for Urban Mass Transit, and the Beijing Key Laboratory of Computational Intelligence and Intelligence System, Beijing University of Technology, Beijing, China – sequence: 5 givenname: Yongping surname: Du fullname: Du, Yongping email: ypdu@bjut.edu.cn organization: School of Computing, Beijing University of Technology, Beijing, China |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/39264787$$D View this record in MEDLINE/PubMed |
| BookMark | eNpNkUtLAzEUhYMo1kd_gCCSpZupec1Msqz1VSgUpC5cDWl6p0ZmJjVJhfrrTWkt3s29HL5zFveco-POdYDQFSUDSom6m43e7weMMDHgIhdcFEfojNFCZoyV-fHhLsoe6ofwSdLIJCl5inpcsUKUsjxDMFzoVbTfgIddxCPXuG6Dp0lp7Y-O1nV42Cydt_Gjxfc6wAIn6RV0k81sC3jiljZEawJ-Ah3XHgKuncfjLkSd8h6gSdF-c4lOat0E6O_3BXp7epyNXrLJ9Hk8Gk4yw0oRM17ntDZKA9RScDI3hOg614rkxtRMzw0YRuZ5waQRoClhmim5YEpJRoUA4Bfodpe78u5rDSFWrQ0GmkZ34Nah4pQIwhUt84Te7NH1vIVFtfK21X5T_b0mAXQHGO9C8FAfEEqqbQPVtoFq20C1byB5rnceCwD_-KJUVCr-C7A4gdw |
| CODEN | ITCEB8 |
| Cites_doi | 10.1016/j.swevo.2023.101233 10.1007/s11431-021-1983-2 10.1109/TEVC.2021.3098523 10.1109/TEVC.2022.3144142 10.1109/tetci.2018.2812897 10.1016/j.elerap.2021.101115 10.1109/TCYB.2021.3069942 10.1016/j.asoc.2020.106561 10.1016/j.swevo.2023.101236 10.1016/j.eswa.2023.119789 10.1504/IJCAT.2022.129382 10.1109/TCYB.2020.3041494 10.1016/j.cie.2021.107728 10.1109/TITS.2022.3163263 10.1016/j.cie.2019.03.047 10.1109/TCYB.2018.2832640 10.1007/s10878-023-01016-7 10.1109/TASE.2013.2291899 10.1155/2022/5099008 10.1016/j.cie.2020.107029 10.1109/CC.2014.6880471 10.1109/TSMC.2017.2788879 10.3390/en15197224 10.1007/s11432-022-3735-5 10.1109/TAES.2023.3312626 10.1109/tevc.2023.3237336 10.1109/TCYB.2019.2939219 10.1109/TII.2022.3189427 10.1016/j.neucom.2017.08.059 10.4018/ijsir.303573 10.1109/TII.2018.2836189 10.1109/TCYB.2022.3189684 10.1016/j.asoc.2022.109225 10.1007/s11431-020-1789-9 10.1109/TII.2017.2664080 10.1016/j.trc.2020.102861 10.1016/j.asoc.2023.110551 |
| ContentType | Journal Article |
| DBID | 97E RIA RIE AAYXX CITATION NPM 7X8 |
| DOI | 10.1109/TCYB.2024.3454346 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Xplore (NTUSG) CrossRef PubMed MEDLINE - Academic |
| DatabaseTitle | CrossRef PubMed MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic PubMed |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Sciences (General) |
| EISSN | 2168-2275 |
| EndPage | 6370 |
| ExternalDocumentID | 39264787 10_1109_TCYB_2024_3454346 10679189 |
| Genre | orig-research Journal Article |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China; National Science Foundation of China grantid: 62373011; 62021003; 62125301 funderid: 10.13039/501100001809 – fundername: Beijing Natural Science Foundation grantid: KZ202110005009 – fundername: Research and Development Program of Beijing Municipal Education Commission grantid: KM202210005027 – fundername: National Key Research and Development Project grantid: 2023YFC3904605; 2023YFB3308004; 2022YFB3305800-5 funderid: 10.13039/501100012166 – fundername: Youth Beijing Scholar grantid: 037 |
| GroupedDBID | 0R~ 4.4 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACIWK AENEX AGQYO AGSQL AHBIQ AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD HZ~ IFIPE IPLJI JAVBF M43 O9- OCL PQQKQ RIA RIE RNS AAYXX CITATION NPM 7X8 |
| ID | FETCH-LOGICAL-c274t-3f51fc9aeef8430bc00af5a905ccf2abcec20b5628c4ea102a298d29982144ee3 |
| IEDL.DBID | RIE |
| ISSN | 2168-2267 2168-2275 |
| IngestDate | Thu Oct 02 09:53:37 EDT 2025 Mon Jul 21 06:03:33 EDT 2025 Wed Oct 01 01:36:48 EDT 2025 Wed Aug 27 03:03:27 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 11 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c274t-3f51fc9aeef8430bc00af5a905ccf2abcec20b5628c4ea102a298d29982144ee3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0001-5617-4075 0000-0003-3385-7572 0000-0002-4480-476X |
| PMID | 39264787 |
| PQID | 3104039175 |
| PQPubID | 23479 |
| PageCount | 13 |
| ParticipantIDs | ieee_primary_10679189 crossref_primary_10_1109_TCYB_2024_3454346 proquest_miscellaneous_3104039175 pubmed_primary_39264787 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2024-11-01 |
| PublicationDateYYYYMMDD | 2024-11-01 |
| PublicationDate_xml | – month: 11 year: 2024 text: 2024-11-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States |
| PublicationTitle | IEEE transactions on cybernetics |
| PublicationTitleAbbrev | TCYB |
| PublicationTitleAlternate | IEEE Trans Cybern |
| PublicationYear | 2024 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref13 ref35 ref12 ref34 ref15 ref37 ref14 ref36 ref31 ref30 ref11 ref33 ref10 ref32 ref2 ref1 ref17 ref16 ref19 ref18 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref28 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 |
| References_xml | – ident: ref2 doi: 10.1016/j.swevo.2023.101233 – ident: ref12 doi: 10.1007/s11431-021-1983-2 – ident: ref18 doi: 10.1109/TEVC.2021.3098523 – ident: ref20 doi: 10.1109/TEVC.2022.3144142 – ident: ref16 doi: 10.1109/tetci.2018.2812897 – ident: ref23 doi: 10.1016/j.elerap.2021.101115 – ident: ref37 doi: 10.1109/TCYB.2021.3069942 – ident: ref9 doi: 10.1016/j.asoc.2020.106561 – ident: ref4 doi: 10.1016/j.swevo.2023.101236 – ident: ref31 doi: 10.1016/j.eswa.2023.119789 – ident: ref34 doi: 10.1504/IJCAT.2022.129382 – ident: ref6 doi: 10.1109/TCYB.2020.3041494 – ident: ref21 doi: 10.1016/j.cie.2021.107728 – ident: ref10 doi: 10.1109/TITS.2022.3163263 – ident: ref22 doi: 10.1016/j.cie.2019.03.047 – ident: ref26 doi: 10.1109/TCYB.2018.2832640 – ident: ref30 doi: 10.1007/s10878-023-01016-7 – ident: ref14 doi: 10.1109/TASE.2013.2291899 – ident: ref24 doi: 10.1155/2022/5099008 – ident: ref1 doi: 10.1016/j.cie.2020.107029 – ident: ref25 doi: 10.1109/CC.2014.6880471 – ident: ref29 doi: 10.1109/TSMC.2017.2788879 – ident: ref36 doi: 10.3390/en15197224 – ident: ref7 doi: 10.1007/s11432-022-3735-5 – ident: ref33 doi: 10.1109/TAES.2023.3312626 – ident: ref11 doi: 10.1109/tevc.2023.3237336 – ident: ref17 doi: 10.1109/TCYB.2019.2939219 – ident: ref28 doi: 10.1109/TII.2022.3189427 – ident: ref19 doi: 10.1016/j.neucom.2017.08.059 – ident: ref35 doi: 10.4018/ijsir.303573 – ident: ref15 doi: 10.1109/TII.2018.2836189 – ident: ref5 doi: 10.1109/TCYB.2022.3189684 – ident: ref3 doi: 10.1016/j.asoc.2022.109225 – ident: ref8 doi: 10.1007/s11431-020-1789-9 – ident: ref13 doi: 10.1109/TII.2017.2664080 – ident: ref32 doi: 10.1016/j.trc.2020.102861 – ident: ref27 doi: 10.1016/j.asoc.2023.110551 |
| SSID | ssj0000816898 |
| Score | 2.404182 |
| Snippet | Ant colony optimization (ACO) algorithm is widely used in the instant delivery order scheduling because of its distributed computing capability. However, the... |
| SourceID | proquest pubmed crossref ieee |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 6358 |
| SubjectTerms | Adaptation models Ant colony optimization Ant colony optimization (ACO) algorithm Feature extraction Heuristic algorithms Information entropy instant delivery Logistics logistics status real-time logistics feature Real-time systems Vehicle dynamics |
| Title | Adaptive Ant Colony Optimization Algorithm Based on Real-Time Logistics Features for Instant Delivery |
| URI | https://ieeexplore.ieee.org/document/10679189 https://www.ncbi.nlm.nih.gov/pubmed/39264787 https://www.proquest.com/docview/3104039175 |
| Volume | 54 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 2168-2275 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000816898 issn: 2168-2267 databaseCode: RIE dateStart: 20130101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3fb9MwED6xPfEC2yjQjU1G4gGQ0qbOD8ePXbeqIFQk1ErjKXKcy5jYkmlNHra_njsnqWDSJN4sKz99tu872993AB-sjpXkICdIVOiFRSE9LTP0CB3Q-Mgwl9apfS7jxTr8ehFddGR1x4VBRHf4DEdcdHv5eWUbXiobs9yZniR6B3ZUErdkre2Cissg4XLfSip4BCtUt4s58fV4Nft5StGgDEdByGxKTl1E0ICZluofl-RyrDwNN53bmb-EZf_B7WmT36Omzkb24ZGW43__0R686AComLY9Zh-eYXkA-90Q34iPnQ71p1eA09zc8mwopmUtZjRLlvfiO9XcdNxNMb2-rO6u6l834pScYS6o6gcBT495JeKb4xZd2Y1gmNlQWC8IIIsvDo_W4gyv-UjI_QDW8_PVbOF1WRk8SxFs7QVFNCmsNohFEgZ-Zn3fFJHRfmRtIU1m0Uo_I1iV2BAN4RcjdZKT10tYnQ0xeA27ZVXiWxCsjWdUbmNlLAMLAivK5MpkpjCRjfMhfO4Nk9624hupC1p8nbJBUzZo2hl0CANu378ubJt2CO97W6Y0dHg_xJRYNZuUkG3IAvkqGsKb1sjbu_u-cfjEU4_gOb-8ZSW-g936rsFjgid1duK65R_9xN6s |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3fb9MwED6x8QAvwH4wyq8ZaQ8DKV3qOHX82BaqDkqRpk4aT5HjXGBiS6s2eRh_PXdOOgHSpL1ZVhI5Ptv3ne3vO4AjZ_pacpATJVoFqihkYGSGAaEDmh8Z5tJ5tc9Zf3KuPl_EFy1Z3XNhENFfPsMuF_1Zfr5wNW-VnbDcmeklZgsexkqpuKFr3W6p-BwSPvutpEJAwEK355i90JzMR9-HFA9K1Y0U8yk5eRGBA-Za6n-cks-ycjfg9I5n_BRmmyY3901-desq67rf_6k53vufnsGTFoKKQTNmduABlruw007ytThulajf7wEOcrvk9VAMykqMaJ0sb8Q3qrlu2ZticPVjsbqsfl6LIbnDXFDVGUHPgJklYurZRZduLRho1hTYC4LI4tQj0kp8xCu-FHKzD-fjT_PRJGjzMgSOYtgqiIq4VzhjEYtERWHmwtAWsTVh7FwhbebQyTAjYJU4hZYQjJUmycnvJazPhhg9h-1yUeILEKyOZ3Xu-to6hhYEV7TNtc1sYWPXzzvwYWOYdNnIb6Q-bAlNygZN2aBpa9AO7HP__vVg07UdeLexZUqTh09EbImLep0StlUska_jDhw0Rr59ezM2Xt7x1UN4NJl_nabT09mXV_CYG9JwFF_DdrWq8Q2BlSp764foH9AU4fk |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Adaptive+Ant+Colony+Optimization+Algorithm+Based+on+Real-Time+Logistics+Features+for+Instant+Delivery&rft.jtitle=IEEE+transactions+on+cybernetics&rft.au=Hou%2C+Ying&rft.au=Guo%2C+Xinyu&rft.au=Han%2C+Honggui&rft.au=Wang%2C+Jingjing&rft.date=2024-11-01&rft.issn=2168-2275&rft.eissn=2168-2275&rft.volume=54&rft.issue=11&rft.spage=6358&rft_id=info:doi/10.1109%2FTCYB.2024.3454346&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2168-2267&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2168-2267&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2168-2267&client=summon |