Abstract
We propose a self-adaptive Ant Colony Optimization (AD-ACO) approach that exploits a parameter adaptation mechanism to reduce the requirement of a preliminary parameter tuning. The proposed AD-ACO is based on an ACO algorithm adopting a pheromone model with a new global pheromone update mechanism. We applied this algorithm to the single machine total weighted tardiness scheduling problem with sequence-dependent setup times and we executed an experimental campaign on a benchmark available in literature. Results, compared with the ones produced by the ACO algorithm without adaptation mechanism and with those obtained by recently proposed metaheuristic algorithms for the same problem, highlight the quality of the proposed approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Dorigo, M.: Optimization, learning and natural algorithms (in Italian). PhD Thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy (1992)
Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)
Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann Publishers, San Francisco (2001)
Stützle, T., Hoos, H.H.: Max-min ant system. Future Generation Computer System 16, 889–914 (2000)
Anghinolfi, D., Paolucci, M.: A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem. International Journal of Operations Research 5(1), 1–17 (2008)
Cicirello, V.A.: Weighted tardiness scheduling with sequence-dependent setups: a benchmark library. Technical Report. Intelligent Coordination and Logistics Laboratory. Robotics Institute. Carnegie Mellon University, USA (2003)
Lawler, E.L.: A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1, 331–342 (1997)
Lee, Y.H., Bhaskaran, K., Pinedo, M.: A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transaction 29, 45–52 (1997)
Cicirello, V.A., Smith, S.F.: Enhancing stochastic search performance by value-based randomization of heuristics. Journal of Heuristics 11, 5–34 (2005)
Cicirello, V.A.: Non-Wrapping Order Crossover: An Order Preserving Crossover Operator that Respects Absolute Position. In: Proceedings of GECCO 2006 Conference, Seattle, WA, USA, pp. 1125–1131 (2006)
Lin, S.-W., Ying, K.-C.: Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics. The International Journal of Advanced Manufacturing Technology (2006)
Liao, C.-J., Juan, H.C.: An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Computers & Operations Research 34, 1899–1909 (2007)
Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1, 53–66 (1997)
Tasgetiren, M.F., Sevkli, M., Liang, Y.-C., Gencyilmaz, G.: Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceedings of the 2004 Congress on Evolutionary Computation (CEC 2004), Portland, Oregon, pp. 1412–1419 (2004)
Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs (1995)
Anghinolfi, D., Paolucci, M.: A new discrete particle swarm optimization approach for the total tardiness scheduling problem. European Journal of Operational Research (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anghinolfi, D., Boccalatte, A., Paolucci, M., Vecchiola, C. (2008). Performance Evaluation of an Adaptive Ant Colony Optimization Applied to Single Machine Scheduling. In: Li, X., et al. Simulated Evolution and Learning. SEAL 2008. Lecture Notes in Computer Science, vol 5361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89694-4_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-89694-4_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89693-7
Online ISBN: 978-3-540-89694-4
eBook Packages: Computer ScienceComputer Science (R0)