A heuristic algorithm for constrain single-source problem with constrained customers

zbMATH Open1354.90068MaRDI QIDQ2834045FDOQ2834045

Authors: Sayyed Ahmadreza Raisi Dehkordi, Masood Farahani, A. Ahmadi 

Publication date: 25 November 2016

Published in: Journal of Mathematical Extension (Search for Journal in Brave)

Full work available at URL: http://www.ijmex.com/index.php/ijmex/article/view/158/96

Recommendations

• The Fermat-Weber location problem revisited
• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• The Weber problem in congested regions with entry and exit points
• A projected Weiszfeld algorithm for the box-constrained Weber location problem
• scientific article; zbMATH DE number 1803754

zbMATH Keywords

global convergencelocationallocationconvexclosed

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Cited In (6)

• An algorithm for generalized constrained multi-source Weber problem with demand substations
• A projected Weiszfeld algorithm for the box-constrained Weber location problem
• A variational inequality heuristic algorithm for a constrained multi-source location-allocation model
• Single facility minisum location on curves
• The Fermat-Weber location problem in single integrator dynamics using only local bearing angles
• The three-dimensional Fermat-Weber problem with Tchebychev distances

This page was built for publication: A heuristic algorithm for constrain single-source problem with constrained customers

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