期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 101, 期 -, 页码 303-312出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2016.09.006
关键词
Capacitated Helicopter Routing Problem; Clustering Search; Oil and gas logistics
资金
- FAPES [458/2013, 524/2016, 74456695/2016, 67627153/2014, 73290475/2015]
- CNPq [477357/2013-0, 313408/2014-9, 303052/2013-9, 454569/2014-9]
In several countries, the petroleum is explored offshore and the oil and gas companies use oil drilling facilities and platforms far away from the coast. Thus, the oil companies transport its employees by helicopters between onshore basins, airports and platforms. This problem is known as the Capacitated Helicopter Routing Problem (CHRP). In this paper, it is proposed a formal mathematical model to the CHRP with several specific constraints and a more realistic objective function. Besides a Clustering Search (CS) metaheuristic is proposed to solve it. The mathematical model and the CS metaheuristic were tested with real data from a Brazilian oil and gas company. A set of instances with up to 1000 transportation requests and 100 helicopters was generated. Computational experiments indicate that CPLEX is not able to solve optimally even small instances of the problem, but the CS metaheuristic is capable of solving the proposed model generating good, stable and fast solutions. (C) 2016 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据