{"title":"A Variable Neighborhood Search Algorithm for Continuous Location Routing Problem with Pickup and Delivery","authors":"R. Ghodsi, A. S. Amiri","doi":"10.1109/AMS.2010.131","DOIUrl":null,"url":null,"abstract":"Location Routing Problem (LRP) is combination of Facility location Problem and Vehicle Routing Problem. The classic LRP considers a discrete number of locations as possible candidates for facilities locations. However, the continuous location routing problem (CLRP) as an extension to the classic LRP allows any location for the facilities and thus the solution space is continuous. There is a very scarce literature available for CLRP. In this paper, the CLRP with pickup and delivery is first formulated and to solve the problem, a Variable Neighborhood Search algorithm is used considering different neighborhoods and acceptation levels. Problems from small to large size can be solved and the experimentation results are promising.","PeriodicalId":437153,"journal":{"name":"2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AMS.2010.131","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Location Routing Problem (LRP) is combination of Facility location Problem and Vehicle Routing Problem. The classic LRP considers a discrete number of locations as possible candidates for facilities locations. However, the continuous location routing problem (CLRP) as an extension to the classic LRP allows any location for the facilities and thus the solution space is continuous. There is a very scarce literature available for CLRP. In this paper, the CLRP with pickup and delivery is first formulated and to solve the problem, a Variable Neighborhood Search algorithm is used considering different neighborhoods and acceptation levels. Problems from small to large size can be solved and the experimentation results are promising.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
