Constructive heuristics for the uncapacitated continuous location-allocation problem

DOI10.1057/PALGRAVE.JORS.2601176zbMATH Open1131.90407OpenAlexW2076266895MaRDI QIDQ4658472FDOQ4658472

Authors:

Publication date: 16 March 2005

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601176

Recommendations

• Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
• scientific article
• Heuristic Methods for Location-Allocation Problems
• Heuristics for a continuous multi-facility location problem with demand regions
• Neighborhood search heuristics for the uncapacitated facility location problem
• The heuristic concentration-integer and its application to a class of location problems
• A Heuristic for the Capacitated Single Allocation Hub Location Problem
• New simple and efficient heuristics for the uncapacitated single allocation hub location problem
• A hybrid heuristic for the uncapacitated hub location problem

zbMATH Keywords

heuristicslocationcontinuous space

Mathematics Subject Classification ID

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

Cited In (19)

• Title not available (Why is that?)
• On the convergence of the Cooper's algorithm
• Accelerating the convergence in the single-source and multi-source Weber problems
• A continuous location-allocation problem with zone-dependent fixed cost
• A guided reactive GRASP for the capacitated multi-source Weber problem
• Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
• Region-rejection based heuristics for the capacitated multi-source Weber problem
• A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
• Title not available (Why is that?)
• A hierarchical algorithm for the planar single-facility location routing problem
• An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem
• A perturbation-based heuristic for the capacitated multisource Weber problem
• A cellular heuristic for the multisource Weber problem.
• A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification
• Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem
• A new local search for continuous location problems
• A heuristic method to solve the location and machine selection problem in a two-dimensional continuous area
• 2-facility manifold location routing problem

This page was built for publication: Constructive heuristics for the uncapacitated continuous location-allocation problem

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