Abstract
The population-based ant colony optimization (PACO) algorithm uses a pheromone memory model based on a population of solutions stored in a solution archive. Pheromone updates in the PACO are performed only when a solution enters or leaves the archive. Absence of the local pheromone update rule makes the pheromone memory less flexible compared to other ACO algorithms but saves computational time. In this work, we present a novel application of the PACO for solving the sequential ordering problem (SOP). In particular, we investigate how different values of the PACO parameters affect its performance and identify some problems regarding the diversity of solutions stored in the solution archive. A comparison with the state-of-the-art algorithm for the SOP shows that the PACO can be a very competitive tool.
This is a preview of subscription content, log in via an institution to check access.
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 (2004)
Escudero, L.F.: An inexact algorithm for the sequential ordering problem. European Journal of Operational Research 37(2), 236–249 (1988)
Gambardella, L.M., Dorigo, M.: An ant colony system hybridized with a new local search for the sequential ordering problem. INFORMS Journal on Computing 12(3), 237–255 (2000)
Gambardella, L.M., Montemanni, R., Weyland, D.: An enhanced ant colony system for the sequential ordering problem. In: Operations Research Proceedings 2011, pp. 355–360. Springer (2012)
Guerriero, F., Mancini, M.: A cooperative parallel rollout algorithm for the sequential ordering problem. Parallel Computing 29(5), 663–677 (2003)
Guntsch, M., Middendorf, M.: A population based approach for ACO. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoWorkshops 2002. LNCS, vol. 2279, pp. 72–81. Springer, Heidelberg (2002)
Oliveira, S.M., Hussin, M.S., Stützle, T., Roli, A., Dorigo, M.: A detailed analysis of the population-based ant colony optimization algorithm for the tsp and the qap. In: Proceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation, pp. 13–14. ACM (2011)
Reinelt, G.: Tsplib95. http://www.iwr.uni-heidelberg.de/groups/comopt/-software/tsplib95/index.html
Scheuermann, B., So, K., Guntsch, M., Middendorf, M., Diessel, O., ElGindy, H., Schmeck, H.: Fpga implementation of population-based ant colony optimization. Applied Soft Computing 4(3), 303–322 (2004)
Skinderowicz, R.: Ant colony system with selective pheromone memory for TSP. In: Nguyen, N.-T., Hoang, K., Jȩdrzejowicz, P. (eds.) ICCCI 2012, Part II. LNCS, vol. 7654, pp. 483–492. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Skinderowicz, R. (2015). Population-Based Ant Colony Optimization for Sequential Ordering Problem. In: Núñez, M., Nguyen, N., Camacho, D., Trawiński, B. (eds) Computational Collective Intelligence. Lecture Notes in Computer Science(), vol 9330. Springer, Cham. https://doi.org/10.1007/978-3-319-24306-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-24306-1_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24305-4
Online ISBN: 978-3-319-24306-1
eBook Packages: Computer ScienceComputer Science (R0)