題名: | Solving Route Planning Using Euler Path Transform |
作者: | Zeng, Yi-Chong |
關鍵字: | Euler path route planning mixed-integer linear programming |
期刊名/會議名稱: | NCS 2009 |
摘要: | This paper presents a method to solve route planning problem in maze game and waste collection using Euler path transform, the core technique is mixed-integer linear programming (MILP). There are three issues are considered in the transformation, including, the direction of edge, the limited number of edge, and the user-defined starting and ending vertices. The experiment results show that the proposed method is capable of finding the optimal result for route planning. |
日期: | 2011-04-01T00:16:10Z |
分類: | 2009年 NCS 全國計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ICM 8-4.pdf | 549.9 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。