A GRASP for the biquadratic assignment problem

Article Abstract:

A new heuristic called greedy randomized adaptive search procedure (GRASP) proved to be a highly dependable solution for biquadratic assignment problems (BiQAP). In dealing with BiQAP, GRASP yields better solutions than other previously used algorithms. Maximal solutions were generated by GRASP in all ten runs and created varying seeds for the pseudo random number generator.

Research and Development in the Physical, Engineering, and Life Sciences, Mathematics, Research, Algorithms, Integer programming

---

A hybrid multistart heuristic for the uncapacitated facility location problem

Article Abstract:

The problem of un-capacitated facility design in operations management is addressed by using hybrid multistart heuristics programming.

Strategy & planning, Planning, Company business planning, Plant layout

---

The multiple-job repair kit problem

Article Abstract:

The usage of heuristic programming for addressing multiple-kit repair kit problems in production systems is discussed.

Similar abstracts:

• Abstracts: Shapes of the sea drive design centre. Briar Hill nursery
• Abstracts: Efficient solutions to the cell-formation problem with multiple routings via a double-loop genetic algorithm. Ensuring population diversity in genetic algorithms: a technical note with application to the cell formation problem
• Abstracts: An addendum to the hierarchical network design problem. Some inverse optimization problems under the Hamming distance
• Abstracts: The joint replenishment problem with variable production costs. Equilibrium constrained optimization problems
• Abstracts: Extended optimal age-replacement policy with minimal repair of a system subject to shocks

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.