An evolutionary heuristic algorithm for the assignment problem

DOI10.1007/S12597-013-0158-XMaRDI QIDQ260651zbMATH OpenOpenAlexFDO

Authors Senthil Kumar Ramadoss, Ajit P. Singh, Illauddin Kamaluddin Gulam Mohiddin

Publication date 22 March 2016

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12597-013-0158-x

zbMATH Keywords

optimizationassignment problemevolutionary algorithmgenetic algorithmbelief spacecultural algorithmheuristic algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Recommendations

• Genetic algorithm for linear and cyclic assignment problem
• A genetic algorithm for the generalised assignment problem
• A heuristic method for the quadratic assignment problem
• A Tabu Search Algorithm for the Resource-Constrained Assignment Problem
• An alternative approach for unbalanced assignment problem via genetic algorithm

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3561035 (Why is no real title available?)
• scientific article; zbMATH DE number 2087679 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• scientific article; zbMATH DE number 3317528 (Why is no real title available?)
• scientific article; zbMATH DE number 3069634 (Why is no real title available?)
• Solving the assignment problem using genetic algorithm and simulated annealing

Cited in

(2)

• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• An evolutionary approach for the nurse rerostering problem

This page was built for publication: An evolutionary heuristic algorithm for the assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q260651)