Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/6681
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Brimberg, J | - |
dc.contributor.author | Hansen, P | - |
dc.contributor.author | Mladenović, N | - |
dc.contributor.author | Taillard, ED | - |
dc.date.accessioned | 2012-09-17T13:26:42Z | - |
dc.date.available | 2012-09-17T13:26:42Z | - |
dc.date.issued | 2000 | - |
dc.identifier.citation | Operations Research, 48(3): 444 - 460, May 2000 | en_US |
dc.identifier.issn | 0030-364X | - |
dc.identifier.uri | http://or.journal.informs.org/content/48/3/444.short | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/6681 | - |
dc.description | Copyright @ 2000 INFORMS | en_US |
dc.description.abstract | The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to minimize the total transportation cost for satisfying the demand of n fixed users, each supplied from its closest facility. Many heuristics have been proposed for this problem, as well as a few exact algorithms. Heuristics are needed to solve quickly large problems and to provide good initial solutions for exact algorithms. We compare various heuristics, i.e., alternative location-allocation (Cooper 1964), projection (Bongartz et al. 1994), Tabu search (Brimberg and Mladenovic 1996a), p-Median plus Weber (Hansen ct al. 1996), Genetic search and several versions of Variable Neighbourhood search. Based on empirical tests that are reported, it is found that most traditional and some recent heuristics give poor results when the number of facilities to locate is large and that Variable Neighbourhood search gives consistently best results, on average, in moderate computing time. | en_US |
dc.description.sponsorship | This study was supported by the Department of National Defence (Canada) Academic Research; Office of Naval Research Grant N00014-92-J-1194, Natural Sciences and Engineering Research Council of Canada Grant GPO 105574 and Fonds pour la Formation des Chercheurs et l’Aide a la Recherche Grant 32EQ 1048; and by an International Postdoctoral Fellowship of the Natural Sciences and Engineering Research Council of Canada, Grant OGPOO 39682. | en_US |
dc.language | English | - |
dc.language.iso | en | en_US |
dc.publisher | INFORMS | en_US |
dc.subject | Facilities/equipment planning, location, continuous | en_US |
dc.subject | Heuristic solution methods | en_US |
dc.title | Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem | en_US |
dc.type | Article | en_US |
dc.identifier.doi | http://dx.doi.org/10.1287/opre.48.3.444.12431 | - |
pubs.organisational-data | /Brunel | - |
pubs.organisational-data | /Brunel/Brunel Active Staff | - |
pubs.organisational-data | /Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths | - |
pubs.organisational-data | /Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths/Maths | - |
pubs.organisational-data | /Brunel/University Research Centres and Groups | - |
pubs.organisational-data | /Brunel/University Research Centres and Groups/School of Information Systems, Computing and Mathematics - URCs and Groups | - |
pubs.organisational-data | /Brunel/University Research Centres and Groups/School of Information Systems, Computing and Mathematics - URCs and Groups/Centre for the Analysis of Risk and Optimisation Modelling Applications | - |
Appears in Collections: | Publications Computer Science Dept of Mathematics Research Papers Mathematical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 128.64 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.