Abstract
The quadratic three-dimensional assignment problem (Q3AP) is a generalization of the well-known quadratic assignment problem (QAP). Unlike QAP which has been extensively studied by the combinatorial optimization community, few works have been devoted to the resolution of the Q3AP which is proved to be an NP-hard problem. In this paper, a particle swarm optimization algorithm hybridized with a tabu search is presented to solve the quadratic three-dimensional assignment problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
