Good solutions to discrete noxious location problems via metaheuristics

DOI10.1007/BF02060482zbMath0782.90061MaRDI QIDQ689250

Rex K. Kincaid

Publication date: 20 December 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

simulated annealingtabu search\(p\)- dispersion\(p\)-defense-sumnoxious facility locationsemi-greedy heuristic

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem, A comparison of \(p\)-dispersion heuristics, Iterated tabu search for the maximum diversity problem, An integer programming approach for solving the \(p\)-dispersion problem, \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis, Location and layout planning. A survey, Metaheuristics: A bibliography, A review on discrete diversity and dispersion maximization from an OR perspective, Formulations and valid inequalities for the capacitated dispersion problem, A simple and effective algorithm for the MaxMin diversity problem, Heuristic solution approaches for the maximum minsum dispersion problem, Effective metaheuristic algorithms for the minimum differential dispersion problem, Transmitter location for maximum coverage and constructive-destructive interference management, Upper bounds and exact algorithms for \(p\)-dispersion problems, Iterated greedy for the maximum diversity problem, Measuring diversity. A review and an empirical analysis, A heuristic approach for the max-min diversity problem based on max-clique, The equitable dispersion problem, Integer-friendly formulations for the \(r\)-separation problem, Variable neighborhood search for the heaviest \(k\)-subgraph, GRASP and path relinking for the max-min diversity problem, The Location of Undesirable Facilities, On solving the densestk-subgraph problem on large graphs, A hybrid metaheuristic method for the maximum diversity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• The discrete p-dispersion problem
• Non-negative matrices and Markov chains. 2nd ed
• The discrete p-maxian location problem
• Comparison Of Four Models For dispersing Facilities
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Convergence of an annealing algorithm
• Simulated Annealing – An Annotated Bibliography
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• Tabu Search Applied to the Quadratic Assignment Problem
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set