Abstract
Ant colony optimisation (ACO), a constructive metaheuristic inspired by the foraging behaviour of ants, has frequently been applied to shop scheduling problems such as the job shop, in which a collection of operations (grouped into jobs) must be scheduled for processing on different machines. In typical ACO applications solutions are generated by constructing a permutation of the operations, from which a deterministic algorithm can generate the actual schedule. An alternative approach is to assign each machine one of a number of alternative dispatching rules to determine its individual processing order. This representation creates a substantially smaller search space biased towards good solutions. A previous study compared the two alternatives applied to a complex real-world instance and found that the new approach produced better solutions more quickly than the original. This paper considers its application to a wider set of standard benchmark job shop instances. More detailed analysis of the resultant search space reveals that, while it focuses on a smaller region of good solutions, it also excludes the optimal solution. Nevertheless, comparison of the performance of ACO algorithms using the different solution representations shows that, using this solution space, ACO can find better solutions than with the typical representation. Hence, it may offer a promising alternative for quickly generating good solutions to seed a local search procedure which can take those solutions to optimality.
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
Bauer, A., Bullnheimer, B., Hartl, R.F., Strauss, C.: Minimizing total tardiness on a single machine using ant colony optimization. Cent. Eur. J. Oper. Res. 8, 125–141 (2000)
Blum, C., Sampels, M.: An ant colony optimization algorithm for shop scheduling problems. J. Math. Model. Algorithms 3, 285–308 (2004)
Colorni, A., Dorigo, M., Maniezzo, V., Trubian, M.: Ant system for job-shop scheduling. JORBEL 34, 39–53 (1994)
Stützle, T.: An ant approach to the flow shop problem. In: EUFIT 1998. 6th European Congress on Intelligent Techniques & Soft Computing, Aachen, Germany, pp. 1560–1564. Verlag Mainz (1998)
Montgomery, J., Fayad, C., Petrovic, S.: Solution representation for job shop scheduling problems in ant colony optimisation. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 484–491. Springer, Heidelberg (2006)
Beasley, J.E.: OR-Library (2005), http://people.brunel.ac.uk/~mastjjb/jeb/info.html
van der Zwaan, S., Marques, C.: Ant colony optimisation for job shop scheduling. In: GAAL 1999. 3rd Workshop on Genetic Algorithms and Artificial Life (1999)
Montgomery, J., Randall, M., Hendtlass, T.: Structural advantages for ant colony optimisation inherent in permutation scheduling problems. In: Ali, M., Esposito, F. (eds.) IEA/AIE 2005. LNCS (LNAI), vol. 3533, pp. 218–228. Springer, Heidelberg (2005)
Montgomery, J., Randall, M., Hendtlass, T.: Solution bias in ant colony optimisation: Lessons for selecting pheromone models. Computers & Operations Research (in press), available online: doi:10.1016/j.cor.2006.12.014
Stützle, T., Hoos, H.: \(\mathcal{MAX-MIN}\) ant system. Future Gen. Comp. Sys. 16, 889–914 (2000)
Dorigo, M., Stützle, T.: The ant colony optimisation metaheuristic: Algorithms, applications and advances. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 57, pp. 251–285. Kluwer Academic Publishers, Boston, MA (2002)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Blum, C., Sampels, M.: Ant colony optimization for FOP shop scheduling: A case study on different pheromone representations. In: 2002 Congress on Evolutionary Computation, pp. 1558–1563 (2002)
Montgomery, J., Randall, M., Hendtlass, T.: Search bias in constructive metaheuristics and implications for ant colony optimisation. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 390–397. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Montgomery, J. (2007). Alternative Solution Representations for the Job Shop Scheduling Problem in Ant Colony Optimisation. In: Randall, M., Abbass, H.A., Wiles, J. (eds) Progress in Artificial Life. ACAL 2007. Lecture Notes in Computer Science(), vol 4828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76931-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-76931-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76930-9
Online ISBN: 978-3-540-76931-6
eBook Packages: Computer ScienceComputer Science (R0)