By Topic

Metaheuristic search procedure based on fuzzy graph for p-facility problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Almeida, W.G. ; Comput. Sci. & Appl. Math. Assoc. Lab.-LAC, Inst. Nac. de Pesquisas Espaciais (INPE), São Jose dos Campos, Brazil ; Araujo, E.

A metaheuristic search procedure modified by fuzzy logic and fuzzy set theory for solving p-facility location problems is proposed in this paper. Known as p-median problem, as well, the objective is to find p centers (locations) in a network in order to minimize (maximize) the average distance between demand nodes and their medians. The proposed approach employs Greedy Randomized Adaptive Search Procedure (GRASP) modified by grading the distances from locations weighted by membership functions or fuzzy rules. In so doing, a novel approach named Fuzzy Greedy Randomized Adaptive Search Procedure (FUGRASP) is presented. In order to verify the feasibility of the proposed method, p centers are computed to minimize the average distances among cities according to their respective air-traffic importance.

Published in:

Fuzzy Systems (FUZZ), 2010 IEEE International Conference on

Date of Conference:

18-23 July 2010