Abstract
Large volume surveillance missions are characterized by the employment and collaboration of several agents processing diverse information sources’ inputs in order to ensure a surveillance task. Given the time dependant relevance of the shared information, an efficient global routing policy needs to be set up to optimize information exchange in the backbone of the surveillance network. We propose to model this problem as a single path multicommodity flow problem, where several commodities are to be shared in a capacitated network. The considered objective function is to minimize the overall network congestion. As the problem is NP-Hard, a hybrid genetic approach is proposed as a solution approach. A greedy search procedure based on the nearest neighbor method is transplanted into the genetic algorithm. The empirical validation is done using a simulation environment called Inform Lab. A comparison to a state-of-the-art ant colony system approach is performed based on a real case of maritime surveillance application and some randomly generated instances. The analysis of the results obtained in the two sets was supported by statistical nonparametric Wilcoxon signed-rank tests. The experimental results show that the hybrid genetic algorithm performs consistently well for large sized problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
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)
Birattari, M.: The problem of tuning metaheuristics as seen from a machine learning perspective. PhD thesis, Universite Libre De Bruxelles (2005)
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)
Chiang, M., Low, S.H., Calderbank, A.R., Doyle, J.C.: Layering as optimization decomposition: A mathematical theory of network architectures. Proceedings of the IEEE 95(1), 255–312 (2007)
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)
Kleinberg, J.M.: Approximation algorithms for disjoint paths problems, Ph.D. Thesis. MIT, Cambridge, MA (1996)
Jiménez, V.M., Marzal, A.: Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 15–29. Springer, Heidelberg (1999)
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)
Bley, A.: Approximability of unsplittable shortest path routing problems. Networks 54(1), 23–46 (2009)
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)
MacDonald, Dettwiler and Associates Ltd., Inform Lab Wiki
Masri, H., Guitouni, A., Krichen, S.: Towards Efficient Information Exchange in Fusion Networks. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2013, Part II. LNCS, vol. 7895, pp. 535–546. Springer, Heidelberg (2013)
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 Hybrid Genetic Algorithm for Solving the Unsplittable Multicommodity Flow Problem: The Maritime Surveillance Case. In: Gu, Q., Hell, P., Yang, B. (eds) Algorithmic Aspects in Information and Management. AAIM 2014. Lecture Notes in Computer Science, vol 8546. Springer, Cham. https://doi.org/10.1007/978-3-319-07956-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-07956-1_13
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07955-4
Online ISBN: 978-3-319-07956-1
eBook Packages: Computer ScienceComputer Science (R0)