Pagination
George A. Driscoll. vers 1950
Voir le détail
Poirier, Conrad. 13 août 1956
Nous voyons une photographie du film «Destroy Rides Again» tirée de la revue «Boy's Cinema»
- Un groupe regarde arriver un porte-avion américain- Un groupe regarde arriver un destroyer américain
[Vers 1940]
[Vers 1970]
Zhang, Jipeng, auteur
an endowment and simultaneously decide on how much of the other player's endowment to destroy.Again in the joy-of-destruction game, Abbink and Herrmann (2011) find that about a quarter of participants will destroy half their anonymous partner’s endowment when the source of the destruction is hidden.To our knowledge
Guastaroba, Gianfranco, auteur
neighborhood, which is rather defined implicitly by a destroy and a repair mechanisms.A destroy operator “destructs” part of a solution, which isater “reconstructed” by the repair operator.Hence, the neighborhood of a solution is implicitly defined as the set of solutions that can be reached by first applying a destroy operator
explicitly.The basic idea of LNS is to avoid an explicit definition of the neighborhood, which is rather defined implicitly by a destroy and a repair mechanisms.A destroy operator “destructs” part of a solution, which isater “reconstructed” by the repair operator.Hence, the neighborhood of a solution is implicitly defined
Lamghari, Amina
Because ALNS is an extension of LNS, a brief description of LNS is first provided. Starting with an initial solution, LNS progressively improves it by using two methods: a destroy method and a repair method. More specifically, at each iteration, the destroy method removes a certain number of variables from the current
Schiffer, Maximilian
of our algorithm and the notation is defined in Table 2. After 1: σ InitialSolution(), InitializeParameters(), ι 0 2: while (ι < ηmax) and (ι ιimp < ηmaxnoi ) do 3: σ′ DestroyAndRepair(Dl,Ds,R, ηlrgσ) 4: if (λ (σ′) < λ (σ ) (1 δ)) then 5: σ′ LocalSearch(σ′) 6: if (λ (σ′) < λ (σ)) then 7: σ σ′ 8: if (λ (σ
Beezão, Andreza Cristina
machines, their sequencing, and the allocation of tools on each machine.The objective function minimizes the makespan.We propose an adaptivearge neighborhood search metaheuristic in which the destroy and repair operators exploit the structures of two well-known and related combinatorial optimization problems, namely the
