A metaheuristic for solving the unsplittable multicommodity flow problem: the maritime surveillance case
by Hela Masri; Saoussen Krichen; Adel Guitouni
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 9, No. 3, 2014

Abstract: In this paper, we address the problem of routing optimisation in the backbone of a surveillance network. A surveillance mission is characterised by the employment and collaboration of several agents processing diverse information sources' inputs in order to ensure a surveillance task. These communications rely in a predefined network infrastructure containing mobile nodes and static backbone nodes. As the backbone network is private and configurable, a global routing algorithm can be set up in order to optimise information exchange. We propose to model this problem as a single path multicommodity flow problem (SMCFP), where several commodities are to be shared. The considered objective function is to minimise the overall network congestion. 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 containing real instances of surveillance cases. A comparison to a state-of-the-art ant colony system (ACS) approach is performed based on two large testbeds. The same instances are optimally solved using CPLEX. The experimental results show that the MTS produces considerably better results than the ACS.

Online publication date: Fri, 10-Apr-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Intelligence and Data Mining (IJBIDM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com