Solving Euclidean multifacility location problems under circular area constraints using Rprop
by G.M. Nasira; T.S.S. Balaji
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 5, No. 2, 2015

Abstract: The present work considers multifacility location problems with circular area constraints having interactions between sources and destinations. A detailed literature survey reveals that a little attention has been paid to problem involving area constraints. Mathematical formulation and the analytical solutions have 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 artificial neural networks (ANN). With the help of numerical examples, it has been established that within the acceptable limits resilient back-propagation (Rprop) model compares well with those obtained through analytical method.

Online publication date: Wed, 15-Jul-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com