A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices

Article Abstract:

A study is conducted to analyze the performance of two stochastic local search algorithms that tackle multiobjective combinational optimization problems like biobjective quadratic assignment problem.

Algorithms, Algorithm, Stochastic processes, Combinatorial optimization

---

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

Article Abstract:

The application of metaheuristic programming techniques to derive an iterated greedy algorithm for the solution of the permutation flowshop scheduling problem is described.

Belgium, Management dynamics, Spain, Machine Job Shops, Machine Shops, Industrial machinery, not elsewhere classified, Management, Scheduling (Management), Company business management, Heuristic programming

---

Iterated local search for the quadratic assignment problem

Article Abstract:

A study evaluates the run-time distributions in an iterated local search to solve problems related to quadratic assignment problem.

Iterative methods (Mathematics), Iteration (Mathematics), Quadratic programming

Similar abstracts:

• Abstracts: A fast tabu search algorithm for the permutation flow-shop problem
• Abstracts: Airline fleet assignment concepts, models, and algorithms. A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
• Abstracts: India's stocks rocket as Reliance plans split. Kidde accepts $2.84 billion bid from United Technologies
• Abstracts: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• Abstracts: Characterization of the core in games with restricted cooperation. Pairwise solutions and the core of transportation situations

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