512
Views
127
CrossRef citations to date
0
Altmetric
Original Articles

Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization

&
Pages 473-491 | Published online: 21 Feb 2007

References

References

  • Angeline PJ 1998 Using selection to improve particle swarm optimization IEEE International Conference on Evolutionary Computation Anchorage Alaska May pp. 4–9
  • Carlisle A Dozier G 1998 Adapting particle swarm optimization to dynamics environments Proceedings of the International Conference on Artificial Intelligence Monte Carlo Resort Las Vegas NV USA
  • Clerc M 1999 The swarm and the queen: towards a deterministic and adaptive particle swarm optimization Proceedings of the Congress on Evolutionary Computation Washington DC Piscataway: IEEE Service Center pp. 1951–1957
  • Clerc M 2002 Think locally, act locally: a framework for adaptive particle swarm optimizers IEEE Journal of Evolutionary Computation (submitted)
  • Clerc , M and Kennedy , J . 2002 . The particle swarm: explosion, stability, and convergence in a multidimensional complex space . IEEE Transactions on Evolutionary Computation , 6 : 58 – 73 .
  • Dorigo M 1992 Ottimizzazione, aprendimento automatico, et algoritmi basati su metafora naturale [Optimisation, learning and natural algorithms] PhD dissertation Dipartimento Elettronica e Informazione Politecnico di Milano Italy
  • Dorigo , M and Gambardella , L . 1997 . Ant colony system: a cooperative learning approach to the traveling salesman problem . IEEE Transactions on Evolutionary Computation , 1 : 53 – 66 .
  • Durbin , R and Willshaw , D . 1987 . An analogue approach to the traveling salesman problem using an elastic net method . Nature , 326 : 689 – 691 .
  • Eberhart RC Kennedy J 1995 A new optimizer using particle swarm theory Proceedings of the 6th International Symposium on Micro Machine and Human Science Nagoya Japan Piscataway: IEEE Service Center pp. 39–43
  • Fogel , DB . 1993 . Applying evolutionary programming to selected traveling salesman problem . Cybernetic System: International Journal , 24 : 27 – 36 .
  • Glover , F . 1989 . Tabu search—Part I . ORSA Journal of Computing , 1 : 190 – 206 .
  • Glover , F . 1990 . Tabu search—Part II . ORSA Journal of Computing , 2 : 4 – 32 .
  • Goldberg DE 1989 Genetic Algorithms in Search, Optimization, and Machine Learning Reading MA Addison-Wesley
  • Gutin G Punen AP (eds) 2002 The Traveling Salesman Problem and its Variants Dordrecht Kluwer
  • He Z Wei C 1999 A new population-based incremental learning method for the traveling salesman problem Congress on Evolutionary Computation Washington DC Piscataway: IEEE Service Center pp. 1152–1156
  • Jünger M Reinelt G Rinaldi G 1995 The traveling salesman problem In M. O. Ball, T. Magnanti, C. L. Monma and G. Nemhauser (eds) Handbooks in Operations Research and Management Science 7 Amsterdam Elsevier pp. 225–330
  • Kennedy J 1997 The particle swarm: social adaptation of knowledge IEEE International Conference on Evolutionary Computation, Indianapolis IA Piscataway: IEEE Service Center pp. 303–308
  • Kennedy J 1999 Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance Proceedings of the Congress on Evolutionary Computation Washington DC Piscataway: IEEE Service Center pp. 1931–1938
  • Kennedy J Steriotyping: improving particle swarm performance with cluster analysis Proceedings of the 2000 Congress on Evolutionary Computation Piscataway NJ USA IEEE Service Center 1507 1512
  • Kennedy J Eberhart RC 1995 Particle swarm optimization IEEE Proceedings of the International Conference on Neural Networks IV Perth Australia Piscataway: IEEE Service Center pp. 1942–1948
  • Kennedy J Eberhart RC 1997 A discrete binary version of the particle swarm algorithm International Conference on Systems, Man, and Cybernetics Piscataway IEEE Service Center pp. 4104–4109
  • Kennedy J Spears WM 1998 Matching algorithms to problems: an experimental test of the particle swarm and some genetic algorithms on the multimodal problem generator Proceedings of the IEEE International Conference on Evolutionary Computation Anchorage Alaska USA Piscataway: IEEE Service Center pp. 78–83
  • Kirkpatrick , S , Gelatt , CD and Vechhi , MP . 1983 . Optimization by simulated annealing . Science , 220 : 671 – 680 .
  • Kohonen T 1981 Automatic formation of topological maps of patterns in a self-organizing system Proceedings of the 2nd Scandinavian Conference on Image Analysis Espoo Pattern Recognition Society of Finland pp. 214–220
  • Lawler EL Lenstra JK Rinnoy-Kan AGH Shmoys DG (eds) 1985 The Traveling Salesman Problem:A Guided Tour of Combinatorial Optimization Chichester Wiley
  • Lin , F-T , Kao , C-Y and Hsu , C-C . 1993 . Applying the genetic approach to simulated annealing in solving some NP-hard problems . IEEE Transaction Systems, Man, Cybernetics , 23 : 1752 – 1767 .
  • Onwubolu GC 2002 Emerging Optimization Techniques in Production Planning & Control London Imperial College Press
  • Onwubolu , GC , Aborhey , S , Singh , R , Reddy , H , Prasad , M , Kumar , S and Singh , S . 2002 . Development of a PC-based computer numerical control drilling machine . Journal of Engineering Manufacture, Short Communications in Manufacture and Design , 26 ( B11 ) : 1509 – 1515 .
  • Reinelt G 1994 The Traveling Salesman Problem: Computational Solutions for TSP Applications Berlin Springer
  • Shi Y Eberhart RC 1998 A modified particle swarm optimizer IEEE International Conference on Evolutionary Computation Anchorage Alaska May pp. 4–9
  • Whitely D Starkweather T Fuquay D 1989 Scheduling problems and traveling salesman: the genetic edge recombination operator Proceedings of the 3rd International Conference on Genetic Algorithms Palo Alto CA (Morgan Kaufmann) pp. 133–140

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.