解决小型核心的大型车辆路线和调度问题

ACM '83 Pub Date : 1900-01-01 DOI:10.1145/800173.809693

L. Bodin

{"title":"解决小型核心的大型车辆路线和调度问题","authors":"L. Bodin","doi":"10.1145/800173.809693","DOIUrl":null,"url":null,"abstract":"In this paper, an efficient implementation of the Clarke and Wright algorithm for solving the single depot vehicle routing and scheduling problem is presented. With this implementation, a 900 customer problem can be solved approximately in less than 9 seconds of CPU time and less than 128K bytes of storage on an IBM 3033 computer.","PeriodicalId":306306,"journal":{"name":"ACM '83","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Solving large vehicle routing and scheduling problems in small core\",\"authors\":\"L. Bodin\",\"doi\":\"10.1145/800173.809693\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an efficient implementation of the Clarke and Wright algorithm for solving the single depot vehicle routing and scheduling problem is presented. With this implementation, a 900 customer problem can be solved approximately in less than 9 seconds of CPU time and less than 128K bytes of storage on an IBM 3033 computer.\",\"PeriodicalId\":306306,\"journal\":{\"name\":\"ACM '83\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM '83\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800173.809693\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '83","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800173.809693","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

本文提出了求解单车场车辆路线调度问题的Clarke & Wright算法的一种有效实现方法。通过这种实现，在IBM 3033计算机上，大约可以在不到9秒的CPU时间和不到128K字节的存储空间内解决900个客户的问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Solving large vehicle routing and scheduling problems in small core

In this paper, an efficient implementation of the Clarke and Wright algorithm for solving the single depot vehicle routing and scheduling problem is presented. With this implementation, a 900 customer problem can be solved approximately in less than 9 seconds of CPU time and less than 128K bytes of storage on an IBM 3033 computer.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM '83

自引率

0.00%

发文量