A nondominated sorting simplified swarm optimization with local search mechanisms for multi-objective vehicle routing problems with time windows

IF 7.2 1区计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Applied Soft Computing Pub Date : 2025-03-11 DOI:10.1016/j.asoc.2025.112989

Chyh-Ming Lai , Chun-Chih Chiu , Tzu-Li Chen

{"title":"A nondominated sorting simplified swarm optimization with local search mechanisms for multi-objective vehicle routing problems with time windows","authors":"Chyh-Ming Lai , Chun-Chih Chiu , Tzu-Li Chen","doi":"10.1016/j.asoc.2025.112989","DOIUrl":null,"url":null,"abstract":"<div><div>In addressing the complexities of modern logistics, this study introduces a novel multi-objective formulation for vehicle routing problems with time windows (MO-VRPTW), targeting minimizing travel distance, enhancing customer satisfaction, and equalizing driver workloads. We introduce an innovative hybrid multi-objective evolutionary algorithm (MOEA) leveraging nondominated sorting simplified swarm optimization to effectively merge the advantages of various optimization strategies. A key aspect of this advancement is the incorporation of the Lin−Kernighan<strong>−</strong>Helsgaun (LKH) heuristic, which delivers a superior initial solution, thereby markedly enhancing the speed of convergence. Additionally, we pioneered a local search method inspired by the A* algorithm designed to refine the search process's exploration and exploitation stages. Solomon's benchmark instances, a recognized standard in the VRPTW field, were used to validate our algorithm's effectiveness. Our algorithm demonstrated superior performance in addressing MO-VRPTW through meticulous statistical analysis, outperforming state-of-the-art algorithms, such as MOPSO, NSGA-II, MOEA/D, and SPEA2, regarding efficiency and solution diversity. This study not only advances algorithmic performance but also thoughtfully considers the interests of key supply chain stakeholders.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"174 ","pages":"Article 112989"},"PeriodicalIF":7.2000,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S156849462500300X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}

引用次数: 0

Abstract

In addressing the complexities of modern logistics, this study introduces a novel multi-objective formulation for vehicle routing problems with time windows (MO-VRPTW), targeting minimizing travel distance, enhancing customer satisfaction, and equalizing driver workloads. We introduce an innovative hybrid multi-objective evolutionary algorithm (MOEA) leveraging nondominated sorting simplified swarm optimization to effectively merge the advantages of various optimization strategies. A key aspect of this advancement is the incorporation of the Lin−Kernighan−Helsgaun (LKH) heuristic, which delivers a superior initial solution, thereby markedly enhancing the speed of convergence. Additionally, we pioneered a local search method inspired by the A* algorithm designed to refine the search process's exploration and exploitation stages. Solomon's benchmark instances, a recognized standard in the VRPTW field, were used to validate our algorithm's effectiveness. Our algorithm demonstrated superior performance in addressing MO-VRPTW through meticulous statistical analysis, outperforming state-of-the-art algorithms, such as MOPSO, NSGA-II, MOEA/D, and SPEA2, regarding efficiency and solution diversity. This study not only advances algorithmic performance but also thoughtfully considers the interests of key supply chain stakeholders.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Applied Soft Computing 工程技术-计算机：跨学科应用

CiteScore

15.80

自引率

6.90%

发文量

874

审稿时长

10.9 months

期刊介绍： Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.