Amplification of search performance through randomization of heuristics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2470, Issue , 2002, Pages 124-138

  Cicirello, Vincent A ^a   Smith, Stephen F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; HEURISTIC ALGORITHMS; SCHEDULING; STOCHASTIC SYSTEMS;

DISCRIMINATORY POWER; HEURISTIC SOLUTIONS; PROBLEM INSTANCES; SCHEDULING PROBLEM; SEARCH HEURISTICS; SEARCH PERFORMANCE; STATE OF THE ART; WEIGHTED TARDINESS SCHEDULING;

RANDOM PROCESSES;

EID: 84957036158     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_9     Document Type: Conference Paper

References (13)

1. E. Bonabeau, M. Dorigo, and G. Theraulaz. Swarm Intelligence: From Natural to Artificial Systems. Santa Fe Institute Studies in the Sciences of Complexity. OxfordU niversity Press, 1999.
2. J. L. Bresina. Heuristic-biasedst ochastic sampling. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, Volume One, pages 271–278. AAAI Press, 1996
3. A. Cesta, A. Oddi, and S. F. Smith. An iterative sampling procedure for resource constrained project scheduling with time windows. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 1022–1029. Morgan Kaufmann, 1999.
4. T. H. Cormen, C. E. Leiserson and R L. Rivest. Introduction to Algorithms. McGraw-Hill, 1990.
5. M. Dorigo and G. Di Caro. The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, andF. Glover, editors, New Ideas in Optimization. McGraw- Hill, 1999.
6. C. Gomes, B. Selman, andH. Kautz. Boosting combinatorial search through randomization. In Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, pages 431–437. AAAI Press, 1998.
7. W. Harvey and M. Ginsberg. Limited discrepency search. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 607– 613. Morgan Kaufmann, 1995.
8. Y. H. Lee, K. Bhaskaran, and M. Pinedo. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions, 29:45–52, 1997
9. T. E. Morton and D.W. Pentico. Heuristic Scheduling Systems: With Applications to Production Systems and Project Management. John Wiley andS ons, 1993.
10. A. Oddi and S. F. Smith. Stochastic procedures for generating feasible schedules. In Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, pages 308–314. AAAI Press, 1997.
11. G. Theraulaz, S. Goss, J. Gervet, andJ. L. Deneubourg. Task differentiation in polistes wasp colonies: A model for self-organizing groups of robots. In From Animals to Animats: Proceedings of the First International Conference on Simulation of Adaptive Behavior, pages 346–355. MIT Press, 1991.
12. T. Walsh. Depth-bounded discrepency search. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, 1997.
13. J. P. Watson, L. Barbulescu, A. E. Howe, andL.D. Whitley. Algorithm performance andpro blem structure for flow-shop scheduling. In Proceedings, Sixteenth National Conference on Artificial Intelligence (AAAI-99), Eleventh Innovative Applications of Artificial Intelligence Conference (IAAI-99), pages 688–695. AAAI Press, 1999.