Sequential constraint augmentation with variable neighbourhood search for the multidimensional assignment problem Online publication date: Fri, 18-Apr-2008
by Eduardo L. Pasiliao, Panos M. Pardalos
International Journal of Computational Science and Engineering (IJCSE), Vol. 3, No. 3, 2007
Abstract: This work proposes the Sequential Constraint Augmentation (SCA) procedure for the Multidimensional Assignment Problem (MAP). Although the two-dimensional assignment problem has been shown to be solvable in polynomial time, the problem becomes NP-hard when it is extended to three dimensions. We investigate the benefits of implementing an intra-permutation 2 exchange and variable neighbourhood search for the SCA. The variable neighbourhood approach utilises the intra-permutation 2 and n-exchanges and the inter permutation 2-exchange. All three κ-exchange neighbourhoods are motivated by the permutation formulation of the MAP. Computational results show that the SCA procedure provides a tight upper bound with little computational effort. Exploring our variable neighbourhood significantly improves the SCA solution within a relatively short amount of computation time.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Computational Science and Engineering (IJCSE):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook