Hub location problems: A review of models, classification, solution techniques, and applications

RZ Farahani, M Hekmatfar, AB Arabani… - Computers & industrial …, 2013 - Elsevier
Hub location problem (HLP) is a relatively new extension of classical facility location
problems. Hubs are facilities that work as consolidation, connecting, and switching points for …

An efficient tabu search for solving the uncapacitated single allocation hub location problem

R Abyazi-Sani, R Ghanbari - Computers & Industrial Engineering, 2016 - Elsevier
We here propose an efficient tabu search (TS) for solving the uncapacitated single allocation
hub location problem. To decrease the computational time, in the proposed tabu search …

An efficient memetic algorithm for the uncapacitated single allocation hub location problem

M Marić, Z Stanimirović, P Stanojević - Soft Computing, 2013 - Springer
In this paper, we present a memetic algorithm (MA) for solving the uncapacitated single
allocation hub location problem (USAHLP). Two efficient local search heuristics are …

A hybridization of an evolutionary algorithm and a parallel branch and bound for solving the capacitated single allocation hub location problem

P Stanojević, M Marić, Z Stanimirović - Applied Soft Computing, 2015 - Elsevier
In this study, we propose a hybrid optimization method, consisting of an evolutionary
algorithm (EA) and a branch-and-bound method (BnB) for solving the capacitated single …

带固定轴线成本的轴辐式网络设计问题

翁克瑞 - 运筹学学报, 2012 - ort.shu.edu.cn
Hub-and-Spoke network design problem with fixed hub arc cost has a wide range of
applications within the third party logistics, postal services and airline transportation. Current …

A multi-start iterated local search algorithm for the uncapacitated single allocation hub location problem

J Guan, G Lin, HB Feng - Applied soft computing, 2018 - Elsevier
The uncapacitated single allocation hub location problem (USAHLP) is a particular variant of
the hub location problem, which has broad applications in the transportation network. The …

[PDF][PDF] Topological variable neighborhood search

V Filipović, A Kartelj - Journal of Big Data, 2024 - Springer
The design of the novel metaheuristic method, called Topological Variable Neighborhood
Search, is presented and its theoretical properties are elaborated. The proposed …

A Combined Average‐Case and Worst‐Case Analysis for an Integrated Hub Location and Revenue Management Problem

JZ Huo, YT Hou, F Chu, JK He - Discrete Dynamics in Nature …, 2019 - Wiley Online Library
This paper investigates joint decisions on airline network design and capacity allocation by
integrating an uncapacitated single allocation p‐hub median location problem into a …

An efficient genetic algorithm for the design of hub-and-spoke networks

BN Gomes, AX Martins, RS de Camargo… - IEEE …, 2013 - ieeexplore.ieee.org
We propose an efficient genetic algorithm (GA) for the design of hub-and-spoke networks
with single allocation. The creation of the initial population is based on the greedy …

An efficient evolutionary algorithm for locating long-term care facilities

Z Stanimirovic, M Maric, S Bozovic… - … Technology and Control, 2012 - itc.ktu.lt
AN EFFICIENT EVOLUTIONARY ALGORITHM FOR LOCATING LONG-TERM CARE FACILITIES
Page 1 ISSN 1392–124X INFORMATION TECHNOLOGY AND CONTROL, 2012 Vol. 41, No. 1 …