Titlebook: Hybrid Metaheuristics; 11th International W Maria J. Blesa Aguilera,Christian Blum,Julio Godoy Conference proceedings 2019 Springer Nature

职业

GEN

Generic CP-Supported CMSA for Binary Integer Linear Programs,constructs feasible solutions to the tackled problem instance in a probabilistic way and (2) solves a reduced problem instance (if possible) to optimality. The construction of feasible solutions is hereby problem-specific, usually involving a fast greedy heuristic. The goal of this paper is to desig

严峻考验

你敢命令

pericardium

分散

Fixed Set Search Applied to the Traveling Salesman Problem, learning mechanism to the greedy randomized adaptive search procedure (GRASP). The basic concept of FSS is to avoid focusing on specific high quality solutions but on parts or elements that such solutions have. This is done through fixing a set of elements that exist in such solutions and dedicatin

模范

GEM

抗体

Stochastic Local Search Algorithms for the Direct Aperture Optimisation Problem in IMRT,. In the DAO problem, the goal is to find a set of deliverable aperture shapes and intensities so we can irradiate the tumor according to a medical prescription without producing any harm to the surrounding healthy tissues. Unlike the traditional two-step approach used in intensity modulated radiati

anagen

Hybridization of Stochastic Tunneling with (Quasi)-Infinite Time-Horizon Tabu Search,ma via a non-linear transformation. Here, we hybridize STUN with the idea of Tabu Search (TS), namely, the avoidance of revisiting previously assessed solutions. This prevents STUN from inefficiently scan areas of the search space whose objective function values have already been “transformed away”.