Abstract
We propose an extended ACO algorithm for the Maximum Edge Disjoint Paths (MEDP) problem. In this problem we want to satisfy the largest possible number of request for disjoint paths on a given graph topology. We first proposed our approach in [1]. In that paper a proof of concept was given on a number of quite small graphs. Now we build on that approach and use existing ACO features to develop an algorithm capable of obtaining good results on a set of MEDP benchmark problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Nowé, A., Verbeeck, K., Vrancx, P.: Multi-type ant colony: The edge disjoint paths problem. In: Dorigo, M., et al. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 202–213. Springer, Heidelberg (2004)
Blesa, M., Blum, C.: Ant colony optimization for the maximum edge-disjoint paths problem. In: Raidl, G.R., et al. (eds.) EvoWorkshops 2004. LNCS, vol. 3005, pp. 160–169. Springer, Heidelberg (2004)
Vrancx, P., Nowé, A.: Using pheromone repulsion to find disjoint paths. Technical report, Computational Modeling Lab, Vrije Universiteit Brussel (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vrancx, P., Nowé, A. (2006). Using Pheromone Repulsion to Find Disjoint Paths. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2006. Lecture Notes in Computer Science, vol 4150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839088_62
Download citation
DOI: https://doi.org/10.1007/11839088_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38482-3
Online ISBN: 978-3-540-38483-0
eBook Packages: Computer ScienceComputer Science (R0)