Changxi Ma , Chuwei Shi , Yun Yang , Yongpeng Zhao , Zhuye Xu , Bo Du
{"title":"轮辐物流网络多目标优化的VNS-NPGA方法","authors":"Changxi Ma , Chuwei Shi , Yun Yang , Yongpeng Zhao , Zhuye Xu , Bo Du","doi":"10.1016/j.jtte.2023.07.014","DOIUrl":null,"url":null,"abstract":"<div><div>To realize low-cost freight transport in the logistics network and improve the network operation efficiency, a multi-objective optimization model and the corresponding algorithm for a hub-and-spoke logistics network are proposed based on the multi-level location of hub points and channels layout. By considering the structure of the multi-level hub-and-spoke logistics network and the features of the connectivity between the hub and spoke points, the multi-objective optimization model is constructed with two objectives of minimizing the total network operation costs and the total network service time. By considering the characteristics of decision variables and models, a variable neighborhood search (VNS)-niched Pareto genetic algorithm (NPGA) approach with a three-stage encoding structure chromosome is proposed, where the VNS algorithm nested in NPGA is used for individual variable neighborhood search to optimize individual channel level genes, and NPGA is adopted to solve the multi-objective optimization model. To evaluate the performance of the proposed VNS-NPGA approach, a real-life case study based on a small-scale Australia Post data set was conducted, and 25 nodes of the Australia Post and 14 nodes of the Gansu Province 3-level hub-and-spoke logistics networks were established, respectively. The analysis results indicated that the network structure of multi-level hub points could avoid the detour problem existing in the traditional hub-and-spoke network, and showed better applicability in the narrow geographical structure. Compared to the traditional multi-objective evolutionary algorithms, VNS-NPGA can obtain better solutions through the distributed optimization of channel levels, avoiding the problem that a single algorithm cannot effectively deal with coupling relationships in genes.</div></div>","PeriodicalId":47239,"journal":{"name":"Journal of Traffic and Transportation Engineering-English Edition","volume":"12 2","pages":"Pages 390-409"},"PeriodicalIF":7.4000,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A VNS-NPGA approach to multi-objective optimization of hub-and-spoke logistics network\",\"authors\":\"Changxi Ma , Chuwei Shi , Yun Yang , Yongpeng Zhao , Zhuye Xu , Bo Du\",\"doi\":\"10.1016/j.jtte.2023.07.014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>To realize low-cost freight transport in the logistics network and improve the network operation efficiency, a multi-objective optimization model and the corresponding algorithm for a hub-and-spoke logistics network are proposed based on the multi-level location of hub points and channels layout. By considering the structure of the multi-level hub-and-spoke logistics network and the features of the connectivity between the hub and spoke points, the multi-objective optimization model is constructed with two objectives of minimizing the total network operation costs and the total network service time. By considering the characteristics of decision variables and models, a variable neighborhood search (VNS)-niched Pareto genetic algorithm (NPGA) approach with a three-stage encoding structure chromosome is proposed, where the VNS algorithm nested in NPGA is used for individual variable neighborhood search to optimize individual channel level genes, and NPGA is adopted to solve the multi-objective optimization model. To evaluate the performance of the proposed VNS-NPGA approach, a real-life case study based on a small-scale Australia Post data set was conducted, and 25 nodes of the Australia Post and 14 nodes of the Gansu Province 3-level hub-and-spoke logistics networks were established, respectively. The analysis results indicated that the network structure of multi-level hub points could avoid the detour problem existing in the traditional hub-and-spoke network, and showed better applicability in the narrow geographical structure. Compared to the traditional multi-objective evolutionary algorithms, VNS-NPGA can obtain better solutions through the distributed optimization of channel levels, avoiding the problem that a single algorithm cannot effectively deal with coupling relationships in genes.</div></div>\",\"PeriodicalId\":47239,\"journal\":{\"name\":\"Journal of Traffic and Transportation Engineering-English Edition\",\"volume\":\"12 2\",\"pages\":\"Pages 390-409\"},\"PeriodicalIF\":7.4000,\"publicationDate\":\"2025-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Traffic and Transportation Engineering-English Edition\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2095756425000406\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, CIVIL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Traffic and Transportation Engineering-English Edition","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2095756425000406","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, CIVIL","Score":null,"Total":0}
A VNS-NPGA approach to multi-objective optimization of hub-and-spoke logistics network
To realize low-cost freight transport in the logistics network and improve the network operation efficiency, a multi-objective optimization model and the corresponding algorithm for a hub-and-spoke logistics network are proposed based on the multi-level location of hub points and channels layout. By considering the structure of the multi-level hub-and-spoke logistics network and the features of the connectivity between the hub and spoke points, the multi-objective optimization model is constructed with two objectives of minimizing the total network operation costs and the total network service time. By considering the characteristics of decision variables and models, a variable neighborhood search (VNS)-niched Pareto genetic algorithm (NPGA) approach with a three-stage encoding structure chromosome is proposed, where the VNS algorithm nested in NPGA is used for individual variable neighborhood search to optimize individual channel level genes, and NPGA is adopted to solve the multi-objective optimization model. To evaluate the performance of the proposed VNS-NPGA approach, a real-life case study based on a small-scale Australia Post data set was conducted, and 25 nodes of the Australia Post and 14 nodes of the Gansu Province 3-level hub-and-spoke logistics networks were established, respectively. The analysis results indicated that the network structure of multi-level hub points could avoid the detour problem existing in the traditional hub-and-spoke network, and showed better applicability in the narrow geographical structure. Compared to the traditional multi-objective evolutionary algorithms, VNS-NPGA can obtain better solutions through the distributed optimization of channel levels, avoiding the problem that a single algorithm cannot effectively deal with coupling relationships in genes.
期刊介绍:
The Journal of Traffic and Transportation Engineering (English Edition) serves as a renowned academic platform facilitating the exchange and exploration of innovative ideas in the realm of transportation. Our journal aims to foster theoretical and experimental research in transportation and welcomes the submission of exceptional peer-reviewed papers on engineering, planning, management, and information technology. We are dedicated to expediting the peer review process and ensuring timely publication of top-notch research in this field.