Application of Heuristic and Metaheuristic Algorithms in Solving Constrained Weber Problem with Feasible Region Bounded by Arcs

Algorithm 1

Solving the CWP problem.

Require: Coordinates and weights of the demand points , pre-specified tolerance ,

constraints (2) specified by sets and .

Step  1. Calculate the initial point (here, is the feasible set bounded by constraints);

Step  2. While do:

Step  2.1. ;

Step  2.2. .

Step  2.3. If then .

Step  2.4. ; .

Step  2.5. Continue Step  .

Step  3. STOP, return .