Greedy random adaptive memory programming search for the capacitated clustering problem

DOI10.1016/J.EJOR.2003.08.066MaRDI QIDQ707129zbMATH OpenOpenAlexFDO

Authors Samad Ahmadi, Ibrahim. H Osman

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

zbMATH Keywords

Adaptive memory programmingAnt colony optimizationCapacitated clustering (\(p\)-median) problemDensity searchGreedy randomized adaptive search procedureGuided construction search metaheuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Clustering search algorithm for the capacitated centered clustering problem
• Tabu search and GRASP for the capacitated clustering problem
• Heuristic search to the capacitated clustering problem
• A scatter search heuristic for the capacitated clustering problem
• Solving capacitated clustering problems
• scientific article; zbMATH DE number 1488100
• Solving the capacitated clustering problem with variable neighborhood search
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• A matheuristic for large-scale capacitated clustering

Cites work

• scientific article; zbMATH DE number 3617544 (Why is no real title available?)
• scientific article; zbMATH DE number 1253051 (Why is no real title available?)
• scientific article; zbMATH DE number 978736 (Why is no real title available?)
• scientific article; zbMATH DE number 1054674 (Why is no real title available?)
• scientific article; zbMATH DE number 4189544 (Why is no real title available?)
• A bionomic approach to the capacitated \(p\)-median problem
• A new method for solving capacitated location problems based on a set partitioning approach
• A probabilistic heuristic for a computationally difficult set covering problem
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
• An annotated bibliography of GRASP-Part II: Applications
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Cluster analysis and mathematical programming
• Clustering of objects and attributes for manufacturing and marketing applications
• Density based problem space search for the capacitated clustering p-median problem
• Fundamentals of scatter search and path relinking
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• GRASP with path relinking for three-index assignment
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
• Metaheuristics: A bibliography
• Modelling location and sizing of offshore platforms
• Probabilistic diversification and intensification in local search for vehicle routing
• Solving capacitated clustering problems

Cited in

(21)

• scientific article; zbMATH DE number 1488100 (Why is no real title available?)
• PCB assembly scheduling for collect-and-place machines using genetic algorithms
• Exact methods and a variable neighborhood search for the robust capacitated p-median problem
• The capacitated centred clustering problem
• A multi-product production/distribution system design problem with direct shipments and lateral transshipments
• A heuristic method for the vehicle routing problem with mixed deliveries and pickups
• Tabu search and GRASP for the capacitated clustering problem
• Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
• A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
• A reactive GRASP with path relinking for capacitated clustering
• STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES
• Matheuristics for the capacitated p-Median problem
• A redistricting problem applied to meter reading in power distribution networks
• Adaptive memory programming for the vehicle routing problem with multiple trips
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction
• Some Guidelines for Genetic Algorithm Implementation in MINLP Batch Plant Design Problems
• A matheuristic for large-scale capacitated clustering
• An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls
• An effective VNS for the capacitated \(p\)-median problem
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach

Describes a project that uses

Uses Software

• Scatter Search
• GRASP

This page was built for publication: Greedy random adaptive memory programming search for the capacitated clustering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707129)