{"title":"学习引导路由问题的本地搜索优化","authors":"Nasrin Sultana , Jeffrey Chan , Babak Abbasi , Tabinda Sarwar , A.K. Qin","doi":"10.1016/j.orl.2024.107136","DOIUrl":null,"url":null,"abstract":"<div><p>Machine learning has shown promises in tackling routing problems yet falls short of state-of-the-art solutions achieved by stand-alone operations research algorithms. This paper introduces “Learning to Guide Local Search” (L2GLS), a novel approach that leverages Local Search operators' strengths and reinforcement learning to adjust search efforts adaptively. The results of comparing L2GLS with the existing cutting-edge approaches indicate that L2GLS attains new levels of state-of-the-art performance, particularly excelling in handling large instances that continue to challenge existing algorithms.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"55 ","pages":"Article 107136"},"PeriodicalIF":0.8000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167637724000725/pdfft?md5=66f33ec40711a0e744a6ac695354fa06&pid=1-s2.0-S0167637724000725-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Learning to guide local search optimisation for routing problems\",\"authors\":\"Nasrin Sultana , Jeffrey Chan , Babak Abbasi , Tabinda Sarwar , A.K. Qin\",\"doi\":\"10.1016/j.orl.2024.107136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Machine learning has shown promises in tackling routing problems yet falls short of state-of-the-art solutions achieved by stand-alone operations research algorithms. This paper introduces “Learning to Guide Local Search” (L2GLS), a novel approach that leverages Local Search operators' strengths and reinforcement learning to adjust search efforts adaptively. The results of comparing L2GLS with the existing cutting-edge approaches indicate that L2GLS attains new levels of state-of-the-art performance, particularly excelling in handling large instances that continue to challenge existing algorithms.</p></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"55 \",\"pages\":\"Article 107136\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0167637724000725/pdfft?md5=66f33ec40711a0e744a6ac695354fa06&pid=1-s2.0-S0167637724000725-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167637724000725\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637724000725","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
Learning to guide local search optimisation for routing problems
Machine learning has shown promises in tackling routing problems yet falls short of state-of-the-art solutions achieved by stand-alone operations research algorithms. This paper introduces “Learning to Guide Local Search” (L2GLS), a novel approach that leverages Local Search operators' strengths and reinforcement learning to adjust search efforts adaptively. The results of comparing L2GLS with the existing cutting-edge approaches indicate that L2GLS attains new levels of state-of-the-art performance, particularly excelling in handling large instances that continue to challenge existing algorithms.
期刊介绍:
Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.