一种改进的可变邻域搜索算法求解固体废物分送收集和运输问题

2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI:10.1109/ICIST52614.2021.9440629

Wencong Zhao, Renqian Zhang, Xiaoxiang Yuan, Kaiping Luo

{"title":"一种改进的可变邻域搜索算法求解固体废物分送收集和运输问题","authors":"Wencong Zhao, Renqian Zhang, Xiaoxiang Yuan, Kaiping Luo","doi":"10.1109/ICIST52614.2021.9440629","DOIUrl":null,"url":null,"abstract":"This study addresses the solid waste collection and transportation problem with split deliveries (SWCTPSD). To minimize the total fleet costs, a mixed-integer programming model is proposed. An improved variable neighborhood search (VNS) algorithm is proposed to obtain a high-quality collection and transportation plan quickly. To enhance the local exploitive ability, the VNS algorithm is hybridized with simulated annealing. The experimental results show that the proposed VNS algorithm is effective.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries\",\"authors\":\"Wencong Zhao, Renqian Zhang, Xiaoxiang Yuan, Kaiping Luo\",\"doi\":\"10.1109/ICIST52614.2021.9440629\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study addresses the solid waste collection and transportation problem with split deliveries (SWCTPSD). To minimize the total fleet costs, a mixed-integer programming model is proposed. An improved variable neighborhood search (VNS) algorithm is proposed to obtain a high-quality collection and transportation plan quickly. To enhance the local exploitive ability, the VNS algorithm is hybridized with simulated annealing. The experimental results show that the proposed VNS algorithm is effective.\",\"PeriodicalId\":371599,\"journal\":{\"name\":\"2021 11th International Conference on Information Science and Technology (ICIST)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 11th International Conference on Information Science and Technology (ICIST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIST52614.2021.9440629\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 11th International Conference on Information Science and Technology (ICIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST52614.2021.9440629","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本研究解决了固体废物的收集和运输问题与分交付(SWCTPSD)。为了使车队总成本最小，提出了一种混合整数规划模型。为了快速得到高质量的集运方案，提出了一种改进的可变邻域搜索(VNS)算法。为了提高局部开发能力，将VNS算法与模拟退火算法相结合。实验结果表明，该算法是有效的。

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

查看原文本刊更多论文

An improved variable neighborhood search algorithm for the solid waste collection and transportation problem with split deliveries

This study addresses the solid waste collection and transportation problem with split deliveries (SWCTPSD). To minimize the total fleet costs, a mixed-integer programming model is proposed. An improved variable neighborhood search (VNS) algorithm is proposed to obtain a high-quality collection and transportation plan quickly. To enhance the local exploitive ability, the VNS algorithm is hybridized with simulated annealing. The experimental results show that the proposed VNS algorithm is effective.

求助全文

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

来源期刊

2021 11th International Conference on Information Science and Technology (ICIST)

自引率

0.00%

发文量