A perturbation heuristic for a class of location problems

DOI10.1057/PALGRAVE.JORS.2600485MaRDI QIDQ4383675zbMATH OpenOpenAlexFDO

Authors

Publication date 2 April 1998

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600485

zbMATH Keywords

heuristicuncapacitated location

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 2209653
• Heuristic Methods for Location-Allocation Problems
• A Dual-Based Add Heuristic for Uncapacitated Facility Location
• A perturbation-based heuristic for the capacitated multisource Weber problem
• Heuristics for location models

Cited in

(11)

• Local improvement in planar facility location using vehicle routing
• GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem
• On statistical bounds of heuristic solutions to location problems
• An adaptive perturbation-based heuristic: an application to the continuous p-centre problem
• Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
• Subdrop: A modified drop heuristic for location problems
• Heuristics for location models
• Defining tabu list size and aspiration criterion within tabu search methods
• Good solutions to discrete noxious location problems via metaheuristics
• A continuous location-allocation problem with zone-dependent fixed cost
• The \(p\)-median problem: a survey of metaheuristic approaches

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: A perturbation heuristic for a class of location problems

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