التفاصيل البيبلوغرافية
| العنوان: |
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem. |
| المؤلفون: |
Hansen, Pierre1 pierre.hansen@gerad.ca, Brimberg, Jack2 jack.brimberg@rmc.ca, Urošević, Dragan3 draganu@mi.sanu.ac.yu, Mladenović, Nenad4 nenad.mladenovic@brunel.ac.uk |
| المصدر: |
INFORMS Journal on Computing. Fall2007, Vol. 19 Issue 4, p552-564. 13p. 6 Charts. |
| مصطلحات موضوعية: |
*HEURISTIC, *SEARCH algorithms, *DATA transmission systems, *COMPUTER networks, *INFORMATION services, *ELECTRONIC data processing, *COMPUTER programming, MATHEMATICAL variables, DATA distribution |
| مستخلص: |
The variable neighborhood search metaheuristic is applied to the primal simple plant-location problem and to a reduced dual obtained by exploiting the complementary slackness conditions. This leads to (i) heuristic resolution of (metric) instances with uniform fixed costs, up to n = 15,000 users, and m = n potential locations for facilities with an error not exceeding 0.04%; (ii) exact solution of such instances with up to m = n = 7,000; and (iii) exact solutions of instances with variable fixed costs and up to m = n = 15,000. [ABSTRACT FROM AUTHOR] |
|
Copyright of INFORMS Journal on Computing is the property of INFORMS: Institute for Operations Research and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Business Source Index |
Full Text Finder