Greedy random adaptive memory programming search for the capacitated clustering problem
From MaRDI portal
Publication:707129
DOI10.1016/j.ejor.2003.08.066zbMath1132.90363OpenAlexW2009571298MaRDI QIDQ707129
Ibrahim. H Osman, Samad Ahmadi
Publication date: 9 February 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.08.066
Capacitated clustering (\(p\)-median) problemAnt colony optimizationAdaptive memory programmingDensity searchGreedy randomized adaptive search procedureGuided construction search metaheuristic
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach, A heuristic method for the vehicle routing problem with mixed deliveries and pickups, STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES, Adaptive memory programming for the vehicle routing problem with multiple trips, A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling, A redistricting problem applied to meter reading in power distribution networks, A matheuristic for large-scale capacitated clustering, Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS, Some Guidelines for Genetic Algorithm Implementation in MINLP Batch Plant Design Problems, An effective VNS for the capacitated \(p\)-median problem, A reactive GRASP with path relinking for capacitated clustering, Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction, A multi-product production/distribution system design problem with direct shipments and lateral transshipments, A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem, PCB assembly scheduling for collect-and-place machines using genetic algorithms, An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls, Matheuristics for the capacitated p‐median problem, The capacitated centred clustering problem
Uses Software
Cites Work
- Density based problem space search for the capacitated clustering \(p\)-median problem
- Solving capacitated clustering problems
- A probabilistic heuristic for a computationally difficult set covering problem
- A bionomic approach to the capacitated \(p\)-median problem
- Modelling location and sizing of offshore platforms
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- Cluster analysis and mathematical programming
- Clustering of objects and attributes for manufacturing and marketing applications
- Metaheuristics: A bibliography
- Probabilistic diversification and intensification in local search for vehicle routing
- GRASP with Path Relinking for Three-Index Assignment
- An annotated bibliography of GRASP-Part II: Applications
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- A new method for solving capacitated location problems based on a set partitioning approach
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
