The P-Hub maximal covering problem and extensions for gradual decay functions |
| |
| Institution: | 1. Department of Industrial Engineering, Federal University of Minas Gerais, Brazil;2. Department of Mechanical and Industrial Engineering, Concordia University, Canada;3. Department of Logistics and Operations Management, HEC Montréal, Canada;1. Department of Industrial Engineering, TOBB University of Economics and Technology, Ankara, Turkey;2. Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada;1. Department of Industrial Engineering, Bilkent University, Ankara, Turkey;2. Department of Integrated Systems Engineering, The Ohio State University, Columbus, OH, USA |
| |
| Abstract: | The p-hub maximal covering problem aims to find the best locations for hubs so as to maximize demands within a coverage distance with a predetermined number of hubs. Classically, the problem is defined in the framework of binary coverage only; an origin–destination pair is covered if the cost (time, etc.) is lower than the critical value, and not covered at all if the cost is greater than the critical value. In this paper, we extend the definition of coverage, introducing “partial coverage”, which changes with distance. We present new and efficient mixed-integer programming models that are also valid for partial coverage for single and multiple allocations. We present and discuss the computational results with different data sets. |
| |
| Keywords: | Hub location problem Partial coverage |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
