多车厢车辆路径问题的离散蝙蝠算法

2020 IEEE 6th International Conference on Optimization and Applications (ICOA) Pub Date : 2020-04-01 DOI:10.1109/ICOA49421.2020.9094524

N. Adil, H. Lakhbab

{"title":"多车厢车辆路径问题的离散蝙蝠算法","authors":"N. Adil, H. Lakhbab","doi":"10.1109/ICOA49421.2020.9094524","DOIUrl":null,"url":null,"abstract":"The work presented focuses on the resolution of the multi compartment vehicle routing problem (MCVRP), a variant of the general vehicle routing problem (VRP). An adapted Discrete Bat Algorithm (DBA) is applied and numerical results are compared to results obtained by a Greedy Randomized Adaptive Search Procedure (GRASP). The algorithm proved to be efficient and further studies can be done to enhance its performance.","PeriodicalId":253361,"journal":{"name":"2020 IEEE 6th International Conference on Optimization and Applications (ICOA)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Discrete Bat Algorithm for the Multi-Compartment Vehicle Routing Problem\",\"authors\":\"N. Adil, H. Lakhbab\",\"doi\":\"10.1109/ICOA49421.2020.9094524\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The work presented focuses on the resolution of the multi compartment vehicle routing problem (MCVRP), a variant of the general vehicle routing problem (VRP). An adapted Discrete Bat Algorithm (DBA) is applied and numerical results are compared to results obtained by a Greedy Randomized Adaptive Search Procedure (GRASP). The algorithm proved to be efficient and further studies can be done to enhance its performance.\",\"PeriodicalId\":253361,\"journal\":{\"name\":\"2020 IEEE 6th International Conference on Optimization and Applications (ICOA)\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 6th International Conference on Optimization and Applications (ICOA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOA49421.2020.9094524\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 6th International Conference on Optimization and Applications (ICOA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOA49421.2020.9094524","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

提出的工作重点是解决多室车辆路线问题(MCVRP)，这是一般车辆路线问题(VRP)的一种变体。采用了一种自适应离散蝙蝠算法(DBA)，并将数值结果与贪婪随机自适应搜索程序(GRASP)的结果进行了比较。该算法被证明是有效的，可以进一步研究以提高其性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Discrete Bat Algorithm for the Multi-Compartment Vehicle Routing Problem

The work presented focuses on the resolution of the multi compartment vehicle routing problem (MCVRP), a variant of the general vehicle routing problem (VRP). An adapted Discrete Bat Algorithm (DBA) is applied and numerical results are compared to results obtained by a Greedy Randomized Adaptive Search Procedure (GRASP). The algorithm proved to be efficient and further studies can be done to enhance its performance.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2020 IEEE 6th International Conference on Optimization and Applications (ICOA)

自引率

0.00%

发文量