Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem

From MaRDI portal
Publication:1567487
Jump to:navigation, search

DOI10.1023/A:1008743718053zbMath0947.90057MaRDI QIDQ1567487

Y. Yuan, Meng-Hiot Lim, Shigeru Omatu

Publication date: 29 October 2000

Published in: Computational Optimization and Applications (Search for Journal in Brave)


zbMATH Keywords

combinatorial optimizationlocal searchquadratic assignmentgenetic algorithm\(k\)-gene exchange


Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)


Related Items

A multi-parent genetic algorithm for the quadratic assignment problem ⋮ PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID ⋮ A survey for the quadratic assignment problem ⋮ A Birnbaum-importance based genetic local search algorithm for component assignment problems ⋮ Experimental analysis of crossover and mutation operators on the quadratic assignment problem ⋮ Overlap domain decomposition method for bioluminescence tomography (BLT) ⋮ A hybrid metaheuristic for the quadratic assignment problem


Uses Software

  • QAPLIB



This page was built for publication: Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1567487&oldid=13847960"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 02:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki