Loading...
Please wait, while we are loading the content...
Similar Documents
A tabu search algorithm for solving the extended maximal availability location problem.
| Content Provider | CiteSeerX |
|---|---|
| Author | Chiyoshi, Fernando Y. Galvão, Roberto D. Morabito, Reinaldo |
| Abstract | The objective of this study is to develop a tabu search (TS) procedure for the Extended Maximal Availability Location Problem (EMALP) and compare the results obtained with this procedure against those obtained with the Simulated Annealing (SA) procedure developed by Galvão et al. (2005) for the same problem. It is shown that in terms of quality the solutions SA outperforms TS for the smaller networks, while TS outperforms SA for the larger 200- and 250-node randomly generated networks. Comparative data related to processing times for both algorithms are also given. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Solution Sa Comparative Data Simulated Annealing Tabu Search Extended Maximal Availability Location Problem |
| Content Type | Text |