An efficient memetic algorithm for the uncapacitated single allocation hub location problem

Soft Computing

Volumn 17, Issue 3, 2013, Pages 445-466

  Marić, Miroslav ^a   Stanimirović, Zorica ^a   Stanojević, Predrag ^a  

^a UNIVERSITY OF BELGRADE   (Serbia)

Author keywords

Hub location problems; Local search; Memetic algorithms; Network design

Indexed keywords

HEURISTIC ALGORITHMS; HEURISTIC METHODS; LOCAL SEARCH (OPTIMIZATION);

COMPUTATIONAL EXPERIMENT; HEURISTIC APPROACH; HUB LOCATION PROBLEMS; LOCAL SEARCH; LOCAL SEARCH HEURISTICS; MEMETIC ALGORITHMS; NETWORK DESIGN; TIME-OPTIMAL SOLUTION;

LOCATION;

EID: 84873749523     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-012-0919-0     Document Type: Article

References (41)

1. Abdinnour-Helm S (1998) A hybrid heuristic for the uncapacitated hub location problem. Eur J Oper Res 106: 489-499.
2. Abdinnour-Helm S, Venkataramanan MA (1998) Solution approaches to hub location problems. Annals Oper Res 78: 31-50.
3. Acampora G, Cadenas JM, Loia V, Ballester EM (2011) Achieving memetic adaptability by means of agent-based machine learning. IEEE Trans Ind Inform 7(4): 557-569.
4. Acampora G, Loia V, Salerno S, Vitiello A (2012) A hybrid evolutionary approach for solving the ontology alignment problem. Int J Intell Syst 27(3): 189-216.
5. Alumur S, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190(1): 1-21.
6. Beasley JE (1996) Obtaining test problems via internet. J Global Optim 8(4): 429-433.
7. Campbell JF, Ernst A, Krishnamoorthy M (2002) Hub location problems. In: Hamacher H, Drezner Z (eds) Location theory: applications and theory. Springer, Berlin/Heidelberg, pp 373-407.
8. Chen JA (2007) A hybrid heuristic for the uncapacitated single allocation hub location problem. OMEGA Int J Manag Sci 35: 211-220.
9. Crescenci P, Kann V (1997) A compendium of NP optimization problems. http://www. nada. kth. se/theory/problemlist. html.
10. Cunha CB, Silva MR (2007) A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil. Eur J Oper Res 179: 747-758.
11. Ernst AT, Krishnamoorthy M (1998) Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur J Oper Res 104: 100-112.
12. Ernst AT, Krishnamoorthy M (1999) Solution algorithms for the capacitated single allocation hub location problem. Annals Oper Res 86: 141-159.
13. Filipović V (2003) Fine-grained tournament selection operator in genetic algorithms. Comput Inform 22: 143-161.
14. Filipović V, Kratica J, Tošić D, Dugošija Dj (2009) GA inspired heuristic for uncapacitated single allocation hub location problem. Adv Soft Comput 58: 149-158.
15. Galinier P, Boujbel Z, Fernandes MC (2011) An efficient memetic algorithm for the graph partitioning problem. Annals Oper Res 191(1): 1-22.
16. Garey MR, Johnson DS (1979) Computers and Intractibility: a guide to the theory of NP completness. W. H. Freeman and Co., San Francisco.
17. Goh CK, Teoh EJ, Tan KC (2009) A hybrid evolutionary approach for heterogeneous multiprocessor scheduling. Soft Comput 13(8-9): 833-846.
18. Ilić A, Urošević D, Brimberg J, Mladenović N (2010) A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur J Oper Res 206: 289-300.
19. Ishibuchi H, Hitotsuyanagi Y, Tsukamoto N, Nojima Y (2009) Use of biased neighborhood structures in multiobjective memetic algorithms. Soft Comput 13(8-9): 795-810.
20. Klincewicz JG (1991) Heuristics for the p-hub location problem. Eur J Oper Res 53: 25-37.
21. Klincewicz JG (1992) Avoiding local optima in the p-hub location problem using tabu search and GRASP. Annals Oper Res 40: 283-302.
22. Kratica J, Milanović M, Stanimirović Z, Tošić D (2011) An evolutionary-based approach for solving a capacitated hub location problem. Appl Soft Comput 11(2): 1858-1866.
23. Labbé M, Yaman H (2004) Projecting flow variables for hub location problems. Networks 44(2): 84-93.
24. Michalewicz Z (1996) Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Berlin.
25. Moscato PA, Cotta C (2003) A gentle introduction to memetic algorithms. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic Press, Boston, pp 105-144.
26. Moscato PA, Cotta C (2007) Memetic algorithms. In: Gonzáles T (ed) Handbook of approximation algorithms and metaheuristics. Taylor&Francis, London, (ch. 27).
27. Neri F, Cotta C, Moscato P (2012) Handbook of memetic algorithms. Studies in computational intelligence, vol. 379. Springer, Berlin/Heidelberg.
28. O'Kelly, ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur J Oper Res 32: 393-404.
29. O'Kelly ME (1992) Hub facility location with fixed costs. J Reg Sci Assoc Int 3(71): 293-306.
30. Özcan E, Başaran C (2009) A case study of memetic algorithms for constraint optimization. Soft Comput 13(8-9): 871-882.
31. Prins C, Prodhon C, Calvo R (2006) A memetic algorithm with population management (MA{pipe}PM) for the capacitated location-routing problem. Evol Comput Comb Optim 3906: 181-192.
32. Ribeiro CC, Hansen P (2002) Essays and surveys in metaheuristics. Kluwer Academic, Boston.
33. Silva MR, Cunha CB (2009) New simple and efficient heuristics for the uncapacitated single allocation hub location problem. Computers Oper Res 36: 3152-3165.
34. Skorin-Kapov D, Skorin-Kapov J (1994) On tabu search for the location of interacting hub facilities. Eur J Oper Res 73: 502-509.
35. Soak SM, Lee SW, Mahalik NP, Ahn A BH (2006) New memetic algorithm using particle swarm optimization and genetic algorithm. Lect Notes Computer Sci 4251: 122-129.
36. Stanimirović Z (2007) Solving the capacitated single allocation hub location problem using genetic algorithm. In: Skiadas CH (ed) Recent advances in stochastic modelling and data analysis. World Scientific Publishing Co Pte Ltd, pp 464-471.
37. Stanimirović Z, Kratica J, Dugošija Dj (2007) Genetic algorithms for solving the discrete ordered median problem. Eur J Oper Res 182: 983-1001.
38. Stanimirović Z (2008) An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem. Control Cybern 37(3): 669-692.
39. Stanimirović Z (2010) A genetic algorithm approach for the capacitated single allocation p-hub median problem. Comput Inform 29(1): 117-132.
40. Topcuoglu H, Court F, Ermis M, Yilmaz G (2005) Solving the uncapacitated hub location problem using genetic algorithms. Computers Oper Res 32: 967-984.
41. Wang H, Wan D, Yang S (2009) A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems. Soft Comput 13 (8-9): 763-780.