Abstract
In this paper, we propose a new global routing algorithm supporting advance reservation. A set of flows are shared across a communication network. Each flow has a source node, a destination node and a predetermined traffic demand. The design goal of the routing is to minimize the overall network congestion under the constraint that each flow should be sent along a single path without being bifurcated. We model this optimization problem as a single path multicommodity flow problem (SPMFP). As the complexity of the SPMFP is NP-Hard, a Multi-start Tabu Search (MTS) is proposed as a solution approach. The empirical validation is done using a simulation environment called Inform Lab. A comparison to a state-of-the-art ant colony system (ACS) approach is performed based on a real case of maritime surveillance application. The same instances are optimally solved using CPLEX. The experimental results show that the MTS produces considerably better results than the ACS to the detriment of the CPU time.
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
Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall Inc., Upper Saddle (1993)
Bandyopadhyay, S.: Dissemination of Information in Optical Networks: From Technology to Algorithms. Springer, Berlin (2007)
Barnhart, C., Hane, C.A., Vance, P.H.: Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research 48(2), 318–326 (2000)
Baier, G., Köhler, E., Skutella, M.: On the k-splittable flow problem. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 101–113. Springer, Heidelberg (2002)
Birattari, M.: The problem of tuning metaheuristics as seen from a machine learning perspective. PhD thesis, Universite Libre De Bruxelles (2005)
Bley, A.: Approximability of unsplittable shortest path routing problems. Networks 54(1), 23–46 (2009)
Dridi, O., Krichen, S., Guitouni, A.: A multi-objective optimization approach for resource assignment and task scheduling problem: Application to maritime domain awareness. In: IEEE Congress on Evolutionary Computation (CEC), pp. 1–8 (2012)
Glover, F., Taillard, E., Laguna, M., de Werra, D.: A user’s guide to tabu search. Annals of Operations Research 41(1), 1–28 (1993)
Holmberg, K., Yuan, D.: A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation. INFORMS Journal on Computing 15(1), 42–57 (2003)
Hyppolite, J.M., Galinier, P., Pierre, S.: A tabu search heuristic for the routing and wavelength assignment problem in multigranular optical networks. Photonic Network Communication 15(2), 123–130 (2008)
Jiménez, V.M., Marzal, A.: Computing the k Shortest Paths: A new algorithm and experimental Comparison. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 15–29. Springer, Heidelberg (1999)
Kleinberg, J.M.: Approximation algorithms for disjoint paths problems, Ph.D. Thesis, MIT, Cambridge, MA (1996)
Li, X.Y., Aneja, Y.P., Baki, F.: An ant colony optimization metaheuristic for single-path multicommodity network flow problems. Journal of the Operational Research Society 61(9), 1340–1355 (2010)
MacDonald, Dettwiler and Associates Ltd., Inform Lab Wiki
Truffot, J., Duhamel, C., Mahey, P.: Using branch-and-price to solve multicommodity k-splittable flow problems. In: Proceedings of the International Network Optimization Conference (INOC) (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Masri, H., Krichen, S., Guitouni, A. (2014). A Multi-start Tabu Search Approach for Solving the Information Routing Problem. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2014. ICCSA 2014. Lecture Notes in Computer Science, vol 8580. Springer, Cham. https://doi.org/10.1007/978-3-319-09129-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-09129-7_20
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09128-0
Online ISBN: 978-3-319-09129-7
eBook Packages: Computer ScienceComputer Science (R0)