Results 211 to 220 of about 48,325 (261)
Some of the next articles are maybe not open access.
Modeling and solving the uncapacitated r-allocation p-hub median problem under congestion
Computational and Applied Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nader Ghaffarinasab +1 more
openaire +2 more sources
The robust uncapacitated multiple allocation p -hub median problem
Computers & Industrial Engineering, 2017In this paper we study the uncapacitated multiple allocation p-hub median problem and propose several ways to deal with the uncertainty that may occur in the flow. More precisely, the paper introduces a new way to quantify the robustness of a solution in the presence of uncertainities. The main characteristic of the newly proposed robustness measure is
Talbi, El-Ghazali, Todosijević, Raca
openaire +2 more sources
GRASP for the uncapacitated r-allocation p-hub median problem
Computers & Operations Research, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peiró, Juanjo +2 more
openaire +2 more sources
Tight linear programming relaxations of uncapacitated p-hub median problems
European Journal of Operational Research, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Skorin-Kapov, Darko +2 more
openaire +1 more source
Optimization of the p-Hub Median Problem via Artificial Immune Systems
European Journal of Operational Research, 2019Recent advances in logistics, transportation and in telecommunications offer great opportunities to citizens and organizations in a globally-connected world, but they also arise a vast number of complex challenges that decision makers must face. In this context, a popular optimization problem with practical applications to the design of hub-and-spoke ...
Stephanie Alvarez Fernandez +2 more
openaire +3 more sources
Efficient algorithms for the uncapacitated single allocation p-hub median problem
Location Science, 1996Summary: We present a new LP formulation for the single allocation \(p\)-hub median problem, which requires fewer variables and constraints than those traditionally used in the literature. We develop a good heuristic algorithm for its solution based on Simulated Annealing (SA).
Ernst, Andreas T., Krishnamoorthy, Mohan
openaire +3 more sources
Solving the p-hub Median Problem Under Intentional Disruptions Using Simulated Annealing
Networks and Spatial Economics, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parvaresh, F. +3 more
openaire +1 more source
A Tree Pruning Algorithm for the Capacitated p-hub Median Problems
2010 WASE International Conference on Information Engineering, 2010Because of the constraint conditions of hub capacity and the large number of the hub combinations, the capacitated p-hub median problems are complicated. This paper presented a tree pruning algorithm to obtain the optimal solution in a local range. The algorithm was combined with Lagrangian relaxation method and applied to the air transportation system
Ge Wei, Zhu Jinfu, Wu Weiwei
openaire +1 more source
Genetic algorithm with multistart search for the p-Hub median problem
Proceedings. 24th EUROMICRO Conference (Cat. No.98EX204), 2002The location-allocation problem consists of finding the best selection of points to open facilities (location) and the way for serving the users (allocation). In most cases these problems result in being NP hard. For this reason, heuristic approaches constitute suitable tools to solve the problems.
M. Perez, F. Almeida, J.M. Moreno-Vega
openaire +1 more source
General contraction method for uncapacitated single allocation p-hub median problems
2017 IEEE Symposium Series on Computational Intelligence (SSCI), 2017Hub location problems have been studied by researchers for three decades, yet, most algorithms do not perform well for large-scale networks because of their high computational complexities. Methods that scale up to large networks are usually tailored specifically towards a particular hub location problem instance and cannot be adapted easily to other ...
Weibin Dai +3 more
openaire +1 more source