Capacitated clustering problems by hybrid simulated annealing and tabu search
From MaRDI portal
Publication:4888241
DOI10.1016/0969-6016(94)90032-9zbMath0857.90107OpenAlexW2139869884MaRDI QIDQ4888241
Ibrahim. H Osman, Nicos Christofides
Publication date: 30 October 1996
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0969-6016(94)90032-9
tabu searchconstructive heuristichybrid simulated annealingcapacitated clustering problemplant locationcapacitated \(p\)-median\(\lambda\)-interchange generation mechanism
Related Items
STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES, Capacitated \(p\)-center problem with failure foresight, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Continuous optimization by a variant of simulated annealing, A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm, Dynamic tabu search strategies for the traveling purchaser problem, A tabu search algorithm for frequency assignment, Metaheuristics: A bibliography, Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint, A matheuristic for large-scale capacitated clustering, An efficient heuristic algorithm for the capacitated \(p\)-median problem, Thirty years of International Transactions in Operational Research: past, present, and future direction, Systematic reviews as a metaknowledge tool: caveats and a review of available options, Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS, The capacitated plant location problem with multiple facilities in the same site, A New Composite Algorithm for Clustering Problems, Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices, Local Search Algorithms for the Maximal Planar Layout Problem, A hybrid algorithm for identifying global and local minima when optimizing functions with many minima., A nested simulated annealing algorithm, A column generation approach to capacitated \(p\)-median problems, An effective VNS for the capacitated \(p\)-median problem, Categorical data fuzzy clustering: an analysis of local search heuristics, An iterated local search for the budget constrained generalized maximal covering location problem, Ant colony optimization for finding medians of weighted graphs, A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem, Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction, Variable neighborhood search: Principles and applications, A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem, Greedy random adaptive memory programming search for the capacitated clustering problem, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, Model-based capacitated clustering with posterior regularization, Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem, A new method for solving capacitated location problems based on a set partitioning approach, Pharmacy duty scheduling problem, A computational evaluation of a general branch-and-price framework for capacitated network location problems, Clustering search algorithm for the capacitated centered clustering problem, The obnoxious \(p\) facility network location problem with facility interaction, Heuristic approaches to vehicle routing with backhauls and time windows, Lagrangean duals and exact solution to the capacitated \(p\)-center problem, An approximation algorithm for the uniform capacitated \(k\)-means problem, The band collocation problem, Matheuristics for the capacitated p‐median problem, A scatter search heuristic for the capacitated clustering problem, Hybrid scatter search and path relinking for the capacitated \(p\)-median problem, The capacitated centred clustering problem, A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
