A double annealing algorithm for discrete location/allocation problems

DOI10.1016/0377-2217(95)98957-2MaRDI QIDQ1390233zbMATH OpenOpenAlexFDO

Authors Giovanni Righini

Publication date 14 July 1998

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/6f65cf87-5851-47de-a245-31f161dc269f

zbMATH Keywords

\(P\)-median problemdouble-annealing algorithmsimulated annealing

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• Using simulated annealing to solve routing and location problems
• Annealing algorithms for multisource absolute location problems on graph
• A statistical analysis of simulated annealing applied to the p-median problem
• Algorithms of ant system and simulated annealing for the \(p\)-median problem
• Simulated annealing: A tool for operational research

Cites work

• ``Neural computation of decisions in optimization problems
• A Dual-Bounded Algorithm for the p-Median Problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Axiomatic Approach to Location on Networks
• Annealing algorithms for multisource absolute location problems on graph
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Heuristic Methods for Location-Allocation Problems
• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• scientific article; zbMATH DE number 3648122 (Why is no real title available?)
• scientific article; zbMATH DE number 3847184 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Optimization by simulated annealing
• Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
• Technical Note—An Algorithm for the p-Median Problem
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem

Cited in

(6)

• Annealing algorithms for multisource absolute location problems on graph
• A model and methodologies for the location problem with logistical components
• Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
• Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
• An effective heuristic for the \(P\)-median problem with application to ambulance location
• Fifty years of metaheuristics

Describes a project that uses

Uses Software

• VRP

This page was built for publication: A double annealing algorithm for discrete location/allocation problems

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