An Evolutionary Algorithm for the Biobjective QAP

摘要: Abstract. In this paper we present a new method for the biobjectivequadratic assignment problem. This is modified version of an earliermulti-objective evolutionary algorithm. It uses special truncation selection,and descendents are derived from parents by mutation based on anEC-memory method. EC-memory extended anearlier method, and can use more value discrete space. The qualityof results our algorithm better than some stochasticlocal search, or ACO algorithms 1 Introduction Knowles Corne [7] presented QAP variation considering several flowsand distances. multi-objective problem has number potentialapplications. For example, in hospital layout may be concernedwith simultaneously minimizing flows doctors their rounds, pa-tients, visitors, pharmaceuticals other equipment [7].The mathematical expression thenmin π∈S n F ( π )= {f ) ,f 2