| Article ID: | iaor20041971 |
| Country: | United Kingdom |
| Volume: | 30 |
| Issue: | 11 |
| Start Page Number: | 1609 |
| End Page Number: | 1624 |
| Publication Date: | Sep 2003 |
| Journal: | Computers and Operations Research |
| Authors: | Salhi S., Gamal M.D.H. |
| Keywords: | heuristics |
The multisource location–allocation problem in the continuous space is investigated. A learning scheme which uses previous solutions to discretise the continuous space into well-defined cells is proposed. This cells-based technique takes into account frequency of occurrence of already found configurations as well as the compatibility of these configurations. Some results on existing test problems are presented.