Parallel genetic algorithm for the uncapacited single allocation hub location problem on GPU

Author(s):  
Abdelhamid Benaini ◽  
Achraf Berrajaa ◽  
Jaouad Boukachour ◽  
Mustapha Oudani
2015 ◽  
Vol 62 ◽  
pp. 224-236 ◽  
Author(s):  
Haluk Damgacioglu ◽  
Derya Dinler ◽  
Nur Evin Ozdemirel ◽  
Cem Iyigun

1970 ◽  
Vol 24 (5) ◽  
pp. 433-440 ◽  
Author(s):  
Jasmina Pašagić Škrinjar ◽  
Kristijan Rogić ◽  
Ratko Stanković

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.


2018 ◽  
Vol 54 ◽  
pp. 151-169 ◽  
Author(s):  
Mahdi Bashiri ◽  
Mohammad Rezanezhad ◽  
Reza Tavakkoli-Moghaddam ◽  
Hamid Hasanzadeh

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

Sign in / Sign up

Export Citation Format

Share Document