{"title":"将 Lexisearch 算法应用于带时间窗口的车辆路由问题","authors":"Achaku D. T., Sani B.","doi":"10.52589/ajmss-ibkaswqh","DOIUrl":null,"url":null,"abstract":"Vehicle Routing Problem with Time Windows (VRPTW) is an NP hard combinatorial scheduling optimization problem in which a minimum number of routes have to be determined so as to serve each of the destinations within their specified time windows. In this paper, the mail delivery of the Nigerian Postal Services (NIPOST) is modelled as a VRPTW in order to address the problem of delay in mail delivery occurring regularly in NIPOST. The Abuja Post Office is used as a case study and the Model of a related literature is applied with modifications to solve the problem. The problem is solved by applying Lexisearch algorithm using data that was obtained from Abuja Post Office and computational results on Solomon’s 100 instances were used to validate the algorithm.","PeriodicalId":251990,"journal":{"name":"African Journal of Mathematics and Statistics Studies","volume":"143 4","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Application of Lexisearch Algorithm to Vehicle Routing Problem with Time Windows\",\"authors\":\"Achaku D. T., Sani B.\",\"doi\":\"10.52589/ajmss-ibkaswqh\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicle Routing Problem with Time Windows (VRPTW) is an NP hard combinatorial scheduling optimization problem in which a minimum number of routes have to be determined so as to serve each of the destinations within their specified time windows. In this paper, the mail delivery of the Nigerian Postal Services (NIPOST) is modelled as a VRPTW in order to address the problem of delay in mail delivery occurring regularly in NIPOST. The Abuja Post Office is used as a case study and the Model of a related literature is applied with modifications to solve the problem. The problem is solved by applying Lexisearch algorithm using data that was obtained from Abuja Post Office and computational results on Solomon’s 100 instances were used to validate the algorithm.\",\"PeriodicalId\":251990,\"journal\":{\"name\":\"African Journal of Mathematics and Statistics Studies\",\"volume\":\"143 4\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"African Journal of Mathematics and Statistics Studies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.52589/ajmss-ibkaswqh\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"African Journal of Mathematics and Statistics Studies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52589/ajmss-ibkaswqh","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Application of Lexisearch Algorithm to Vehicle Routing Problem with Time Windows
Vehicle Routing Problem with Time Windows (VRPTW) is an NP hard combinatorial scheduling optimization problem in which a minimum number of routes have to be determined so as to serve each of the destinations within their specified time windows. In this paper, the mail delivery of the Nigerian Postal Services (NIPOST) is modelled as a VRPTW in order to address the problem of delay in mail delivery occurring regularly in NIPOST. The Abuja Post Office is used as a case study and the Model of a related literature is applied with modifications to solve the problem. The problem is solved by applying Lexisearch algorithm using data that was obtained from Abuja Post Office and computational results on Solomon’s 100 instances were used to validate the algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
