• Aucun résultat trouvé

A new split-based hybrid metaheuristic for the Reconfigurable Transfer Line Balancing Problem

N/A
N/A
Protected

Academic year: 2021

Partager "A new split-based hybrid metaheuristic for the Reconfigurable Transfer Line Balancing Problem"

Copied!
25
0
0

Texte intégral

Loading

Figure

Table 1. The notations.
Figure 1. Precedence graph.
Table 2. Processing times.
Figure 2. Example of feasible solution.
+6

Références

Documents relatifs

running CPU time in seconds; rp: denotes the ratio y c + where y + is the capacity level where the algorithm detects that the periodicity level y ∗ is reached; vrs: number of

[5] proposed a parallel solution for a variant of the problem under the CGM model using weighted graphs that requires log p rounds and runs in On2 log m/p time.. Recently, Kim

For instance a Liouville number is a number whose irrationality exponent is infinite, while an irrational algebraic real number has irrationality exponent 2 (by Theorem 3.6), as

We order the edges with respect to an increasing number of minimal configurations and generate the configuration variables and the associated constraints iteratively as long as

Abstract—In this paper, we propose an improvement of the attack on the Rank Syndrome Decoding (RSD) problem found in [1], usually the best attack considered for evaluating the

For each instance, we give the best found lower (LB1) and upper (UB1) bounds, the total number of branch and bound nodes (#nodes), the total CPU time in seconds (CPU), the initial

Among these methods, two population-based algorithms (MEANS [34] and Ant-CARP [32]) and one local search algorithm (GLS [2]) represent the state-of-the-art solution methods for

This paper presents a hybridization of the Ant Colony Algorithm and a Complete Local search with Memory heuristic, in order to maximize as much as possible; the free time