完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Jih, Wan-Rong | |
dc.contributor.author | Chen, Ying-Ping | |
dc.contributor.author | Hsu, Jane | |
dc.date.accessioned | 2009-08-23T04:39:10Z | |
dc.date.accessioned | 2020-05-25T06:24:48Z | - |
dc.date.available | 2009-08-23T04:39:10Z | |
dc.date.available | 2020-05-25T06:24:48Z | - |
dc.date.issued | 2006-10-24T06:55:25Z | |
dc.date.submitted | 1996-12-19 | |
dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/2398 | - |
dc.description.abstract | In this paper we investigate genetic algorithms as a search technique for obtaining near optimal solutions to the “single-vehicle pickup and delivery problem with time windows and capacity constraints” (single-operators, order crossover (OX), uniform order-based crossover (UOX), Merge Cross #1 (MX1) and Merge Cross #2 (MX2). The results of our experiments show that UOX and MX1 are suitable for the single-vehicle PDPTW, but OX and MX2 are not. In the future, we will lay more emphasis on UOX and MX1 for searching better solutions. | |
dc.description.sponsorship | 中山大學,高雄市 | |
dc.format.extent | 8p. | |
dc.format.extent | 549923 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | zh_TW | |
dc.relation.ispartofseries | 1996 ICS會議 | |
dc.subject.other | Planning & Robotics | |
dc.title | A Comparative Study of Genetic Algorithms for Vehicle Routing with Time Constraints | |
分類: | 1996年 ICS 國際計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ce07ics001996000059.pdf | 537.03 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。