Flower Pollination Algorithm (FPA) to Solve Quadratic Assignment Problem (QAP)
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 facility assigns only to one location and each location i...
        Saved in:
      
    
          | Main Authors: | Derby Prayogo Samdean, Herry Suprajitno, Edi Winarko | 
|---|---|
| Format: | Article | 
| Language: | English | 
| Published: | Universitas Airlangga
    
        2019-12-01 | 
| Series: | Contemporary Mathematics and Applications (ConMathA) | 
| Subjects: | |
| Online Access: | https://e-journal.unair.ac.id/CONMATHA/article/view/17398 | 
| Tags: | Add Tag 
      No Tags, Be the first to tag this record!
   | 
Similar Items
- 
                
                    Comparative study of whale optimization algorithm and flower pollination algorithm to solve workers assignment problem        
                          
 by: Huthaifa Al-Khazraji
 Published: (2022-01-01)
- 
                
                    Fpa (YlaN) is an iron(II) binding protein that functions to relieve Fur-mediated repression of gene expression in Staphylococcus aureus        
                          
 by: Jeffrey M. Boyd, et al.
 Published: (2024-11-01)
- 
                
                    A Simulated Annealing Algorithm for the Generalized Quadratic Assignment Problem        
                          
 by: Alan McKendall, et al.
 Published: (2024-11-01)
- 
                
                    An Improved Hybrid Genetic-Hierarchical Algorithm for the Quadratic Assignment Problem        
                          
 by: Alfonsas Misevičius, et al.
 Published: (2024-11-01)
- 
                
                    ESTIMATION OF PASSENGER-KILOMETER AND TONNEKILOMETER VALUES FOR HIGHWAY TRANSPORTATION IN TURKEY USING THE FLOWER POLLINATION ALGORITHM        
                          
 by: Ersin KORKMAZ, et al.
 Published: (2018-03-01)
 
       