A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
From MaRDI portal
Publication:1761153
DOI10.1016/j.cor.2011.11.004zbMath1251.90329OpenAlexW2164715532MaRDI QIDQ1761153
I. Landa-Torres, O. Alonso-Garrido, Sancho Salcedo-Sanz, José Antonio Portilla-Figueras, Sergio Gil-López, Javier Del Ser
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.11.004
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (7)
A matheuristic for large-scale capacitated clustering ⋮ Dynamic community partitioning for e-commerce last mile delivery with time window constraints ⋮ Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS ⋮ Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery ⋮ Model-based capacitated clustering with posterior regularization ⋮ A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms ⋮ Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem
Uses Software
Cites Work
- Unnamed Item
- A genetic algorithm for solving a capacitated \(p\)-median problem
- Density based problem space search for the capacitated clustering \(p\)-median problem
- Solving capacitated clustering problems
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- A hybrid grouping genetic algorithm for the cell formation problem
- An effective VNS for the capacitated \(p\)-median problem
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- A bionomic approach to the capacitated \(p\)-median problem
- Two exact algorithms for the capacitated \(p\)-median problem
- A column generation approach to capacitated \(p\)-median problems
- A tabu search heuristic and adaptive memory procedure for political districting
- Two new algorithms for UMTS access network topology design
- A scatter search heuristic for the capacitated clustering problem
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- CF-GGA: A grouping genetic algorithm for the cell formation problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- A new method for solving capacitated location problems based on a set partitioning approach
This page was built for publication: A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
