Premium
A heuristic algorithm for optimal location of flow‐refueling capacitated stations
Author(s) -
Hosseini Meysam,
MirHassani S. A.
Publication year - 2017
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12209
Subject(s) - mathematical optimization , computer science , heuristic , flow network , facility location problem , set (abstract data type) , algorithm , location model , mathematics , operations research , programming language
Constructing refueling stations in the transportation network is one of the most important steps toward the promotion of alternative‐fuel vehicles. The capacity of these stations is usually limited. In this paper, a new capacitated refueling station location model and a solution algorithm are proposed. The algorithm is divided into two main steps. At first step, a restricted capacitated problem on core sets is constructed. Then, a modified Lagrangean iterative method is used for obtaining solutions. The Lagrangean method decomposes the restricted problem into two subproblems that are easy to solve. Information from subproblems is used to generate valid inequalities for tightening the upper and lower bounds. The approach is evaluated by considering a set of networks and randomly generated instances. The obtained results indicate that the large problems are efficiently tractable by the proposed algorithm in a reasonable time.