On solving complex multi-period location models using simulated annealing.

DOI10.1016/S0377-2217(00)00051-5zbMath1068.90577MaRDI QIDQ5932034

Antńio Antunes, Dominique Peeters

Publication date: 2001

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

zbMATH Keywords

Capacity expansionLocationSimulated annealing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ Efficient primal-dual heuristic for a dynamic location problem ⋮ A multi-period shelter location-allocation model with evacuation orders for flood disasters ⋮ Solving a dynamic facility location problem with partial closing and reopening ⋮ A computational comparison of several formulations for the multi-period incremental service facility location problem ⋮ Dynamic location of modular manufacturing facilities with relocation of individual modules ⋮ Location and design decisions of facilities in a distribution system with elastic customer demand ⋮ A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties ⋮ Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities ⋮ GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM ⋮ A hierarchical location model for public facility planning ⋮ Multi-period capacitated location with modular equipments ⋮ Integrated facility location and capacity planning under uncertainty ⋮ Speed-up simulated annealing by parallel coordinates ⋮ On the capacitated concentrator location problem: a reformulation by discretization ⋮ Heuristics for the dynamic facility location problem with modular capacities ⋮ Modeling and solving a logging camp location problem ⋮ Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning ⋮ Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing

Uses Software

• MINTO

Cites Work

• On the use of tree indexing methods in transportation algorithms
• MINTO, a Mixed INTeger Optimizer
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• The Multiregion Dynamic Capacity Expansion Problem, Part II
• A Dual-Based Procedure for Dynamic Facility Location
• An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
• Dynamic facility location: The progressive p-median problem
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item