多目标多邻域搜索算法求解多目标机队规模和带时间窗的混合位置-路由问题

IEEE Transactions on Systems Man and Cybernetics Part A-Systems and Humans Pub Date : 2021-04-01 DOI:10.1109/TSMC.2019.2912194

Jiahai Wang, Liangsheng Yuan, Zizhen Zhang, Shangce Gao, Yuyan Sun, Yalan Zhou

{"title":"多目标多邻域搜索算法求解多目标机队规模和带时间窗的混合位置-路由问题","authors":"Jiahai Wang, Liangsheng Yuan, Zizhen Zhang, Shangce Gao, Yuyan Sun, Yalan Zhou","doi":"10.1109/TSMC.2019.2912194","DOIUrl":null,"url":null,"abstract":"This paper introduces a multiobjective fleet size and mix location-routing problem with time windows and designs a set of real-world benchmark instances. Then, two versions of multiobjective multiple neighborhood search algorithms based on decomposition and vector angle are developed for solving the problem. In the proposed algorithms, three different kinds of neighborhood search operators, including general local search, objective-specific local search, and large neighborhood search, are carefully designed and combined in a synergistic manner. The experimental results show the effectiveness of the proposed algorithms. Relationships between different objectives in this multiobjective problem are also discussed.","PeriodicalId":55007,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part A-Systems and Humans","volume":"130 1","pages":"2284-2298"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Multiobjective Multiple Neighborhood Search Algorithms for Multiobjective Fleet Size and Mix Location-Routing Problem With Time Windows\",\"authors\":\"Jiahai Wang, Liangsheng Yuan, Zizhen Zhang, Shangce Gao, Yuyan Sun, Yalan Zhou\",\"doi\":\"10.1109/TSMC.2019.2912194\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a multiobjective fleet size and mix location-routing problem with time windows and designs a set of real-world benchmark instances. Then, two versions of multiobjective multiple neighborhood search algorithms based on decomposition and vector angle are developed for solving the problem. In the proposed algorithms, three different kinds of neighborhood search operators, including general local search, objective-specific local search, and large neighborhood search, are carefully designed and combined in a synergistic manner. The experimental results show the effectiveness of the proposed algorithms. Relationships between different objectives in this multiobjective problem are also discussed.\",\"PeriodicalId\":55007,\"journal\":{\"name\":\"IEEE Transactions on Systems Man and Cybernetics Part A-Systems and Humans\",\"volume\":\"130 1\",\"pages\":\"2284-2298\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Systems Man and Cybernetics Part A-Systems and Humans\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TSMC.2019.2912194\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Systems Man and Cybernetics Part A-Systems and Humans","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TSMC.2019.2912194","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 25

摘要

本文引入了一个带时间窗口的多目标机队规模和混合位置路由问题，并设计了一组真实的基准实例。在此基础上，提出了基于分解和矢量角的多目标多邻域搜索算法。在该算法中，精心设计了三种不同的邻域搜索算子，包括一般局部搜索、目标特定局部搜索和大邻域搜索，并以协同的方式组合在一起。实验结果表明了所提算法的有效性。讨论了多目标问题中不同目标之间的关系。

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

查看原文本刊更多论文

Multiobjective Multiple Neighborhood Search Algorithms for Multiobjective Fleet Size and Mix Location-Routing Problem With Time Windows

This paper introduces a multiobjective fleet size and mix location-routing problem with time windows and designs a set of real-world benchmark instances. Then, two versions of multiobjective multiple neighborhood search algorithms based on decomposition and vector angle are developed for solving the problem. In the proposed algorithms, three different kinds of neighborhood search operators, including general local search, objective-specific local search, and large neighborhood search, are carefully designed and combined in a synergistic manner. The experimental results show the effectiveness of the proposed algorithms. Relationships between different objectives in this multiobjective problem are also discussed.

求助全文

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

来源期刊

IEEE Transactions on Systems Man and Cybernetics Part A-Systems and Humans 工程技术-计算机：控制论

自引率

0.00%

发文量

审稿时长

6.0 months

期刊介绍： The scope of the IEEE Transactions on Systems, Man, and Cybernetics: Systems includes the fields of systems engineering. It includes issue formulation, analysis and modeling, decision making, and issue interpretation for any of the systems engineering lifecycle phases associated with the definition, development, and deployment of large systems. In addition, it includes systems management, systems engineering processes, and a variety of systems engineering methods such as optimization, modeling and simulation.