Bachtiar Herdianto, Romain Billot, Flavien Lucas, Marc Sevaux
{"title":"用基于特征的引导和多样性管理增强元搜索法解决拥挤车辆路由问题","authors":"Bachtiar Herdianto, Romain Billot, Flavien Lucas, Marc Sevaux","doi":"arxiv-2407.20777","DOIUrl":null,"url":null,"abstract":"We propose a metaheuristic algorithm enhanced with feature-based guidance\nthat is designed to solve the Capacitated Vehicle Routing Problem (CVRP). To\nformulate the proposed guidance, we developed and explained a supervised\nMachine Learning (ML) model, that is used to formulate the guidance and control\nthe diversity of the solution during the optimization process. We propose a\nmetaheuristic algorithm combining neighborhood search and a novel mechanism of\nhybrid split and path relinking to implement the proposed guidance. The\nproposed guidance has proven to give a statistically significant improvement to\nthe proposed metaheuristic algorithm when solving CVRP. Moreover, the proposed\nguided metaheuristic is also capable of producing competitive solutions among\nstate-of-the-art metaheuristic algorithms.","PeriodicalId":501216,"journal":{"name":"arXiv - CS - Discrete Mathematics","volume":"20 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Metaheuristic Enhanced with Feature-Based Guidance and Diversity Management for Solving the Capacitated Vehicle Routing Problem\",\"authors\":\"Bachtiar Herdianto, Romain Billot, Flavien Lucas, Marc Sevaux\",\"doi\":\"arxiv-2407.20777\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a metaheuristic algorithm enhanced with feature-based guidance\\nthat is designed to solve the Capacitated Vehicle Routing Problem (CVRP). To\\nformulate the proposed guidance, we developed and explained a supervised\\nMachine Learning (ML) model, that is used to formulate the guidance and control\\nthe diversity of the solution during the optimization process. We propose a\\nmetaheuristic algorithm combining neighborhood search and a novel mechanism of\\nhybrid split and path relinking to implement the proposed guidance. The\\nproposed guidance has proven to give a statistically significant improvement to\\nthe proposed metaheuristic algorithm when solving CVRP. Moreover, the proposed\\nguided metaheuristic is also capable of producing competitive solutions among\\nstate-of-the-art metaheuristic algorithms.\",\"PeriodicalId\":501216,\"journal\":{\"name\":\"arXiv - CS - Discrete Mathematics\",\"volume\":\"20 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.20777\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.20777","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Metaheuristic Enhanced with Feature-Based Guidance and Diversity Management for Solving the Capacitated Vehicle Routing Problem
We propose a metaheuristic algorithm enhanced with feature-based guidance
that is designed to solve the Capacitated Vehicle Routing Problem (CVRP). To
formulate the proposed guidance, we developed and explained a supervised
Machine Learning (ML) model, that is used to formulate the guidance and control
the diversity of the solution during the optimization process. We propose a
metaheuristic algorithm combining neighborhood search and a novel mechanism of
hybrid split and path relinking to implement the proposed guidance. The
proposed guidance has proven to give a statistically significant improvement to
the proposed metaheuristic algorithm when solving CVRP. Moreover, the proposed
guided metaheuristic is also capable of producing competitive solutions among
state-of-the-art metaheuristic algorithms.