{"title":"车辆路线和调度问题的分类结构","authors":"Lawrence D. Bodin","doi":"10.1016/0305-7097(75)90003-4","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, it is shown that the routing and scheduling of vehicles with a nonreal time demand requirement has a reasonable natural taxonomic structure. It is also demonstrated that many vehicle routing and scheduling problems can be classified by their underlying properties in such a way that an algorithm suggested for their solution naturally evolves. Finally, some of the computational difficulties one encounters in implementing routing and scheduling systems on a computer are discussed.</p></div>","PeriodicalId":100321,"journal":{"name":"Computers & Urban Society","volume":"1 1","pages":"Pages 11-29"},"PeriodicalIF":0.0000,"publicationDate":"1975-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0305-7097(75)90003-4","citationCount":"53","resultStr":"{\"title\":\"A taxonomic structure for vehicle routing and scheduling problems\",\"authors\":\"Lawrence D. Bodin\",\"doi\":\"10.1016/0305-7097(75)90003-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper, it is shown that the routing and scheduling of vehicles with a nonreal time demand requirement has a reasonable natural taxonomic structure. It is also demonstrated that many vehicle routing and scheduling problems can be classified by their underlying properties in such a way that an algorithm suggested for their solution naturally evolves. Finally, some of the computational difficulties one encounters in implementing routing and scheduling systems on a computer are discussed.</p></div>\",\"PeriodicalId\":100321,\"journal\":{\"name\":\"Computers & Urban Society\",\"volume\":\"1 1\",\"pages\":\"Pages 11-29\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1975-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0305-7097(75)90003-4\",\"citationCount\":\"53\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Urban Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0305709775900034\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Urban Society","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0305709775900034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A taxonomic structure for vehicle routing and scheduling problems
In this paper, it is shown that the routing and scheduling of vehicles with a nonreal time demand requirement has a reasonable natural taxonomic structure. It is also demonstrated that many vehicle routing and scheduling problems can be classified by their underlying properties in such a way that an algorithm suggested for their solution naturally evolves. Finally, some of the computational difficulties one encounters in implementing routing and scheduling systems on a computer are discussed.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
