Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing

References

• Al-Sultan , KS and Al-Fawzan , MA . 1999 . A tabu search approach to the uncapacitated facility location problem . Ann. Oper. Res. , 86 : 91 – 103 .
   Web of Science ®Google Scholar
• Antunes , A and Peeters , D . 2001 . On solving complex multi-period location models using simulated annealing . Eur. J. Oper. Res. , 130 : 190 – 201 .
   Web of Science ®Google Scholar
• Aydin , ME and Fogarty , TC . 2004 . A modular simulated annealing algorithm for multi-agent systems: a job shop scheduling application . J. Intell. Mfg , 15 : 805 – 814 .
   Web of Science ®Google Scholar
• Back , T , Hammel , U and Schwefel , HP . 1997 . Evolutionary computation: comments on the history and current state . IEEE Trans. Evol. Comput. , 1 : 3 – 17 .
   Google Scholar
• Beasley , JE . 1988 . An algorithm for solving large capacitated warehouse location problems . Eur. J. Oper. Res. , 33 : 314 – 325 .
   Web of Science ®Google Scholar
• Beasley , JE . 1993 . Lagrangean heuristic for location problems . Eur. J. Oper. Res. , 65 : 383 – 399 .
   Web of Science ®Google Scholar
• Beasley , JE . 1996 . Obtaining test problems via Internet . J. Glob. Optim. , 8 : 429 – 433 .
   Web of Science ®Google Scholar
• Beyera , HG , Schwefela , HP and Wegenerb , I . 2002 . How to analyse evolutionary algorithms . Theor. Comput. Sci. , 287 : 101 – 130 .
   Web of Science ®Google Scholar
• Calegari , P , Coray , G , Hertz , A , Kobler , D and Kuonen , P . 1999 . A taxonomy of evolutionary algorithms in combinatorial optimization . J. Heuristics , 5 : 145 – 158 .
   Web of Science ®Google Scholar
• Drezner , Z . 1995 . Facility Location: A Survey of Applications and Methods , 22 – 30 . New York : Springer .
   Google Scholar
• Eiben , AE and Schoenauer , M . 2002 . Evolutionary computing . Inf. Process. Lett. , 82 : 1 – 6 .
   Web of Science ®Google Scholar
• Erlenkotter , D . 1978 . A dual-based procedure for uncapacitated facility location . Oper. Res. , 26 : 992 – 1009 .
   Web of Science ®Google Scholar
• Fogel , DB . 1994 . An introduction to simulated evolutionary optimization . IEEE Trans. Neural Networks , 5 : 3 – 14 .
   PubMed Web of Science ®Google Scholar
• Francis , RL , McGinnis , LF and White , JA . 1983 . Locational analysis . Eur. J. Oper. Res. , 12 : 220 – 252 .
   Web of Science ®Google Scholar
• Galvao , RD and Raggi , LA . 1989 . A method for solving to optimality uncapacitated location problems . Ann. Oper. Res. , 18 : 225 – 244 .
   Google Scholar
• Gao , LL and Robinson , E . 1994a . Uncapacitated facility location: general solution procedure and computational experience . Eur. J. Oper. Res. , 76 : 410 – 427 .
   Web of Science ®Google Scholar
• Ghosh , D . 2003 . Neighborhood search heuristics for the uncapacitated facility location problem . Eur. J. Oper. Res , (in press)
   Web of Science ®Google Scholar
• Goldengorin , B , Ghosh , D and Sierksma , G . 2003a . Branch and peg algorithms for the simple plant location problem . Comput. Oper. Res. , 30 : 967 – 981 .
   Web of Science ®Google Scholar
• Goldengorin , B , Tussen , GA and Sierksma , G . 2003b . Solving the simple plant location problem using a data correcting approach . J. glob. Optim. , 25 : 377 – 406 .
   Web of Science ®Google Scholar
• Guignard , MA . 1988 . Lagrangean dual ascent algorithm for simple plant location problems . Eur. J. Oper. Res. , 35 : 193 – 200 .
   Web of Science ®Google Scholar
• Hertz , A and Kobler , D . 2000 . A framework for the description of evolutionary algorithms . Eur. J. Oper. Res. , 126 : 1 – 12 .
   Web of Science ®Google Scholar
• Jaramillo , HJ , Bhadury , J and Batta , R . 2002 . On the use of genetic algorithms to solve location problems . Comput. Oper. Res. , 29 : 761 – 779 .
   Web of Science ®Google Scholar
• Kirkpatrick , S , Gelatt , JR and Vecchi , CD . 1983 . Optimization by simulated annealing . Science , 220 : 671 – 680 .
   PubMed Web of Science ®Google Scholar
• Klose , A . 1998 . A branch and bound algorithm for an uncapacitated facility location problem with a side constraint . Int. Trans. Oper. Res. , 5 : 155 – 168 .
   Google Scholar
• Koerkel , M . 1989 . On the exact solution of large-scale simple plant location problems . Eur. J. Oper. Res. , 39 : 157 – 173 .
   Web of Science ®Google Scholar
• Kolonko , M . 1999 . Some new results on simulated annealing applied to job shop scheduling problem . Eur. J. Oper. Res. , 113 : 123 – 136 .
   Web of Science ®Google Scholar
• Korupolu , MR and Plaxton , CG . 2000 . Analysis of a local search heuristic for facility location problems . J. Algorithms , 37 : 146 – 188 .
   Web of Science ®Google Scholar
• Krarup , J and Pruzan , PM . 1983 . The simple plant location problem: survey and synthesis . Eur. J. Oper. Res. , 12 : 36 – 81 .
   Web of Science ®Google Scholar
• Kratica , J , Tosic , D , Filipovic , V and Ljubic , I . 2001 . Solving the simple plant location problem by genetic algorithms . RAIRO—Oper. Res. , 35 : 127 – 142 .
   Web of Science ®Google Scholar
• Laurent , M and Hentenryck , PV . 2004 . A simple tabu search for warehouse location . Eur. J. Oper. Res. , 157 : 576 – 591 .
   Web of Science ®Google Scholar
• Ma , J , Tian , P and Zhang , D . 2000 . Global optimization by Darwin and Boltzmann mixed strategy . Comput. Oper. Res. , 27 : 143 – 159 .
   Web of Science ®Google Scholar
• Mirchandani , PB and Francis , RL . 1990 . Discrete Location Theory , 119 – 171 . New York : Wiley .
   Google Scholar
• Moilanen , A . 2001 . Simulated evolutionary optimization and local search: introduction and application to tree search . Cladistics , 17 : 12 – 25 .
   Web of Science ®Google Scholar
• Reeves , C . 1993 . Modern Heuristic Techniques for Combinatorial Problems , New York : Wiley .
   Google Scholar
• Simao , HP and Thizy , JM . 1989 . A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem . Oper. Res. Lett. , 8 : 279 – 286 .
   Web of Science ®Google Scholar
• Tian , P , Jian Ma and Dong-Ma Zhang . 1999 . Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: an investigation of generation mechanism . Eur. J. Oper. Res. , 118 : 81 – 94 .
   Web of Science ®Google Scholar
• Vaithyanathan , S , Burke , L and Magent , MA . 1996 . Massively parallel analog tabu search using neural networks applied to simple plant location problem . Eur. J. Oper. Res. , 93 : 317 – 330 .
   Web of Science ®Google Scholar
• Wong , SYW . 2001 . Hybrid simulated annealing/genetic algorithm approach to short term hydro-thermal scheduling with multiple thermal plants . Electric. Power Energy Syst. , 23 : 565 – 575 .
   Web of Science ®Google Scholar