期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 93, 期 -, 页码 50-61出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2017.10.005
关键词
Hub location problem with service requirements; Robust optimization; Travel time uncertainty; Benders decomposition
类别
资金
- CNPq [311108/2016-4, 503065/2014-5, 302459/2013-8, 402651/2012-0]
- Fapemig [APQ 02508-13-014/14]
- Fapesp in Brazil [2016/01860-1]
Many transportation systems for routing flows between several origin-destination pairs of demand nodes have been widely designed as hub-and-spoke networks. To improve the provided service level of these networks, service time requirements are here considered during modeling, giving rise to a multiple allocation incomplete hub location problem with service time requirements. The problem consists of designing a hub and spoke network by locating hubs, establishing inter-hub arcs, and routing origin-destination demand flows at minimal cost while meeting some service time requirements. As travel times are usually uncertain for most real cases, the problem is approached via a binary linear programming robust optimization model, which is solved by two specialized Benders decomposition algorithms. The devised Benders decomposition framework outperforms a general purpose optimization solver on solving benchmark instances of the hub location literature. The achieved results also show how the probability of violating the travel time requirements decreases with the prescribed protection level, at the expense of the higher costs of the optimal solution for the robust optimization model. (C) 2017 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据