An algorithm for generalized constrained multi-source Weber problem with demand substations

DOI10.1007/s10288-017-0366-yzbMath1457.90090OpenAlexW2772038152MaRDI QIDQ1728411

Ahmadreza Raeisi Dehkordi, Soghra Nobakhtian

Publication date: 22 February 2019

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-017-0366-y

zbMATH Keywords

global convergencelocation-allocationheuristic algorithmlocationdistance function

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Discrete location and assignment (90B80)

Related Items (2)

A new algorithm for the minimax location problem with the closest distance ⋮ On the convergence of the Cooper's algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restricted normal cones and the method of alternating projections: theory
• A projected Weiszfeld algorithm for the box-constrained Weber location problem
• On the use of the varignon frame for single facility Weber problems in the presence of convex barriers
• An efficient solution method for Weber problems with barriers based on genetic algorithms
• Method of successive projections for finding a common point of sets in metric spaces
• A new genetic algorithm for solving nonconvex nonlinear programming problems
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
• The Weber problem with regional demand
• A heuristic method for large-scale multi-facility location problems
• Minisum location with closest Euclidean distances
• A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
• Heuristic Methods for Location-Allocation Problems
• On Projection Algorithms for Solving Convex Feasibility Problems
• Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
• Nonlinear Programming
• Location of facilities with rectangular distances among point and area destinations
• Locating facilities by minimax relative to closest points of demand areas

This page was built for publication: An algorithm for generalized constrained multi-source Weber problem with demand substations