A Genetic Local Search Algorithm with Lagrangean Heuristics for the Simple Plant Location Problem
碩士 === 國立中興大學 === 資訊科學研究所 === 92 === The simple plant location problem is one of the important combinatorial optimization problems and has attracted much attention for many years. It aims to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. In this thesis,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/04209446293718199478 |
| Summary: | 碩士 === 國立中興大學 === 資訊科學研究所 === 92 === The simple plant location problem is one of the important combinatorial optimization problems and has attracted much attention for many years. It aims to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. In this thesis, we proposed a hybrid metaheuristics for this problem. We first use a Lagrangean heuristic applies the subgradient optimization method to find the solution for the dual problem obtained by Lagrangean relaxation. After the reduction of the solution space, we then apply a genetic local search algorithm to search for the optimal solution. The experimental results of our method on the standard OR Library benchmarks reveal that our method has very good performance.
|
|---|