A branch and price approach for routing and refueling station location model

•We study the refueling station location problem with routing considerations.•We propose a branch and price algorithm based on the notion of path-segments.•The decrease in solution times with respect to existing works is significant.•Our algorithm scales very efficiently to more realistic network di...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 248; číslo 3; s. 815 - 826
Hlavní autoři: Yıldız, Barış, Arslan, Okan, Karaşan, Oya Ekin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.02.2016
Elsevier Sequoia S.A
Témata:
Alternative fuel vehicles
Branch and price
Combinatorial optimization
Location
Location analysis
Network flow problem
Refueling station
Route optimization
Shortest path algorithms
Studies
Transportation problem (Operations research)
Branch and price
Combinatorial optimization
Alternative fuel vehicles
Refueling station
Location
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•We study the refueling station location problem with routing considerations.•We propose a branch and price algorithm based on the notion of path-segments.•The decrease in solution times with respect to existing works is significant.•Our algorithm scales very efficiently to more realistic network dimensions. The deviation flow refueling location problem is to locate p refueling stations in order to maximize the flow volume that can be refueled respecting the range limitations of the alternative fuel vehicles and the shortest path deviation tolerances of the drivers. We first provide an enhanced compact model based on a combination of existing models in the literature for this relatively new operations research problem. We then extend this problem and introduce the refueling station location problem which adds the routing aspect of the individual drivers. Our proposed branch and price algorithm relaxes the simple path assumption generally adopted in the existing studies and implicitly takes into account deviation tolerances without the pregeneration of the routes. Therefore, the decrease in solution times with respect to existing models is significant and our algorithm scales very efficiently to more realistic network dimensions.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2015.05.021