The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches

DOI10.1016/J.EJOR.2017.04.004MaRDI QIDQ1695018zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Chandra Ade Irawan, Said Salhi, Martino Luis, Nader Azizi

Publication date 6 February 2018

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

Full work available at URL https://kar.kent.ac.uk/61599/1/The%20continuous%20single%20source%20location%20problem%20with%20capacity%20and%20zone.pdf

zbMATH Keywords

capacity and fixed costcontinuous spacelocationmatheuristicssingle-source

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
• The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
• A continuous location-allocation problem with zone-dependent fixed cost
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
• The multi-source Weber problem with constant opening cost

Cites work

• A cellular heuristic for the multisource Weber problem.
• A continuous location-allocation problem with zone-dependent fixed cost
• A fast swap-based local search procedure for location problems
• A guided reactive GRASP for the capacitated multi-source Weber problem
• A heuristic for BILP problems: the single source capacitated facility location problem
• A hybrid firefly-genetic algorithm for the capacitated facility location problem
• A Lagrangean heuristic for a modular capacitated location problem
• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
• A multi-objective heuristic approach for the casualty collection points location problem
• A new local search for continuous location problems
• A perturbation-based heuristic for the capacitated multisource Weber problem
• A squared-euclidean distance location-allocation problem
• A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand
• Algorithms for the decomposition of a polygon into convex polygons
• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
• Bounds for the single source modular capacitated plant location problem
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• Global Optimization Procedures for the Capacitated Euclidean and l_p Distance Multifacility Location-Allocation Problems
• Heuristic Methods for Location-Allocation Problems
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• scientific article; zbMATH DE number 5282971 (Why is no real title available?)
• scientific article; zbMATH DE number 5501651 (Why is no real title available?)
• scientific article; zbMATH DE number 2114491 (Why is no real title available?)
• scientific article; zbMATH DE number 3027356 (Why is no real title available?)
• Local improvement in planar facility location using vehicle routing
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
• Location-Allocation Problems
• New heuristic methods for the capacitated multi-facility Weber problem
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• On solving large instances of the capacitated facility location problem
• On the Complexity of Some Common Geometric Location Problems
• Region-rejection based heuristics for the capacitated multi-source Weber problem
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
• Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
• The effect of ignoring routes when locating depots
• The multi-source Weber problem with constant opening cost
• The Transportation-Location Problem
• Variable neighbourhood search: methods and applications

Cited in

(8)

• Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities
• The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
• Single facility siting involving allocation decisions
• The location-allocation problem of drone base stations
• The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
• The multi-source Weber problem with constant opening cost
• The capacitated single-source \(p\)-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique
• A continuous location-allocation problem with zone-dependent fixed cost

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1695018)