The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods

DOI10.1007/s10898-019-00862-2zbMath1465.90048OpenAlexW2992467147MaRDI QIDQ2022209

Said Salhi, Chandra Ade Irawan, Kusmaningrum Soemadi

Publication date: 28 April 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: http://eprints.nottingham.ac.uk/59777/1/The%20continuous%20single-source%20capacitated%20multi-facility%20Weber%20problem%20with%20setup%20costs%20formulation%20and%20solution%20methods.pdf

zbMATH Keywords

simulated annealingVNSsetup costsingle-sourcelocation on the plane

Mathematics Subject Classification ID

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

Related Items (2)

A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification ⋮ Preface to the special issue ``ICVNS 2018

Cites Work

• Optimization by Simulated Annealing
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
• A guided reactive GRASP for the capacitated multi-source Weber problem
• Robust optimization with simulated annealing
• A continuous location-allocation problem with zone-dependent fixed cost
• Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
• Variable neighbourhood search: methods and applications
• Region-rejection based heuristics for the capacitated multi-source Weber problem
• Local improvement in planar facility location using vehicle routing
• The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
• Improving simulated annealing through derandomization
• An efficient implementation of parallel simulated annealing algorithm in GPUs
• Lower and upper bounds for a two-stage capacitated facility location problem with handling costs
• On the Complexity of Some Common Geometric Location Problems
• Handbook of Natural Computing
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• Location-Allocation Problems
• Variable neighborhood search for the p-median
• Heuristic Methods for Location-Allocation Problems
• The multi-source Weber problem with constant opening cost
• Equation of State Calculations by Fast Computing Machines
• The Transportation-Location Problem

This page was built for publication: The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods