A double annealing algorithm for discrete location/allocation problems

DOI10.1016/0377-2217(95)98957-2zbMath0914.90228OpenAlexW2101963125MaRDI QIDQ1390233

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

simulated annealing\(P\)-median problemdouble-annealing algorithm

Mathematics Subject Classification ID

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

Related Items (3)

An effective heuristic for the \(P\)-median problem with application to ambulance location ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem ⋮ A model and methodologies for the location problem with logistical components

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• ``Neural computation of decisions in optimization problems
• Annealing algorithms for multisource absolute location problems on graph
• An Axiomatic Approach to Location on Networks
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• A Dual-Bounded Algorithm for the p-Median Problem
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Technical Note—An Algorithm for the p-Median Problem
• Heuristic Methods for Location-Allocation Problems
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median

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