{"title":"基于遗传算法的交叉码头调度","authors":"Shayla Ley, S. Elfayoumy","doi":"10.1109/CIRA.2007.382928","DOIUrl":null,"url":null,"abstract":"Cross docking is a distribution system in which the merchandise received at a warehouse or distribution center is not stocked but immediately prepared for onward shipment. In other words, cross docking is the transfer of inward deliveries from the point of reception directly to the point of delivery with limited or no interim storage. One way to reduce cost in a cross dock terminal is to park incoming and outgoing trucks so that the loads can be efficiently moved across the dock. This means that the distance from loading and unloading is the shortest possible distance. The problem with generating an efficient schedule for the door assignments is that for n incoming and m outgoing trucks there are n!*m! possible solutions. This paper describes a solution to the cross dock scheduling problem using genetic algorithms. To judge the efficiency and accuracy of this solution, four programs were developed to test every possible combination of for small problem sizes (four, five, six, and seven incoming trucks). The results of the efficiency and accuracy testing shows that using genetic algorithms to schedule cross dock trucking operations provides an accurate and timely solution.","PeriodicalId":301626,"journal":{"name":"2007 International Symposium on Computational Intelligence in Robotics and Automation","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Cross Dock Scheduling Using Genetic Algorithms\",\"authors\":\"Shayla Ley, S. Elfayoumy\",\"doi\":\"10.1109/CIRA.2007.382928\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cross docking is a distribution system in which the merchandise received at a warehouse or distribution center is not stocked but immediately prepared for onward shipment. In other words, cross docking is the transfer of inward deliveries from the point of reception directly to the point of delivery with limited or no interim storage. One way to reduce cost in a cross dock terminal is to park incoming and outgoing trucks so that the loads can be efficiently moved across the dock. This means that the distance from loading and unloading is the shortest possible distance. The problem with generating an efficient schedule for the door assignments is that for n incoming and m outgoing trucks there are n!*m! possible solutions. This paper describes a solution to the cross dock scheduling problem using genetic algorithms. To judge the efficiency and accuracy of this solution, four programs were developed to test every possible combination of for small problem sizes (four, five, six, and seven incoming trucks). The results of the efficiency and accuracy testing shows that using genetic algorithms to schedule cross dock trucking operations provides an accurate and timely solution.\",\"PeriodicalId\":301626,\"journal\":{\"name\":\"2007 International Symposium on Computational Intelligence in Robotics and Automation\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Symposium on Computational Intelligence in Robotics and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIRA.2007.382928\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on Computational Intelligence in Robotics and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIRA.2007.382928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cross docking is a distribution system in which the merchandise received at a warehouse or distribution center is not stocked but immediately prepared for onward shipment. In other words, cross docking is the transfer of inward deliveries from the point of reception directly to the point of delivery with limited or no interim storage. One way to reduce cost in a cross dock terminal is to park incoming and outgoing trucks so that the loads can be efficiently moved across the dock. This means that the distance from loading and unloading is the shortest possible distance. The problem with generating an efficient schedule for the door assignments is that for n incoming and m outgoing trucks there are n!*m! possible solutions. This paper describes a solution to the cross dock scheduling problem using genetic algorithms. To judge the efficiency and accuracy of this solution, four programs were developed to test every possible combination of for small problem sizes (four, five, six, and seven incoming trucks). The results of the efficiency and accuracy testing shows that using genetic algorithms to schedule cross dock trucking operations provides an accurate and timely solution.