A guided reactive GRASP for the capacitated multi-source Weber problem

Authors:
Martino Luis;Said Salhi;Gábor Nagy
Affiliations:
College of Business, Universiti Utara Malaysia, UUM Sintok, Kedah Darul Aman, Malaysia;The Centre for Logistics and Heuristic Optimisation, Kent Business School, University of Kent at Canterbury, Canterbury CT2 7PE, UK;The Centre for Logistics and Heuristic Optimisation, Kent Business School, University of Kent at Canterbury, Canterbury CT2 7PE, UK
Venue:
Computers and Operations Research
Year:
2011

Citing 13
Cited 2

A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem

Discrete Applied Mathematics - Special volume: viewpoints on optimization
Global convergence of a generalized iterative procedure for the minisum location problem with Ip distances

Operations Research
Heuristic Methods for Large Centroid Clustering Problems

Journal of Heuristics
Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem

Operations Research
Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems

Operations Research
Algorithmic approaches for solving the euclidean distance location and location-allocation problems

Algorithmic approaches for solving the euclidean distance location and location-allocation problems
Linear Programming and Network Flows

Linear Programming and Network Flows
A reactive GRASP for a commercial territory design problem with multiple balancing requirements

Computers and Operations Research
Region-rejection based heuristics for the capacitated multi-source Weber problem

Computers and Operations Research
A reactive GRASP with path relinking for capacitated clustering

Journal of Heuristics
Heuristic solution of the multisource Weber problem as a p-median problem

Operations Research Letters
A probabilistic heuristic for a computationally difficult set covering problem

Operations Research Letters
Semi-greedy heuristics: An empirical study

Operations Research Letters

Single-Source Capacitated Multi-Facility Weber Problem-An iterative two phase heuristic algorithm

Computers and Operations Research
A new greedy randomised adaptive search procedure for multiple sequence alignment

International Journal of Bioinformatics Research and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

The capacitated multi-source Weber problem entails finding both the locations of capacitated facilities on a plane and their customer allocations. A framework that uses adaptive learning and functional representation to construct the restricted candidate list (RCL) within a greedy randomized adaptive search procedure (GRASP) is put forward. An implementation of restricted regions that forbids new facilities to be located too close to the previously found facilities is also embedded into the search to build up the RCL more efficiently. The performance of this GRASP based approach is tested on three classes of instances with constant and variable capacities. Very competitive results are obtained when compared to the best known results from the literature.