A single allocation hub location and pricing problem

2019 ◽  
Vol 39 (1) ◽  
Author(s):  
Dimitrije D. Čvokić ◽  
Zorica Stanimirović
Keyword(s):  
Hub Location ◽  
Single Allocation

scholarly journals Location of Urban Logistic Terminals as Hub Location Problem

1970 ◽  
Vol 24 (5) ◽  
pp. 433-440 ◽  
Author(s):  
Jasmina Pašagić Škrinjar ◽  
Kristijan Rogić ◽  
Ratko Stanković
Keyword(s):  
Location Problem ◽  
Location Problems ◽  
Heuristic Methods ◽  
Hub Location ◽  
Hub Location Problem ◽  
Telecommunication Systems ◽  
Big Cities ◽  
Np Problems ◽  
Delivery Networks ◽  
Single Allocation

In this paper the problems of locating urban logistic terminals are studied as hub location problems that due to a large number of potential nodes in big cities belong to hard non-polynomial problems, the so-called NP-problems. The hub location problems have found wide application in physical planning of transport and telecommunication systems, especially systems of fast delivery, networks of logistic and distribution centres and cargo traffic terminals of the big cities, etc. The paper defines single and multiple allocations and studies the numerical examples. The capacitated single allocation hub location problems have been studied, with the provision of a mathematical model of selecting the location for the hubs on the network. The paper also presents the differences in the possibilities of implementing the exact and heuristic methods to solve the actual location problems of big dimensions i.e. hub problems of the big cities.

Single-allocation ordered median hub location problems

2011 ◽  
Vol 38 (2) ◽  
pp. 559-570 ◽  
Author(s):  
J. Puerto ◽  
A.B. Ramos ◽  
A.M. Rodríguez-Chía
Keyword(s):  
Location Problems ◽  
Hub Location ◽  
Ordered Median ◽  
Single Allocation

A parallel heuristics for the single allocation hub location problem

2017 ◽  
Vol 15 (7) ◽  
pp. 1278-1285 ◽  
Author(s):  
Rodrigo de Carvalho ◽  
Ricardo Saraiva de Camargo ◽  
Alexandre Xavier Martins ◽  
Rodney Rezende Saldanha
Keyword(s):  
Location Problem ◽  
Hub Location ◽  
Hub Location Problem ◽  
Single Allocation

scholarly journals Capacitated single allocation hub location problem—A bi-criteria approach

2008 ◽  
Vol 35 (11) ◽  
pp. 3671-3695 ◽  
Author(s):  
Maria da Graça Costa ◽  
Maria Eugénia Captivo ◽  
João Clímaco
Keyword(s):  
Location Problem ◽  
Hub Location ◽  
Hub Location Problem ◽  
Single Allocation

scholarly journals An artificial immune system algorithm for solving the uncapacitated single allocation p-Hub median problem

2021 ◽  
Vol 11 (3) ◽  
pp. 2293
Author(s):  
Fatima Zahraa Grine ◽  
Oulaid Kamach ◽  
Abdelhakim Khatab ◽  
Naoufal Sefiani
Keyword(s):  
Clonal Selection ◽  
Artificial Immune Systems ◽  
Data Sets ◽  
Clonal Selection Algorithm ◽  
Artificial Immune ◽  
Hub Location ◽  
Median Problem ◽  
Solution Quality ◽  
Artificial Immune System Algorithm ◽  
Single Allocation

The present paper deals with a variant of hub location problems (HLP): the uncapacitated single allocation p-Hub median problem (USApHMP). This problem consists to jointly locate hub facilities and to allocate demand nodes to these selected facilities. The objective function is to minimize the routing of demands between any origin and destination pair of nodes. This problem is known to be NP-hard. Based on the artificial immune systems (AIS) framework, this paper develops a new approach to efficiently solve the USApHMP. The proposed approach is in the form of a clonal selection algorithm (CSA) that uses appropriate encoding schemes of solutions and maintains their feasibility. Comprehensive experiments and comparison of the proposed approach with other existing heuristics are conducted on benchmark from civil aeronautics board, Australian post, PlanetLab and Urand data sets. The results obtained allow to demonstrate the validity and the effectiveness of our approach. In terms of solution quality, the results obtained outperform the best-known solutions in the literature.

Sign in / Sign up

Export Citation Format

Share Document