{"title":"缩小大型 CVRP 问题规模的方法","authors":"","doi":"10.1016/j.cor.2024.106820","DOIUrl":null,"url":null,"abstract":"<div><p>We solve the Capacitated Vehicle Routing Problem (CVRP) by introducing a novel approach to problem size reduction. We propose the generation of short sequences of nodes called “sections”, which effectively act as single nodes in a reduced CVRP that is faster and easier to solve. Three section generation methods are compared, and the trade-off between solution quality and computation time savings is evaluated. We show that reduced problem sizes of up to around 60 percent of the original problem size, result in only modest decreases in solution quality, but allow for significant reductions of computation time, regardless of the optimization algorithm used. Our findings highlight the potential benefits of problem aggregation and size reduction for large-scale CVRPs and suggest opportunities for further improving aggregation methods.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1000,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305054824002922/pdfft?md5=61938c67938137b7b40568d0bc01a7b8&pid=1-s2.0-S0305054824002922-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Problem size reduction methods for large CVRPs\",\"authors\":\"\",\"doi\":\"10.1016/j.cor.2024.106820\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We solve the Capacitated Vehicle Routing Problem (CVRP) by introducing a novel approach to problem size reduction. We propose the generation of short sequences of nodes called “sections”, which effectively act as single nodes in a reduced CVRP that is faster and easier to solve. Three section generation methods are compared, and the trade-off between solution quality and computation time savings is evaluated. We show that reduced problem sizes of up to around 60 percent of the original problem size, result in only modest decreases in solution quality, but allow for significant reductions of computation time, regardless of the optimization algorithm used. Our findings highlight the potential benefits of problem aggregation and size reduction for large-scale CVRPs and suggest opportunities for further improving aggregation methods.</p></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-08-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0305054824002922/pdfft?md5=61938c67938137b7b40568d0bc01a7b8&pid=1-s2.0-S0305054824002922-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305054824002922\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824002922","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
We solve the Capacitated Vehicle Routing Problem (CVRP) by introducing a novel approach to problem size reduction. We propose the generation of short sequences of nodes called “sections”, which effectively act as single nodes in a reduced CVRP that is faster and easier to solve. Three section generation methods are compared, and the trade-off between solution quality and computation time savings is evaluated. We show that reduced problem sizes of up to around 60 percent of the original problem size, result in only modest decreases in solution quality, but allow for significant reductions of computation time, regardless of the optimization algorithm used. Our findings highlight the potential benefits of problem aggregation and size reduction for large-scale CVRPs and suggest opportunities for further improving aggregation methods.
期刊介绍:
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.