Skip Navigation


IMA Journal of Management Mathematics Advance Access originally published online on April 27, 2006
IMA Journal of Management Mathematics 2006 17(4):307-316; doi:10.1093/imaman/dpl002
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
17/4/307    most recent
dpl002v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Brimberg, J.
Right arrow Articles by Mladenovic, N.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The authors 2006. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

Decomposition strategies for large-scale continuous location–allocation problems

Jack Brimberg1, Pierre Hansen2 and Nenad Mladenovic3,**

1 Department of Business Administration, Royal Military College of Canada, Kingston, Ontario, Canada, and GERAD, 2 GERAD and HEC, University of Montreal, Canada, 3 School of Mathematics, Brunel University, Uxbridge, UK

** Email: nenad.mladenovic{at}brunel.ac.uk

The continuous location–allocation problem requires finding sites for m new facilities in the plane in order to serve n users such that the total transportation costs are minimized. Several heuristics have been developed to solve this well-studied global optimization problem. However, little work has been done using decomposition techniques. In this paper, we examine a few new ways to decompose the location–allocation problem. These strategies are then embedded in a variable neighbourhood decomposition search heuristic and tested on large instances of this problem.

Keywords: heuristics; decomposition; variable neighbourhood search; location–allocation

Received on 4 December 2004. accepted on 23 December 2005.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.