An efficient heuristic algorithm for the capacitated p-! median problem |
| |
Authors: | Masoud Yaghini Mohsen Momeni Mohammadreza Sarmadi Hamid Reza Ahadi |
| |
Affiliation: | 1. Department of Rail Transportation Engineering, School of Railway Engineering, Iran University of Science and Technology, Tehran, Iran
|
| |
Abstract: | The capacitated $p$ -median problem (CPMP) is one of the well-known facility-location problems. The objective of the problem is to minimize total cost of locating a set of capacitated service points and allocating a set of demand points to the located service points, while the total allocated demand for each service point is not be greater than its capacity limit. This paper presents an efficient heuristic algorithm based on the local branching and relaxation induced neighborhood search methods for the CPMP. The proposed algorithm is a heuristic technique that utilizes a general mixed integer programming solver to explore neighborhoods. The parameters of the proposed algorithm are tuned by design of experiments. The proposed method is tested on a large set of benchmark instances. The results show that the method outperforms the best method found in the literature. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |