{"title":"烟草车辆路径问题的解决方法","authors":"X. Qiu, Haiyang Huang, Gang Li","doi":"10.1109/BCGIN.2011.101","DOIUrl":null,"url":null,"abstract":"Based on the study of vehicle routing problem of a tobacco logistics distribution center, this paper establishes a specific mathematical model, providing clients with optimal grouping and routes by finding out routes after grouping. The actual process is to group the clients according to the capacity of a single vehicle to make the total amount of demands of all clients not exceed the capacity of the vehicle in each group. Then the routes are obtained based on the nearest insertion algorithm in a TSP problem in each group to get the optimization.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Solution to Tobacco Vehicle Routing Problem\",\"authors\":\"X. Qiu, Haiyang Huang, Gang Li\",\"doi\":\"10.1109/BCGIN.2011.101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on the study of vehicle routing problem of a tobacco logistics distribution center, this paper establishes a specific mathematical model, providing clients with optimal grouping and routes by finding out routes after grouping. The actual process is to group the clients according to the capacity of a single vehicle to make the total amount of demands of all clients not exceed the capacity of the vehicle in each group. Then the routes are obtained based on the nearest insertion algorithm in a TSP problem in each group to get the optimization.\",\"PeriodicalId\":127523,\"journal\":{\"name\":\"2011 International Conference on Business Computing and Global Informatization\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Business Computing and Global Informatization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BCGIN.2011.101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Business Computing and Global Informatization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BCGIN.2011.101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Based on the study of vehicle routing problem of a tobacco logistics distribution center, this paper establishes a specific mathematical model, providing clients with optimal grouping and routes by finding out routes after grouping. The actual process is to group the clients according to the capacity of a single vehicle to make the total amount of demands of all clients not exceed the capacity of the vehicle in each group. Then the routes are obtained based on the nearest insertion algorithm in a TSP problem in each group to get the optimization.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
