This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are probed with local search for high-quality solutions. Each iteration of GRASP consists of the construction of a randomized greedy solution, followed by local search, starting from the constructed solution. Path-relinking...

The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we propose a new parallel meta heuristic algorithm based on the Tabu Search (TS) for the resolution of the 0-1 MKP. We show that, in addition to reducing execution time, parallel processing can perform automatically and dynam...

In this paper, we propose a method based on learning mechanisms to address the fixed charge capacitated multicommodity network design problem. Learning mechanisms are applied on each solution to extract meaningful fragments to build a pattern solution. Cycle-based neighborhoods are used both to generate solutions and to move along a path leading to the pattern solution by a tabu-like local sear...

Despite the large amount of work performed on flow-shop scheduling most of the research has concentrated on the permutation problem in which passing is not allowed. In this work the general flow-shop problem, in which passing is allowed, is dealt with as it is considered to be a better representation of flowshop instances. The evolutionary techniques of scatter search (SS) and its generalised f...

there is little consensus on the corporate diversification-efficiency relationship in the diversification literature. according to the corporate diversification, firms have a tendency to get more market share with diversifying in the local segment or in the international market. theoretically, a contradictory exists between the profitable strategy and the value reducing strategy in the diversif...

The job-shop scheduling problem is the important issues to the research of optimal problems. Besides, tabu search is also applied to GA, called TGA for traveling salesman problem (TSP) that has better effectiveness than GA. Thus, this is an interest and important research area for job-shop scheduling problem with TGA. In this paper, we try to discuss this issue. According to the TGA, it maintai...

economic dispatch with valve point effect and prohibited operating zones (pozs) is a non-convex and discontinuous optimization problem. harmony search (hs) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. the performances of these variants are severely affected by selection of different parameters of the algorithm. intel...