Solving the uncapacitated multiple allocation p-hub center problem by genetic algorithm

Asia-Pacific Journal of Operational Research

Volumn 23, Issue 4, 2006, Pages 425-437

  Kratica, Jozef ^a   Stanimirović, Zorica ^b  

^a MATHEMATICAL INSTITUTE   (Serbia)

^b UNIVERSITY OF BELGRADE   (Serbia)

Author keywords

Discrete location problems; Genetic algorithms; P hub center problem

Indexed keywords

BINARY CODES; COMPUTATION THEORY; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

COMPUTATIONAL TIME; DISCRETE LOCATION PROBLEMS; P-HUB CENTER PROBLEM; STANDARD HUBS;

GENETIC ALGORITHMS;

EID: 33846332738     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595906001042     Document Type: Article

References (15)

1. Back, T, DB Fogel and Z Michalewicz (2000). Evolutionary Computation 1: Basic Algorithms and Operators, Evolutionary Computation 2: Advanced Algorithms and Operators. Bristol, Philadelphia: Institute of Physics Publishing.
2. Campbell, JF (1994). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72, 387-405.
3. Campbell, JF, A Ernst and M Krishnamoorthy (2002). Hub location problems. In Location Theory: Applications and Theory, Z. Drezner and H Harnacher (eds.), pp. 373-407, Berlin-Heidelberg: Springer-Verlag.
4. Ernst, AT and M Krishnamoorthy (1998). An exact solution approach based on shortest-paths for p-hub median problem. INFORMS Journal of Computing, 10, 149-162.
5. Ernst, AT, H Hamacher, H Jiang M Krishnamoorthy and G Woeginger (2006a). Heuristic algorithms for the uncapacitated hub center single allocation problem (to appear).
6. Ernst, AT, H Harnacher, H Jiang, M Krishnamoorthy and G Woeginger (2006b). Uncapacitated single and multiple allocation p-hub center problems (to appear).
7. Filipović, V (2003). Fine-grained tournament selection operator in genetic algorithms. Computing and Informatics, 22(2), 143-161.
8. Helm, AS (1998). A hybrid heuristic for the uncapacitated hub location problem. European Journal of Operational Research, 106, 489-499.
9. Holland, JH (1975). Adaptation in Natural and Artificial Systems. Ann Arbor: The University of Michigan Press.
10. O'Kelly, ME and HJ Miller (1991). Solution strategies for the single facility minimax hub location problem. Papers in Regional Science: The Journal of the RSAI, 70, 367-380.
11. Kratica, J (1999). Improving performances of the genetic algorithm by caching. Computers and Artificial Intelligence, 18(3), 271-283.
12. Kratica, J (2000). Parallelization of genetic algorithms for solving some NP-complete problems (in Serbian). PhD thesis, Faculty of Mathematics, University of Belgrade.
13. Ljubić, I (2004). Exact and memetic algorithms for two network design problems. PhD thesis, Institute of Computer Graphics, Vienna University of Technology.
14. Pérez, PM, F Almeida Rodrguez and JM Moreno Vega (2004). On the use of the path relinking for the p-hub median problem. Lecture Notes in Computer Science, 3004. 155-164.
15. Stanimirović, Z (2004). Solving some discrete location problems by using genetic algorithms (in Serbian). Master's thesis, Faculty of Mathematics, University of Belgrade, Belgrade.