Diagnosis, Configuration, Planning, and Pathfinding: Experiments in Nature-Inspired Optimization

We present experimental results of applying various nature-inspired optimization techniques to real-world problems from the areas of diagnosis, configuration, planning, and pathfinding. The optimization techniques we investigate include the traditional Genetic Algorithm (GA), discrete (binary and integer-based) Particle Swarm Optimization (DPSO), relatively new Extremal Optimization (EO), and recently developed Raindrop Optimization (RO); all inspired by different aspects of the natural world. We present algorithm setup, issues with adapting the various optimization methods to the selected problems, and the emerging results produced by the methods.We consider the GA to be the baseline technique because of its robustness and widespread application. The major contribution of this chapter deals with the fact that DPSO, EO, and RO have never been applied to the majority of these selected problems, making this the first time most of these results have appeared in the literature.

[1]  Yun Peng,et al.  A Probabilistic Causal Model for Diagnostic Problem Solving Part II: Diagnostic Strategy , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[2]  Yun Peng,et al.  A Probabilistic Causal Model for Diagnostic Problem Solving Part I: Integrating Symbolic Causal Inference with Numeric Probabilistic Inference , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  Pedro A. Diaz-Gomez,et al.  The snake in the box problem: mathematical conjecture and a genetic algorithm approach , 2006, GECCO '06.

[4]  William H. Kautz,et al.  Unit-Distance Error-Checking Codes , 1958, IRE Trans. Electron. Comput..

[5]  Victor Klee,et al.  What is the Maximum Length of a d-Dimensional Snake? , 1970 .

[6]  John A. Miller,et al.  Improving the reliability of heuristic multiple fault diagnosis via the EC-based Genetic Algorithm , 1992, Applied Intelligence.

[7]  Pedro A. Diaz-Gomez,et al.  Genetic Algorithms for Hunting Snakes in Hypercubes: Fitness Function Analysis and Open Questions , 2006, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06).

[8]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[10]  Bak,et al.  Punctuated equilibrium and criticality in a simple model of evolution. , 1993, Physical review letters.

[11]  P. Bettinger,et al.  Spatial forest planning: To adopt, or not to adopt? , 2003 .

[12]  Jianping Zhu,et al.  A New Heuristic Method for Solving Spatially Constrained Forest Planning Problems Based on Mitigation of Infeasibilities Radiating Outward from a Forced Choice , 2006 .

[13]  Eric Drucker,et al.  Genetic Algorithm, Extremal Optimization, and Particle Swarm Optimization Applied to the Discrete Network Configuration Problem , 2008, GEM.

[14]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[15]  W. D. Potter,et al.  IDA-NET: an intelligent decision aid for battlefield communications network configuration , 1992, Proceedings Eighth Conference on Artificial Intelligence for Applications.

[16]  Jianping Zhu,et al.  Additional insight into the performance of a new heuristic for solving spatially constrained forest planning problems , 2007 .

[17]  Pete Bettinger,et al.  The Key Literature of, and Trends in, Forest-Level Management Planning in North America, 1950–2001 , 2004 .

[18]  Walter D. Potter,et al.  Improving the reliability of heuristic diagnosis , 1991, Conference Proceedings 1991 IEEE International Conference on Systems, Man, and Cybernetics.

[19]  F. Harary,et al.  A survey of the theory of hypercube graphs , 1988 .

[20]  Alcherio Martinoli,et al.  Discrete Multi-Valued Particle Swarm Optimization , 2006 .

[21]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[22]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[23]  Pedro Paglione,et al.  New Stochastic Algorithm for Design Optimization , 2003 .

[24]  Walter D. Potter,et al.  A Genetic Algorithm Approach to Solving the Battlefield Communication Network Configuration Problem , 1995 .

[25]  James A. Reggia,et al.  Diagnostic Expert Systems Based on a Set Covering Model , 1983, Int. J. Man Mach. Stud..

[26]  G. E. Liepins,et al.  A Genetic Algorithm Approach to Multiple-Fault Diagnosis , 1991 .

[27]  Walter D. Potter,et al.  Searching for Snake-In-The-Box Codes With Evolved Pruning Models , 2007, GEM.

[28]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[29]  Stefan Boettcher,et al.  Extremal Optimization , 1999 .

[30]  Stefan Boettcher,et al.  Extremal Optimization for Graph Partitioning , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .