Applying Tabu Search on the Sequential Ordering Problem
碩士 === 元智大學 === 工業工程研究所 === 87 === The purpose of this research is to develop a Tabu Search heuristic algorithm for the Sequential Ordering Problem (SOP), which sometimes is referred to as the Traveling Salesman Problem with Precedence Constraints. Two tour construction heuristics, namely, nearest n...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
1999
|
Online Access: | http://ndltd.ncl.edu.tw/handle/68982205019882232694 |