Algodesk: an experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
Article Abstract:
The quadratic assignment problem is reportedly one of the most difficult combinatorial optimization problems. Eight different heuristic algorithms are comparatively evaluated with regard to their effectiveness in solving the quadratic assignment problem. A brief overview of the results, with regard to the best solution of each algorithm and its speed of convergence, is presented and discussed.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
User Contributions:
Comment about this article or add new information about this topic:
Guidelines for the use of meta-heuristics in combinatorial optimization
Article Abstract:
Meta-heuristics in combinatorial optimization has proved to be highly efficient for the solution of difficult optimization problems. A few guidelines are provided for the successful adaptations of local search and population search methods for the solution of difficult combinatorial problems.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2003
User Contributions:
Comment about this article or add new information about this topic:
A framework for the description of evolutionary algorithms
Article Abstract:
Research is presented concerning the terminology and main feature description of evolutionary algorithms which can be used in addition to algorithm pseudo-codes. The philosophy of this methodology is discussed.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: A fast and effective heuristic for the orienteering problem. A computational study of smoothing heuristics for the traveling salesman problem
- Abstracts: A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem. Load balancing and capacity constraints in a hierarchical location model
- Abstracts: An approximately global optimization method for assortment problems. Dynamic programming using the Fritz-John conditions
- Abstracts: A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- Abstracts: Dynamic control of multicommodity fleet management problems. A comparative evaluation of modeling approaches to the labor shift scheduling problem