期刊
COMPUTERS & OPERATIONS RESEARCH
卷 97, 期 -, 页码 31-47出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2018.04.021
关键词
Hub location; Polyhedral uncertainty; Mathematical formulation; Matheuristics; Tabu Search
This paper addresses the robust multiple allocation p-hub median problem under polyhedral demand uncertainty. Three variants of polyhedral uncertainty models are used in the problem, namely the hose, the hybrid, and the budget uncertainty models. The problems are formulated as linear mixed integer programming problems and a Tabu Search (TS) based matheuristic approach is proposed to solve the three variants of the problem. Extensive computational experiments are conducted based on three well-known data sets in the hub location literature and the results show the capability of the proposed solution algorithm to obtain the optimal solutions in short computational times. (C) 2018 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据