A parallel hybrid ant-tabu algorithm for integrated emergency vehicle dispatching and covering problem
by Sarah Ibri, Habiba Drias, Mustapha Nourelfath
International Journal of Innovative Computing and Applications (IJICA), Vol. 2, No. 4, 2010

Abstract: In this paper we propose, implement and analyse a parallel solution to solve an integrated dispatching and covering problem for emergency vehicle fleet management system. The basic sequential algorithm is a coupled ant colony system (ACS) with tabu search heuristic. To speed up this algorithm, we develop a master slave ACS parallel version based on the parallel neighbourhood evaluation approach for the tabu procedure. In experiments we compare synchronisation strategies between the parallel processes and show the impact of inter processes communication frequency and the information exchanged on the efficiency of the algorithm.

Online publication date: Tue, 09-Nov-2010

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 Innovative Computing and Applications (IJICA):
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