Results 221 to 230 of about 21,404 (260)

Multiple allocation hub covering flow problem under uncertainty

Annals of Operations Research, 2022
The hub covering problem can be viewed as a combination of the set covering and the hub location problem. In a traditional hub covering problem, all parameters are assumed to be deterministic. However, neglecting uncertainties associated with demand and transportation costs may lead to inferior solutions.
Nazmi Sener, Orhan Feyzioglu
openaire   +2 more sources

The hub covering flow problem

Journal of the Operational Research Society, 2013
The hub covering flow problem (HCFP) seeks to find the minimal cost hub-and-spoke network by optimally locating hub nodes and assigning non-hub nodes to the hub nodes subject to a coverage constraint. The cost of establishing such a hub network is based on a fixed cost of opening hubs and the cost of transporting demand flow through the network.
T J Lowe, T Sim
openaire   +2 more sources

The hierarchical hub maximal covering problem with determinate cover radiuses

2010 IEEE International Conference on Industrial Engineering and Engineering Management, 2010
Hierarchical facility location problems with three levels deal with location of facilities in any level and assignment traffic to given routing. Hub covering problems covered the demand nodes, if they are within a particular radius of a facility that can supply their demand.
R. Sahraeian, E. Korani
openaire   +1 more source

Hub Covering Location Problem under Capacity Constraints

2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation, 2010
The hub location problem appears in a variety of applications including airline systems, cargo delivery systems, and telecommunication network design. When we analyze hub location applications separately, we observe that each area has its own characteristics. In this paper, we study the single allocation hub covering problem under capacity constraints (
Reza Ghodsi, Mehrdad Mohammadi, Hamideh Rostami   +2 more
openaire   +1 more source

Uncapacitated single allocation p-hub maximal covering problem

Computers & Industrial Engineering, 2012
The hub location problem is to find a set of hub nodes on the network, where logistics transportation via the hubs is encouraged because of the cost or distance savings. Each node that has a specified amount of demands can be connected to one of p hubs.
Young Ha Hwang, Young Hoon Lee
openaire   +1 more source

Hub Cover Pebbling Number

Ars Combinatoria
The hub cover pebbling number, h ∗ ( G ) , of a graph $G$, is the least non-negative integer such that from all distributions of h ∗ ( G ) pebbles over the vertices of G , it is possible to place at least one pebble each on every vertex of a set of vertices of a hub set for G using a sequence of pebbling move operations, each pebbling move ...
A. Lourdusamy, F. Joy Beaula, F. Patrick
openaire   +1 more source

Model formulations for hub covering problems

Journal of the Operational Research Society, 2008
Summary: Improved model formulations for hub covering problems are proposed. We discuss multiple and single allocation problems, including non-increasing quantity-dependent transport time functions for transport links for the latter case. Computational results are presented, which show that the new solution approaches for problems with quantity ...
openaire   +1 more source

Evolutionary Algorithms for Multiple Allocation Hub Set Covering Problem

2008 IEEE International Conference on Networking, Sensing and Control, 2008
We consider the multiple allocation hub set covering problem (MAHSCP): requiring all O-D flow to reach the destination optionally passing through one or two hubs in a limited time, cost or distance, what is the optimal way to locate hubs at minimal cost.
Kerui Weng, Yijuan Wang
openaire   +1 more source