完整後設資料紀錄
DC 欄位語言
dc.contributor.authorJih, Wan-Rong
dc.contributor.authorChen, Ying-Ping
dc.contributor.authorHsu, Jane
dc.date.accessioned2009-08-23T04:39:10Z
dc.date.accessioned2020-05-25T06:24:48Z-
dc.date.available2009-08-23T04:39:10Z
dc.date.available2020-05-25T06:24:48Z-
dc.date.issued2006-10-24T06:55:25Z
dc.date.submitted1996-12-19
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/2398-
dc.description.abstractIn 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.extent8p.
dc.format.extent549923 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries1996 ICS會議
dc.subject.otherPlanning & Robotics
dc.titleA Comparative Study of Genetic Algorithms for Vehicle Routing with Time Constraints
分類:1996年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics001996000059.pdf537.03 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。