Characterizing search spaces for tabu search and including adaptive memory into a genetic algorithm

Journal of the Chinese Institute of Industrial Engineers

Volumn 17, Issue 5, 2000, Pages 527-536

  Joines, Jeffrey A ^a   Houck, Christopher R ^a   Kay, Michael G ^a  

^a North Carolina State University   (United States)

Author keywords

Adaptive Memory GA; Hybrid GA; Tabu Search

Indexed keywords

EID: 84869042285     PISSN: 10170669     EISSN: 21517606     Source Type: Journal    
DOI: 10.1080/10170669.2000.10432873     Document Type: Article

References (23)

1. E., Aarts, P., van Laarhove, J., Lenstra, and N., Ulder. 1994. A computational study of local search algoriths for job shop scheduling. ORSA Journal of computing, 6(2):118–125.
2. R., Battiti, and G., Tecchiolli. 1994. Simulated annealing and tabu search in the long run:a comparison on qap tasks. Comp. Math Appl.
3. R., Burkard, S., Karisch, and F., Rendl. 1991. Qapliba quadratic assignment problem library. EJOR, 55:115–119.
4. L., Cooper. 1963. Location-allocation problems. Operations Research, 11:331–343.
5. L., Cooper. 1972. The transportation-location problems. Operations Research, 20:94–108.
6. M.S., Daskin, and P.C., Jones. 1993. A new approach to solving applied location/allocation problems. Microcomputers in Civil Eng., 8:409–421.
7. M., Dell'Amico, and M., Trubian. 1993. Applying tabu search to the job-shop scheduling problem. Annals of Operations Research, 41:231–252.
8. R., Francis, and J., White. 1974. “ Facility Layout and Location ”. In An Analytical Approach, New Jersey:Prentice Hall.
9. F., Glover, J., Kelly, and M., Laguna. 1995. Genetic algorithms and tabu search:Hybrids for Optimization. Comp. & OR, 22(1):111–134.
10. F., Glover, and M., Laguna. 1997. Tabu Search, Boston:Kluwer.
11. C.R., Houck, J.A., Joines, and M.G., Kay. 1997. Empirical investigation of the benefits of partial lamarckianism. Evolutionary Computation, 5(1):31–60.
12. C.R., Houck, J.A., Joines, and M.G., Kay. 1996. Comparison of genetic algorithms, random restart, and two-opt switching for solving large location-allocation problems. Comp. & OR, 23(6):587–596.
13. M., Locatelti, and F., Schoen. 1999. Random linkage:A family of acceptance/rejection algorithms for global optimiziition. Mathematical Programming, 85(2):379–396.
14. R., Love, J.G., Morris, and G.O., Wesoloshy. 1988. Facilities Location:Models & Methods. North-Holland, New York
15. R. F., Lovc, and H., Juel. 1982. Properties and solution methods for large location-allocation problems with rectangular distances. Journal Operations Rerearch Society, 33:443–452.
16. R. F., Lovc, and J. G., Morris. 1975. A computational procedure for the exact solution of location-allocation problems with rectangular distances. Naval Res. Logistics Quartly, 22:441–453.
17. M., Malck, M., Guruswaym, and M., Pandya. 1989. Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Annals of OR, 21(1):59–83.
18. O., Martin, and S., Otto. 1996. Combining simulated annealing with local search heuristics. Annals of Operations Research
19. Z., Michalewicz. 1996. “ Genetic Algorithms + Data Structures = Evolution Programs ”. In AI Series, 3rd edition, New York:Springer-Verlag.
20. V., Nissen. 1994. Solving the quadratic assignment problem with clues from nature. IEEE Transactions on Neural Networks, 5(1):66–72.
21. Rinnooy, Kan, and G., Timmer. 1987. Stochastic global optimization methods part 1. Mathematical Programming, 39(1):27–56.
22. E. Taillard. 1991. Taboo search for the qap. Parallel Computing, 17:443–455.
23. A. A, Zhigljavsky. 1991. Theory of Gloval Random Search of Mathematics and Its Applications, volume 65, Boston:Kluwer.