Results 221 to 230 of about 48,325 (261)
Some of the next articles are maybe not open access.
New complexity results for the p-hub median problem
Annals of Operations Research, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem
European Journal of Operational Research, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ernst, Andreas T., Krishnamoorthy, Mohan
openaire +3 more sources
International Congress on Human-Computer Interaction, Optimization and Robotic Applications Proceedings, 2019
[Abtsract Not Available]
Yıldırım, Betül +3 more
openaire +2 more sources
[Abtsract Not Available]
Yıldırım, Betül +3 more
openaire +2 more sources
Using simulated annealing to solve the p‐Hub Median Problem
International Journal of Physical Distribution & Logistics Management, 2001Locating hub facilities is important in different types of transportation and communication networks. The p‐Hub Median Problem (p‐HMP) addresses a class of hub location problems in which all hubs are interconnected and each non‐hub node is assigned to a single hub. The hubs are uncapacitated, and their number p is initially determined.
openaire +1 more source
A new modelling for p-hub median problem by considering flow-dependent costs
2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), 2013The p-hub median problem is to determine a number of p hubs and allocate the remaining non-hub nodes to them such that total cost of the network is minimized. Normally, this cost is considered as a linear function of distance between nodes. However, such assumption results in a naive modeling of the hub networks of the real world.
Masoud Rabbani +2 more
openaire +1 more source
European Journal of Operational Research, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ilić, Aleksandar +3 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ilić, Aleksandar +3 more
openaire +1 more source
A Hybrid GRASP-Path Relinking Algorithm for the Capacitated p – hub Median Problem
2005The p – hub median problem is an NP hard location – allocation problem, that consists of finding p points to establish facilities and the assignment of the users to these points. In the capacitated version of this problem, each hub has got a maximum capacity limiting the traffic to be assigned.
Melquíades Pérez +2 more
openaire +1 more source
Hub Location and the p-Hub Median Problem
Operations Research, 1996Hub facilities serve as switching and transshipment points in transportation and communication networks. Hub networks concentrate flows on the hub-to-hub links and benefit from economies of scale in interhub transportation. Most hub location research has focused on problems where each origin/destination is allocated to a single hub.
openaire +2 more sources
A single allocation p-hub median problem with general piecewise-linear costs in arcs
Computers & Industrial Engineering, 2019Abstract Hubs are used in postal, air passenger transportation, and less-than-truckload (LTL) transportation industries to consolidate, sort, and classify the flows from multiple origins to multiple destinations (OD pairs). Hub-and-spoke networks are commonly designed to exploit economies of scale, and multiple cost functions have been proposed.
Luer-Villagra, Armin +2 more
openaire +2 more sources
Computers & Industrial Engineering, 2013
This paper deals with the uncapacitated multiple allocation p-hub median problem (UMApHMP). An electromagnetism-like (EM) method is proposed for solving this NP-hard problem. Our new scaling technique, combined with the movement based on the attraction-repulsion mechanism, directs the EM towards promising search regions.
openaire +1 more source
This paper deals with the uncapacitated multiple allocation p-hub median problem (UMApHMP). An electromagnetism-like (EM) method is proposed for solving this NP-hard problem. Our new scaling technique, combined with the movement based on the attraction-repulsion mechanism, directs the EM towards promising search regions.
openaire +1 more source