The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
type: Item
instance of: scholarly article
title: The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
zbMATH Open document ID: 1465.90048
author: Chandra Ade Irawan
author: Said Salhi
author: Kusmaningrum Soemadi
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
full work available at URL: The continuous single-source capacitated multi-facility Weber problem with setup costs formulation and solution methods.pdf
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7340729
zbMATH Keywords: location on the plane
zbMATH Keywords: setup cost
zbMATH Keywords: single-source
zbMATH Keywords: VNS
zbMATH Keywords: simulated annealing
MaRDI profile type: Publication
OpenAlex ID: W2992467147
cites work: Location-Allocation Problems
cites work: The Transportation-Location Problem
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
cites work: Lower and upper bounds for a two-stage capacitated facility location problem with handling costs
cites work: The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
cites work: Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
cites work: A guided reactive GRASP for the capacitated multi-source Weber problem
cites work: Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
cites work: The multi-source Weber problem with constant opening cost
cites work: A continuous location-allocation problem with zone-dependent fixed cost
cites work: Heuristic Methods for Location-Allocation Problems
cites work: Variable neighborhood search for the p-median
cites work: Variable neighbourhood search: methods and applications
cites work: An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
cites work: Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
cites work: Optimization by Simulated Annealing
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Robust optimization with simulated annealing
cites work: Handbook of Natural Computing
cites work: An efficient implementation of parallel simulated annealing algorithm in GPUs
cites work: Improving simulated annealing through derandomization
cites work: Region-rejection based heuristics for the capacitated multi-source Weber problem
cites work: Local improvement in planar facility location using vehicle routing
DOI: 10.1007/S10898-019-00862-2
description: scientific article; zbMATH DE number 7340729