A perturbation-based heuristic for the capacitated multisource Weber problem

DOI10.1016/J.EJOR.2005.09.050zbMATH Open1127.90048OpenAlexW2058023679MaRDI QIDQ864040FDOQ864040

Authors: Zaitul Marlizawati Zainuddin, Said Salhi 

Publication date: 12 February 2007

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

Full work available at URL: https://kar.kent.ac.uk/5280/1/120_Salhi.pdf

Recommendations

• New heuristic methods for the capacitated multi-facility Weber problem
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• scientific article; zbMATH DE number 5282971
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• A guided reactive GRASP for the capacitated multi-source Weber problem

zbMATH Keywords

heuristicslocation-allocationcontinuous spacecapacitated

Mathematics Subject Classification ID

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

Cites Work

• Heuristics for the capacitated plant location model
• A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
• Lagrangean heuristics for location problems
• Heuristic Methods for Location-Allocation Problems
• A Cross Decomposition Algorithm for Capacitated Facility Location
• Title not available (Why is that?)
• The Transportation-Location Problem
• Constructive heuristics for the uncapacitated continuous location-allocation problem
• Capacitated location-allocation problems on a line
• An efficient heuristic procedure for the capacitated warehouse location problem
• ADD-heuristics' starting procedures for capacitated plant location models
• Lagrangean heuristics applied to a variety of large capacitated plant location problems

Cited In (18)

• Local improvement in planar facility location using vehicle routing
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• A guided reactive GRASP for the capacitated multi-source Weber problem
• Hybrid cell selection-based heuristic for capacitated multi-facility weber problem with continuous fixed costs
• Region-rejection based heuristics for the capacitated multi-source Weber problem
• A Neural Heuristic For The Multisource Weber Problem
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
• The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
• A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
• An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem
• A two-echelon joint continuous-discrete location model
• Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
• A cellular heuristic for the multisource Weber problem.
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
• Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
• The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
• The location-allocation problem of drone base stations

This page was built for publication: A perturbation-based heuristic for the capacitated multisource Weber problem

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