An exact algorithm for the capacitated facility location problems with single sourcing |
| |
| Affiliation: | 1. Novosibirsk State University, Novosibirsk 630090, Russia;2. Sobolev Institute of Mathematics, Novosibirsk 630090, Russia;1. Estadística i Investigació Operativa, U. Politècnica de Catalunya, Spain;2. Economía Aplicada I, U. de Sevilla, Spain;3. Facultad de Matemáticas, U. de Sevilla, Spain;1. Department of Statistics, University of Warwick, Coventry CV4 7AL, UK;2. Kent Business School, University of Kent, Canterbury CT2 7PE, UK;1. School of Management, Xi''an Jiaotong University, No. 28 Xianning West Road, Xi''an, Shaanxi 710049, China;2. Institut Charles Delaunay (UMR CNRS 6281), Industrial systems optimization laboratory, University of Technology of Troyes, 12 rue Marie Curie, CS42060, Troyes 10004, France;3. IBISC, Univ Evry, Université Paris-Saclay, 91025 Evry, France;4. School of Economics and Management, Fuzhou University, Fuzhou 350116, China |
| |
| Abstract: | Facility location problems are often encountered in many areas such as distribution, transportation and telecommunication. We describe a new solution approach for the capacitated facility location problem in which each customer is served by a single facility. An important class of heuristic solution methods for these problems are Lagrangian heuristics which have been shown to produce high quality solutions and at the same time be quite robust. A primal heuristic, based on a repeated matching algorithm which essentially solves a series of matching problems until certain convergence criteria are satisfied, is incorporated into the Lagrangian heuristic. Finally, a branch-and-bound method, based on the Lagrangian heuristic is developed, and compared computationally to the commercial code CPLEX. The computational results indicate that the proposed method is very efficient. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
