Preprocessing and cutting for multiple allocation hub location problems |
| |
Institution: | 1. Division of Engineering, New York University Abu Dhabi, Saadiyat Island, Abu Dhabi, 129188, United Arab Emirates;2. Department of Civil and Urban Engineering, Tandon School of Engineering, New York University, Brooklyn, NY 11201, USA |
| |
Abstract: | In this paper we consider formulations and solution approaches for multiple allocation hub location problems. We present a number of results, which enable us to develop preprocessing procedures and tightening constraints for existing mixed integer linear programming formulations. We employ flow cover constraints for capacitated problems to improve computation times. We present the results of our computational experience, which show that all of these steps can effectively reduce the computational effort required to obtain optimal solutions. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|