期刊刊名：科技學刊－科技類 　 卷期：16卷3期

篇名出版日期：2007年8月1日

作者：Chi-Kong Huang, Yung-Yu Wu,黃志剛,吳永裕

語言：English

關鍵字：facility location problem, obnoxious facility, vehicle routing problem, tabu search, genetic algorithm,設施區位問題,鄰避設施,車輛途程問題,禁忌搜尋法,基因演算法

被點閱次數：3次

閱讀時間：17sec

摘要：
A location problem for obnoxious facility and vehicle routing problem are discussed in this paper. We focus on finding a feasible area and suitable site for the obnoxious facility and assigning the vehicle routings. A three-stage heuristic algorithm is pro-posed for solving this model. The first stage screens out infeasible areas for obnox-ious facility location. The second stage is searching for a better location for the fa-cility by using a Genetic algorithm. The third stage is to assign vehicle routings us-ing a Tabu algorithm. The solution algorithm has been tested by several examples. Results indicate that the three-stage algorithm do help us to find a better solution. In addition, if a good location can be found from the second stage of this algorithm, then a good solution quality for vehicle routings can achieve easily.

　　　　　[全文下載]