A logistic process scheduling problem: Genetic algorithms or ant colony optimization?

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 38, Issue 1, 2005, Pages 206-211

  Silva, C A ^a   Sousa, J M ^a   Runkler, T ^b   Sa Da Costa J M G ^a  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b SIEMENS AG   (Germany)

Author keywords

Ant colony optimization; Genetic algorithms

Indexed keywords

GENETIC ALGORITHMS; SCHEDULING;

ANT COLONIES; BENCH-MARK PROBLEMS; COMPARISON RESULT; LITERATURE REVIEWS; LITERATURE SURVEY; LOGISTIC PROCESS; LOGISTIC SCHEDULING; OPTIMIZATION TECHNIQUES;

ANT COLONY OPTIMIZATION;

EID: 79960729723     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20050703-6-cz-1902.01518     Document Type: Conference Paper

References (21)

1. Barbuceanu, M. and M. Fox (1996). Coordinating multiple agents in the supply chain. In: Proceedings of the Fifth Workshops on Enabling Technology for Collaborative Enterprises, WET ICE'96. IEEE Computer Society Press. pp. 134-141.
2. th Metaheuristics International Conference.
3. Bäysy, Olli (1999). A new algorithm for the vehicle routing problem with time windows based on the hybridization of a genetic algorithm and route construction heuristics. In: Proceedings of the Univeristy of Vaasa, Research papers 227.
4. Caro, Gianni Di and Marco Dorigo (1998). Antnet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research 9, 317-365.
5. Choi, In-Chan, Seong-In Kim and Hak-Soo Kim (2003). A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem. Computers & Operations Research 30, 773-786.
6. Dorigo, Marco, Vittorio Maniezzo and Alberto Colorni (1996). The Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics 26(1), 29-41.
7. Fleurent, C. and J. A. Ferlan (1994). Quadratic assignment and related problems. Chap. Genetic hybrids for the quadratic assignment problem, pp. 173-187. Vol. 16. American Mathematical Society.
8. Gagn, C., W. L. Price and M. Gravel (2002). Comparing an aco algorithm with other heuristics for the single machine scheduling problem with sequence dependent setup times. Journal of the Operational Research Society 53, 895-906.
9. Gambardella, Luca Maria, Éric Taillard and Giovanni Agazzi (1999). MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In: New Ideas in Optimization (David Corne, Marco Dorigo and Fred Glover, Eds.). pp. 63-76. McGraw-Hill.
10. Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. The University of Michigan Press.
11. Jain, A. S. and S. Meeran (1999). Deterministic jobshop scheduling: past, present and future. European Journal of Operational Research 113, 390- 434.
12. Lim, M. H., Y. Yuan and S. Omatu (2000). Efficient genetic algorithm using simple genes exchange local search policy for the quadratic assignment problem. Computational Optimization and Applications 15, 249-268.
13. Merz, Peter and Bernd Freisleben (1997). Genetic local search for the TSP: New results. In: IEEECEP: Proceedings of The IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence.
14. Ross, Sheldon M. (1996). Stochastic Processes. 2nd edition. John Wiley & Sons, Inc. New York.
15. Rubin, P. A. and G. L. Ragatz (1995). Scheduling in a sequence dependent setup environment with genetic search. Computers and Operations Research 22(2), 85-99.
16. Silva, C. A., T. A. Runkler, J. M. Sousa and J. M. Sá da Costa (2003). Optimization of logistic processes in supply-chains using meta-heuristics. In: LNAI 2902, Progress in Artificial Intelligence (Fernando Moura Pires and Salvador Abreu, Eds.). pp. 9-23. Springer Verlag. Berlin Heidelberg.
17. Silva, C. A., J. M. Sousa, T. A. Runkler and J. Sá da Costa (2004). A multi-agent approach for supply chain management using ant colony optimization. In: Proceedings of the IEEE SMC 2004, International Conference on Systems, Man and Cybernetics. pp. 1938-1943.
18. Silva, Carlos A. (2001). Arbeitspaket S1: Systemanalyse - Fujitsu Siemens Computers. Technical Report 1. Siemens AG, Corporate Technology, Department of Neural Computation, CT IC-4.
19. Stützle, Thomas and Marco Dorigo (1999a). Evolutionary Algorithms in Engineering and Computer Science:Recent Advances in Genetic Algorithms, Evolution Strategies, Evolutionary Programming, Genetic Programming and Industrial Applications. Chap. ACO Algorithms for the Traveling Salesman Problem, p. 163-183. John Wiley & Sons.
20. Stützle, Thomas and Marco Dorigo (1999b). New Ideas in Optimization. Chap. ACO Algorithms for the Quadratic Assignment Problem. Mc-GrawHill.
21. Tsai, H.-K., J.-M. Yang, Y.-F. Tsai and C.-Y. Kao (2003). Some issues of designing genetic algorithms for traveling salesman problems. Soft Computing - A Fusion of Foundations, Methodologies and Applications, Springer Verlag.