Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Flower Pollination Algorithm (FPA) to Solve Quadratic Assignment Problem (QAP)

Autor: Derby Prayogo Samdean, Herry Suprajitno, Edi Winarko

Publikováno v: Contemporary Mathematics and Applications (ConMathA), Vol 1, Iss 2, Pp 121-130 (2019)

The purpose of this paper is to solve Quadratic Assignment Problem using Flower Pollination Algorithm. Quadratic Assignment Problem discuss about assignment of facilities to locations in order to minimize the total assignment costs where each facilit

Externí odkaz: https://doaj.org/article/40f4608ea9e64c96ba3a208394da3ed6

PROPUESTA DE DISTRIBUCIÓN EN PLANTA BIETAPA EN AMBIENTES DE MANUFACTURA FLEXIBLE MEDIANTE EL PROCESO ANALÍTICO JERÁRQUICO PROPOSTA DE DISTRIBUIÇÃO EM PLANTA BIETAPA EM AMBIENTES DE MANUFATURA FLEXÍVEL MEDIANTE O PROCESSO ANALÍTICO HIERÁRQUICO BIPHASE PLANT DISTRIBUTION PROPOSED IN FLEXIBLE MANUFACTURING ENVIRONMENT BY THE ANALYTIC HIERARCHY PROCESS

Autor: Andrés Felipe Salazar, Leidy Carolina Vargas, Camilo Ernesto Añasco, Juan Pablo Orejuela

Publikováno v: Revista EIA, Iss 14, Pp 161-175 (2010)

En ambientes de manufactura flexible, la conformación celular es adecuada para mejorar los flujos del proceso, tiempos de ciclo y calidad del producto. Su papel consiste en definir una conformación de familias de productos y células que permita el

Externí odkaz: https://doaj.org/article/23d7b082eb4947ca83d031af0d83f3f8

Combinatorial optimization np-hard problem solved by using the quadratic assignment problem (QAP) solution through a parallel genetic algorithm on GPU

Autor: Orlando García Hurtado, Eduardo Cárdenas Gómez, Roberto Manuel Poveda Chaves

Publikováno v: Visión Electrónica, Vol 11, Iss 2, Pp 146-151 (2017)

espanolEn este documento se resuelven algunas instancias de problemas bien conocidos de optimizacion combinatorial de tipo NP-Hard a partir de la formulacion de Koopmans y Beckmann del problema de Asignacion Cuadratica (QAP). Dichas instancias son so

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::913850ec789eb45371e9a12b6d8a8925
https://doi.org/10.14483/22484728.14623

Karesel Atama Problemi İçin Grafik İşlem Birimleri Üzerinde Tasarlanmış Bir Melez Genetik Algoritma

Autor: Gurkan Ozturk, Erdener Özçetin

Publikováno v: Anadolu University Journal of Science and Technology. A : Applied Sciences and Engineering, Vol 17, Iss 1, Pp 167-180 (2016)
Volume: 17, Issue: 1 167-180
Anadolu University Journal of Science and Technology A-Applied Sciences and Engineering

In this paper, a hybrid genetic algorithm is proposed for the quadratic assignment problem. The most time-consuming parts of the proposed algorithm are the calculation of objective function values and the local search operator. Therefore, the paralle

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::265c88dbe4d1b78628c8a3897f6d5110
http://dergipark.gov.tr/aubtda/issue/24859/262687?publisher=anadolu