A Tabu Search Heuristic for the Mixed Rural Postman Problem with Hierarchical Constraints

Autor:	Wei-Jen Chung, 鍾偉仁
Druh dokumentu:	學位論文 ; thesis
Popis:	86 The main purpose of this research is to use Tabu Search method as the basis to develop a good heuristic algorithm for the Mixed Rural Postman Problem with Hierarchical Constraints. We propose two initial solution methods and three neighborhood search methods which are used to combined into six different heuristic algorithms. Programming language TURBO C++ is used to encode the above six heuristics and generate experimental data. Then based on these data, Analysis of Variance (ANOVA) and Bonferroni Adjustment are applied to analyze to set the best parameters values of each heuristics. After this, the heuristics are use to gather data again in their best settings. As a result for analyzing these new data, we conclude that Tabu Ⅰand Tabu Ⅳ are the best heuristics in this research.
Databáze:	Networked Digital Library of Theses & Dissertations
Externí odkaz:	http://ndltd.ncl.edu.tw/handle/71693968664780084981 Zobrazit plný text záznamu