SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM

DOI10.1142/S0217595906001042zbMath1202.90175OpenAlexW2164744463MaRDI QIDQ3421858

Zorica Stanimirović, Jozef Kratica

Publication date: 8 February 2007

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595906001042

zbMATH Keywords

genetic algorithmsdiscrete location problemsp-hub center problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (8)

Computing the metric dimension of graphs by genetic algorithms ⋮ Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ Skyport location problem for urban air mobility system ⋮ The uncapacitated r‐allocation p‐hub center problem ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations ⋮ LOCATING SUGAR CANE LOADING STATIONS UNDER VARIATIONS IN CANE SUPPLY ⋮ Single-allocation ordered median hub location problems

Cites Work

• Unnamed Item
• A hybrid heuristic for the uncapacitated hub location problem
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems

This page was built for publication: SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM