Titlebook: Hybrid Metaheuristics; 7th International Wo María J. Blesa,Christian Blum,Michael Sampels Conference proceedings 2010 The Editor(s) (if app

记成蚂蚁

Hybrid Algorithms for the Variable Sized Bin Packing Problem,a set of items with given weights have to be packed into a minimum-cost set of bins of variable sizes and costs. First we propose a heuristic and a beam search approach. Both algorithms are strongly based on dynamic programming procedures and lower bounding techniques. Second, we propose a variable

Cognizance

A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model,titor. The firm aims at finding the location and attractiveness of each facility to be opened so as to maximize its profit. The competitor, on the other hand, can react by adjusting the attractiveness of its existing facilities, opening new facilities and/or closing existing ones with the objective

客观

A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem,vice industries. The issue is to find a minimum number of shifts, the number of workers assigned to them, and a suitable number of breaks so that the deviation from predetermined workforce requirements is minimized..We tackle this problem by means of a hybrid strategy in the spirit of Large Neighbor

ATRIA

A New Approach for Solving the Generalized Traveling Salesman Problem,as many interesting applications. In this paper we present a local-global approach for the generalized traveling salesman problem. Based on this approach we describe a novel hybrid metaheuristic algorithm for solving the problem using genetic algorithms. Computational results are reported for Euclid

Gourmet

Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem,sources. They increase and decrease in quantity according to the activated tasks and are not bounded like other project scheduling problems. This paper presents a new mathematical formulation for DRCPSP as well as two hybrid heuristics merging an evolutionary algorithm with an exact approach. Comput

厌恶

A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem, (ELS/ILS), using Tabu list to solve the two-echelon location routing problem (LRP-2E). The GRASP uses in turn three constructive heuristics followed by local search to generate the initial solutions. From a solution of GRASP, an intensification strategy is carried out by a dynamic alternation betwe

aplomb

Anecdote

辞职

An Improved Memetic Algorithm for Break Scheduling, e.g. in air traffic control and other fields where supervision personnel is working. The objective is to assign breaks to employees such that various constraints reflecting legal demands or ergonomic criteria are satisfied and staffing requirement violations are minimised..In our previous work we p

chemical-peel

Consultant-Guided Search Algorithms for the Quadratic Assignment Problem,ake decisions based on advice received from consultants. Until now, CGS has been successfully applied to the Traveling Salesman Problem. Because a good metaheuristic should be able to tackle efficiently a large variety of problems, it is important to see how CGS behaves when applied to other classes