書誌事項
- タイトル別名
-
- Route Optimization of Marking Torch Using Ant Colony Method
- アントコロニーホウ オ モチイタ マーキントーチ ノ ケイロ サイテキ カ
この論文をさがす
抄録
Although many methods have been applied to solve the combinatorial optimization problem, there are many cases in which the global optimum solution cannot be gained within a practical computation time, even if computers become more advanced. Recently,ant colony optimization (ACO) has been proposed as a meta-heuristic method to solve this problem. ACO has been tried and verified for the traveling salesman problem (TSP) to obtain the shortest path among many routes between many cities, as a representative combinatorial optimization problem. The authors have applied ACO to ship production work, such as welding and cutting, and now "marking", which is a process of writing information required in the next stage of manufacture, such as fabrication or assembly, on a steel plate by flame spray coating using a numerical control (NC) machine. In this work, the problem of searching for the optimum pathway of the NC marking torch is discussed, and a method to obtain the optimal route in a short time is presented. A system for improving ACO was developed and successfully applied to the shipyard.
収録刊行物
-
- 日本船舶海洋工学会論文集
-
日本船舶海洋工学会論文集 16 (0), 181-187, 2012
公益社団法人 日本船舶海洋工学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282680231382912
-
- NII論文ID
- 10031139240
-
- NII書誌ID
- AA12057769
-
- ISSN
- 18811760
- 18803717
-
- NDL書誌ID
- 024270362
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可