Mostrar el registro sencillo del ítem
Solving the quadratic assignment problem by neural networks
dc.contributor.author | Domínguez, Enrique | |
dc.date.accessioned | 2013-10-30T10:13:18Z | |
dc.date.available | 2013-10-30T10:13:18Z | |
dc.date.issued | 2013-10-30 | |
dc.identifier.uri | http://hdl.handle.net/10630/6190 | |
dc.description.abstract | The Quadratic Assignment Problem (QAP) was introduced by Koopmans and Beckmann in 1957 as a mathematical model for the location of a set of indivisible economical activities. This problem consists of allocating a set of facilities to a set of locations, taking into account the costs of the distance and flow between facilities, and the cost of the facility’s installation in a certain location. Therefore, the problem is to assign all the facilities to the locations with the objective of minimizing the total cost. The QAP is NP-hard and one of the fundamental combinatorial optimization problems in the area of facility location. This problem has been solved by many different techniques; but no exact algorithm is known for solving large-sized instances of the QAP in reasonable computational time. In this work, neural networks are proposed for solving large-sized instances of the QAP. Preliminary results show that neural networks are capable to provide good solutions in a low computational time. | es_ES |
dc.description.sponsorship | Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. | es_ES |
dc.language.iso | eng | es_ES |
dc.rights | info:eu-repo/semantics/openAccess | |
dc.subject | Redes neuronales (Informática) | es_ES |
dc.title | Solving the quadratic assignment problem by neural networks | es_ES |
dc.type | info:eu-repo/semantics/conferenceObject | es_ES |
dc.centro | E.T.S.I. Informática | es_ES |
dc.relation.eventtitle | European Conference on Operational Research | es_ES |
dc.relation.eventplace | Roma (Italia) | es_ES |
dc.relation.eventdate | Julio 2013 | es_ES |