Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem
Sign Up to like & getrecommendations! Published in 2018 at "Networks and Spatial Economics"
DOI: 10.1007/s11067-018-9424-z
Abstract: The hub location problem (HLP) is a special type of the facility location problem with numerous applications in the airline industry, postal services, and computer and telecommunications networks. This paper addresses two basic variants of… read more here.
Keywords: location problem; problem; single allocation; hub location ... See more keywords
Reliable single-allocation hub location problem with disruptions
Sign Up to like & getrecommendations! Published in 2019 at "Transportation Research Part E: Logistics and Transportation Review"
DOI: 10.1016/j.tre.2019.01.008
Abstract: Hub transportation networks are vulnerable to uncertainties such as natural disasters or terrorist attacks. We investigate the single-allocation p-hub location problems and the effect of uncertainties on deliveries. We introduce a bi-objective reliable capacitated p-hub… read more here.
Keywords: hub; transportation; hub location; single allocation ... See more keywords
A parallel heuristics for the single allocation hub location problem
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Latin America Transactions"
DOI: 10.1109/tla.2017.7959347
Abstract: This paper introduces a cooperative parallel heuristic for the uncapacitated single allocation hub location problem. The proposed heuristic consists in combining multiple parallel ILS-RVND local search and Path-Relinking, cooperating through asynchronously exchaging solutions in a… read more here.
Keywords: location problem; allocation hub; single allocation; hub location ... See more keywords