Search intensity versus search diversity: A false trade off?

Applied Intelligence

Volumn 32, Issue 3, 2010, Pages 279-291

  Linhares, Alexandre ^a,b,c   Yanasse, Horacio Hideki ^b  

^a FUNDAÇÃO GETÚLIO VARGAS   (Brazil)

^b INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

^c Rämistrasse 18 8001   (Switzerland)

Author keywords

Combinatorial optimization; Coordination policies; Distance metrics; Modern heuristics; Search methods

Indexed keywords

COORDINATION POLICIES; DISTANCE METRICS; GENETIC OPERATORS; LOCAL SEARCH; META HEURISTICS; MODERN HEURISTICS; PARALLEL SYSTEM; SEARCH HEURISTICS; SEARCH INTENSITY; SEARCH METHOD; SEARCH PROCESS; SOLUTION METHODS; SPECIFIC AREAS; SPECIFIC PROBLEMS; TRADE OFF;

COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; MATHEMATICAL OPERATORS; SIMULATED ANNEALING;

TABU SEARCH;

EID: 77952009412     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-008-0145-8     Document Type: Article

References (45)

1. van Laarhoven PMJ, Aarts EHL (1988) Simulated annealing: theory and applications. Kluwer Academic, Norwell
2. JCW Debuse VJ Rayward-Smith 1999 Discretisation of continuous database features for a simulated annealing data mining algorithm Appl Intell 11 285 295 10.1023/A:1008339026836 (Pubitemid 30517151)
3. N Ansari R Sarasa GS Wang 1993 An efficient annealing algorithm for global optimization in Boltzmann machines Appl Intell 3 177 192 10.1007/BF00871936
4. BM Ombuki M Ventresca 2004 Local search genetic algorithms for the job-shop scheduling problem Appl Intell 21 99 109 1078.68597 10.1023/B:APIN.0000027769.48098.91
5. S Ghosh A Ghosh SK Pal 2003 Incorporating ancestors' influence in genetic algorithms Appl Intell 18 7 25 1056.68117 10.1023/A:1020955300403
6. A Mendes A Linhares 2004 A multiple population evolutionary approach to gate matrix layout Int J Syst Sci 35 13 23 1067.94595 10.1080/ 00207720310001657054
7. Beasley JE (2000) Population heuristics. In: Pardalos PM, Resende MGC (eds) Handbook of applied optimization. Oxford University Press, London
8. Goldberg DE, Richardon J (1987) Genetic algorithms with sharing for multimodal function optimization. In: Grefenstette JJ (ed) Genetic algorithms and their applications (ICGA'87). Lawrence Erlbaum Associates, Hillsdale, pp 41-49
9. Ursem RK (2001) When sharing fails. In: Proc. of the third congress on evolutionary computation, pp 873-879
10. Ursem RK (2002) Diversity-guided evolutionary algorithms. In: Proc. of parallel problem solving from nature VII, pp 462-471
11. F Glover 1989 Tabu search-Part I ORSA J Comput 1 190 206 0753.90054 1043673
12. Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Dordrecht
13. M Laguna JW Barnes F Glover 1993 Intelligent scheduling with tabu search-an application to jobs with linear delay penalties and sequence-dependent setup costs and times Appl Intell 3 159 172 10.1007/BF00871895
14. F Glover 1977 Heuristics for integer programming using surrogate constraints Decis Sci 8 156 166 10.1111/j.1540-5915.1977.tb01074.x
15. Cung V-D, Mautor T, Michelon P, Tavares A (1997) A scatter search based approach for the quadratic assignment problem. In: Proc of the IEEE international conference on evolutionary computation, pp 165-170
16. A Linhares JRA Torreão 1988 Microcanonical optimization applied to the traveling salesman problem Int J Mod Phys C 9 133 146 10.1142/ S012918319800011X
17. A Linhares HH Yanasse JRA Torreão 1999 Linear gate assignment: a fast statistical mechanics approach IEEE Trans Comput-Aided Des Integr Circuits Syst 18 1750 1758 10.1109/43.811324 (Pubitemid 30564908)
18. TA Feo MGC Resende 1995 Greedy randomized adaptive search procedures J Glob Optim 6 109 133 0822.90110 10.1007/BF01096763 1322875
19. MF Argüello JF Bard G Yu 1997 A GRASP for aircraft routing in response to groundings and delays J Combin Optim 1 211 228 0892.90122 10.1023/A:1009772208981
20. MGC Resende CC Ribeiro 1997 A GRASP for graph planarization Networks 29 173 189 0885.90112 10.1002/(SICI)1097-0037(199705)29:3<173::AID-NET5>3.0. CO;2-E (Pubitemid 127054700)
21. PG Backhouse AF Fotheringham G Allan 1997 A comparison of a genetic algorithm with an experimental design technique in the optimization of a production process J Oper Res Soc 48 247 254 0890.90076
22. K Dowsland 1996 Genetic algorithms: a tool for OR? J Oper Res Soc 47 550 561 0864.90103
23. M Laguna F Glover 1993 Bandwidth packing: a tabu search approach Manag Sci 39 492 500 0774.90033 10.1287/mnsc.39.4.492
24. Y Rochat ED Taillard 1995 Probabilistic intensification and diversification in local search for vehicle routing J Heuristics 1 147 167 0857.90032 10.1007/BF02430370
25. Jain AS (1998) A multi-level hybrid framework for the deterministic job-shop scheduling problem, PhD thesis, University of Dundee, Dundee, Scotland, UK
26. F Glover 1990 Tabu search: a tutorial INTERFACES 20 74 94 10.1287/inte.20.4.74
27. A Colorni M Dorigo F Maffioli V Manniezzo G Righini M Trubian 1996 Heuristics from nature for hard combinatorial optimization problems Int Trans Oper Res 3 1 21 0863.90120 10.1111/j.1475-3995.1996.tb00032.x
28. Christofides N (1994) The bionomic algorithm. In: Proc of the associazione Italiana di ricerca operativa conference, Savona, Italy
29. V Maniezzo A Mingozzi R Baldacci 1998 A bionomic approach to the capacitated p-median problem J Heuristics 4 263 280 0913.90201 10.1023/A:1009665717611
30. Jones T (1995) One operator, one landscape. Santa Fe Institute Technical Report 95-02-025. Santa Fe Institute, Santa Fe, NM 87501
31. KD Boese AB Kahng S Muddu 1994 A new adaptive multi-start technique for combinatorial global optimizations Oper Res Lett 16 101 113 0812.90126 10.1016/0167-6377(94)90065-5 1301749
32. Merz P, Freisleben B (1999) Fitness landscapes and memetic algorithm design. In: Corne D, Glover F, Dorigo M (eds) New ideas in optimization. McGraw-Hill, New York
33. CR Reeves 1999 Landscapes, operators, and heuristic search Ann Oper Res 86 473 490 0921.90095 10.1023/A:1018983524911 1683466
34. A Mendes P França P Moscato 2002 Fitness landscapes for the total tardiness single machine scheduling problem Neural Netw World 2 165 180
35. K-T Mak AJ Morton 1995 Distances between traveling salesman tours Discrete Appl Math 58 281 291 0835.90113 10.1016/0166-218X(93)E0115-F 1326051
36. A Caprara 1999 Sorting permutations by reversals and Eulerian cycle decompositions SIAM J Discrete Math 12 91 110 0916.68074 10.1137/ S089548019731994X 1666069
37. A Linhares 2004 The structure of local search diversity WSEAS Trans Math 3 216 220
38. Linhares A (2001) Industrial pattern-sequencing problems: some complexity results and new local search models. PhD thesis, National Institute of Space Research, São José dos Campos, Brazil
39. M Jelasitya J Dombib 1998 GAS, a concept on modeling species in genetic algorithms Artif Intell 99 1 19 10.1016/S0004-3702(97)00071-4
40. A Linhares 2004 Minimization of open orders: a re-distribution coordination policy Int J Prod Res 42 1189 1205 1175.90043 10.1080/ 00207540310001622421
41. Knuth D (1975) The art of computer programming, vol. 3. Sorting and searching. Addison-Wesley, New York
42. M Aigner DB West 1987 Sorting by insertion of leading elements J Combin Theory Ser A 45 306 309 0633.68060 10.1016/0097-3165(87)90022-7 894826
43. Chen S, Smith SF (1996) Commonality and genetic algorithms. The Robotics Institute CMU-RI-TR-96-27, Carnegie Mellon University
44. M Orlowski M Pachter 1989 An algorithm for the determination of a longest increasing subsequence in a sequence Comput Math Appl 17 1073 1075 0671.05002 10.1016/0898-1221(89)90036-9 991883
45. A Linhares HH Yanasse 2002 Connections between cutting-pattern sequencing, VLSI desing, and flexible machines Comput Oper Res 29 1759 1772 10.1016/S0305-0548(01)00054-5 (Pubitemid 34593114)