Article2012

A Genetic Algorithm Approach for the Capacitated Single Allocation P-Hub Median Problem

52 citations0/0 files stored

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Facility Location and Emergency Management Metaheuristic Optimization Algorithms Research Vehicle Routing Optimization Methods

Abstract

In this paper the Capacitated Single Allocation p-Hub Median Problem (CSApHMP) is considered. This problem has a wide range of applications within the design of telecommunication and transportation systems. A heuristic method, based on a genetic algorithm (GA) approach, is proposed for solving the CSApHMP. The described algorithm uses binary encoding and modified genetic operators. The caching technique is also implemented in the GA in order to improve its effectiveness. Computational experiments demonstrate that the GA method quickly reaches optimal solutions for hub instances with up to 50 nodes. The algorithm is also benchmarked on large scale hub instances with up to 200 nodes that are not solved to optimality so far.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 52 citations exist upstream.

References

1994Integer programming formulations of discrete hub location problems 2002Hub Location Problems 2003Solving the uncapacitated hub location problem using genetic algorithms 2006Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem 1998Solution approaches to hub location problems

Cited by

2010An evolutionary-based approach for solving a capacitated hub location problem 2017Finding p -Hub Median Locations: An Empirical Study on Problems and Solution Techniques 2017Opposition-based learning for competitive hub location: A bi-objective biogeography-based optimization algorithm 2021Tabu search with simulated annealing for solving a location–protection–disruption in hub network 2012An efficient memetic algorithm for the uncapacitated single allocation hub location problem

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.