A Genetic Algorithm for the Sequential Ordering Problem
碩士 === 元智大學 === 工業工程研究所 === 87 === Sequential ordering problem is an asymmetric traveling salesman problem with precedence constraints. Given a set of n nodes and the distances between each pair of nodes, find a path from node 1 to node n with minimal distance, taking the given precedence constraint...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/19623473761638079770 |