The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
type: Item
instance of: scholarly article
title: The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
zbMATH Open document ID: 1380.90169
author: Chandra Ade Irawan
author: Said Salhi
author: Martino Luis
author: Nader Azizi
published in: European Journal of Operational Research
publication date: 2018-02-06T00:00:00Z
full work available at URL: The continuous single source location problem with capacity and zone.pdf
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6835208
zbMATH Keywords: location
zbMATH Keywords: continuous space
zbMATH Keywords: capacity and fixed cost
zbMATH Keywords: single-source
zbMATH Keywords: matheuristics
Wikidata QID: Q57934083
describes a project that uses: CPLEX
MaRDI profile type: Publication
OpenAlex ID: W2604470732
cites work: Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
cites work: New heuristic methods for the capacitated multi-facility Weber problem
cites work: Q3500144
cites work: Efficient heuristics for the rectilinear distance 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: Q3598873
cites work: A new local search for continuous location problems
cites work: Location-Allocation Problems
cites work: Heuristic Methods for Location-Allocation Problems
cites work: The Transportation-Location Problem
cites work: A Lagrangean heuristic for a modular capacitated location problem
cites work: Bounds for the single source modular capacitated plant location problem
cites work: A multi-objective heuristic approach for the casualty collection points location problem
cites work: Algorithms for the decomposition of a polygon into convex polygons
cites work: A cellular heuristic for the multisource Weber problem.
cites work: A heuristic for BILP problems: the single source capacitated facility location problem
cites work: Heuristic solution of the multisource Weber problem as a \(p\)-median problem
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: Region-rejection based heuristics for the capacitated multi-source Weber problem
cites work: A guided reactive GRASP for the capacitated multi-source Weber problem
cites work: Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: A hybrid firefly-genetic algorithm for the capacitated facility location problem
cites work: A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand
cites work: A fast swap-based local search procedure for location problems
cites work: The effect of ignoring routes when locating depots
cites work: Q4826161
cites work: Local improvement in planar facility location using vehicle routing
cites work: On solving large instances of the capacitated facility location problem
cites work: NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
cites work: A squared-euclidean distance location-allocation problem
cites work: A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
cites work: Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems
cites work: Q5767400
cites work: A perturbation-based heuristic for the capacitated multisource Weber problem
DBLP publication ID: journals/eor/IrawanSLA17
DOI: 10.1016/J.EJOR.2017.04.004
description: scientific article; zbMATH DE number 6835208