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

International Journal of Production Research

Volumn 42, Issue 3, 2004, Pages 473-491

  Onwubolu, G C ^a   Clerc, M ^b  

^a UNIVERSITY OF THE SOUTH PACIFIC   (Fiji)

^b ORANGE LABS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CONTROL SYSTEMS; COSTS; HEURISTIC PROGRAMMING; NUMERICAL CONTROL SYSTEMS; OPERATIONS RESEARCH; PROBLEM SOLVING;

AUTOMATED DRILLING; MANUFACTURING SYSTEMS; PRODUCTION COSTS; PRODUCTION TIME;

TRAVELING SALESMAN PROBLEM;

EID: 1342287329     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540310001614150     Document Type: Article

References (31)

1. Angeline, P. J., 1998, Using selection to improve particle swarm optimization. IEEE International Conference on Evolutionary Computation, Anchorage, Alaska, May, pp. 4-9.
2. Carlisle, A. and 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.
3. 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.
4. Clerc, M., 2002, Think locally, act locally: a framework for adaptive particle swarm optimizers. IEEE Journal of Evolutionary Computation (submitted).
5. 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.
6. 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.
7. 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.
8. Durbin, R. and Willshaw, D., 1987, An analogue approach to the traveling salesman problem using an elastic net method. Nature, 326, 689-691.
9. Eberhart, R. C. and 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.
10. Fogel, D. B., 1993, Applying evolutionary programming to selected traveling salesman problem. Cybernetic System: International Journal, 24, 27-36.
11. Glover, F., 1989, Tabu search - Part I. ORSA Journal of Computing, 1, 190-206.
12. Glover, F., 1990, Tabu search - Part II. ORSA Journal of Computing, 2, 4-32.
13. Goldberg, D. E., 1989, Genetic Algorithms in Search, Optimization, and Machine Learning (Reading, MA: Addison-Wesley).
14. Gutin, G. and Punen, A. P. (eds), 2002, The Traveling Salesman Problem and its Variants (Dordrecht: Kluwer).
15. He, Z. and 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.
16. Jünger, M., Reinelt, G. and 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, Volume 7 (Amsterdam: Elsevier), pp. 225-330.
17. 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.
18. 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.
19. 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.
20. Kennedy, J. and Eberhart, R. C., 1995, Particle swarm optimization. IEEE Proceedings of the International Conference on Neural Networks IV, Perth, Australia (Piscataway: IEEE Service Center), pp. 1942-1948.
21. Kennedy, J. and Eberhart, R. C., 1997, A discrete binary version of the particle swarm algorithm. International Conference on Systems, Man, and Cybernetics, (Piscataway: IEEE Service Center), pp. 4104-4109.
22. Kennedy, J. and Spears, W. M., 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.
23. Kirkpatrick, S., Gelatt, C. D. and Vechhi, M. P., 1983, Optimization by simulated annealing. Science, 220, 671-680.
24. 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.
25. Lawler, E. L., Lenstra, J. K., Rinnoy-Kan, A. G. H. and Shmoys, D. G. (eds), 1985, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Chichester: Wiley).
26. 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.
27. Onwubolu, G. C., 2002, Emerging Optimization Techniques in Production Planning & Control (London: Imperial College Press).
28. Onwubolu, G. C., 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.
29. Reinelt, G., 1994, The Traveling Salesman Problem: Computational Solutions for TSP Applications (Berlin: Springer).
30. Shi, Y. and Eberhart, R. C., 1998, A modified particle swarm optimizer. IEEE International Conference on Evolutionary Computation, Anchorage, Alaska, May, pp. 4-9.
31. Whitely, D., Starkweather, T. and Fuquay, D., 1989, Scheduling problems and traveling salesman: the genetic edge recombination operators. Proceedings of the 3rd International Conference on Genetic Algorithms, Palo Alto, CA (Morgan Kaufmann), pp. 133-140.