Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • Additional Information
    • Publication Information:
      Growing Science, 2022.
    • Publication Date:
    • Collection:
      LCC:Industrial engineering. Management engineering
      LCC:Production management. Operations management
    • Abstract:
      The Quadratic Assignment Problem (QAP) is one of the classical combinatorial optimization problems and is known for its diverse applications. The QAP is an NP-hard optimization problem which attracts the use of heuristic or metaheuristic algorithms that can find quality solutions in an acceptable computation time. On the other hand, there is quite a broad spectrum of mathematical programming techniques that were developed for finding the lower bounds for the QAP. This paper presents a fusion of the two approaches whereby the solutions from the computations of the lower bounds are used as the starting points for a metaheuristic, called HC12, which is implemented on a GPU CUDA platform. We perform extensive computational experiments that demonstrate that the use of these lower bounding techniques for the construction of the starting points has a significant impact on the quality of the resulting solutions.
    • File Description:
      electronic resource
    • ISSN:
    • Relation:;;
    • Accession Number:
    • Accession Number: