Titlebook: Evolutionary Computation in Combinatorial Optimization; 7th European Confere Carlos Cotta,Jano Hemert Conference proceedings 2007 Springer-

傳染

Evolutionary Computation in Combinatorial Optimization978-3-540-71615-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

refine

0302-9743 Overview: 978-3-540-71614-3978-3-540-71615-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

majestic

https://doi.org/10.1007/978-3-030-58764-2This paper presents a simple algorithm for the job shop scheduling problem that combines the local search heuristic GRASP with a branch-and-bound exact method of integer programming. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.

Germinate

cardiovascular

jabber

DNR215

Growth, Metabolism, and Structure,een solutions. Computational experiments indicate that in the capacitated vehicle routing problem the usage of these techniques is not really profitable, because of cache management overhead and implementation issues.

群居動物

Corinne M. Gajdusek,Sandra A. Harris-Hooker. Moreover, a local search is also incorporated into the EA. The experimental results demonstrate that the proposed EA can effectively find the best-known solutions on . benchmark. Moreover, our EA found ten new best solutions for . instances in a reasonable computation time.

表示向下

Asperity