Advances in Applied Research
Year : 2009, Volume : 1, Issue : 2
First page : ( 176) Last page : ( 189)
Print ISSN : 0974-3839. Online ISSN : 2349-2104.

Optimality of MLP using Fletcher-Reeves Update Algorithm under Triangular Area Constraints

Nasira G. M.

Department of Computer Applications, Sasurie College of Engineering, Vijayamangalam, Erode Dist -638056, Tamilnadu, India. E Mail: nasiragm99@yahoo.com

Online published on 11 June, 2014.

Abstract

The Multifacility Location Problem (MLP) is an extension of the single facility location problem. In the case of multifacility location problem we shall be interested in finding the locations of multiple new facilities with respect to multiple existing facilities in a given environment. A detailed literature survey reveals that a little attention has been paid to problem involving area constraints even though; perhaps every location problem is inherently bound by area constraint of some sort or the other. This has motivated to take care of the area constraint aspect of Multifacility Location Problem in the present study. Mathematical formulation of multifacility location problem with area constraint has been considered and the solution has been obtained by using Kuhn-Tucker theory. The mathematical solution procedure is very complex and time consuming. Hence, an attempt has been made to get the solution of a complex, constrained multifacility location problem using Fletcher - Reeves Update Algorithm (F-RUA) in Artificial Neural Networks (ANN). With the help of Numerical examples, it has been established that the solution obtained through the F-RUA compares well within the acceptable limits with those obtained through analytical method

Top

Keywords

Multifacility Location Problem, Area Constraint, Kuhn-Tucker Theory, Artificial Neural Networks (ANN), Fletcher-Reeves Update Algorithm (F-RUA).

Top