A greedy randomized adaptive search procedure for maximum independent set. A greedy randomized adaptive search procedure for the quadratic assignment problem. subroutines for approximate solution of dense quadratic assignment problems using GRASP. Table 2: grasp-parallel-sparse empty permutation, and local search is applied to the constructed solution for further improvement. The best solution ...

This paper studies truck scheduling in a resource-constrained crossdock. The problem decides on the sequence of incoming and outgoing trucks at the dock doors of the crossdocking terminal, subject to the availability of crossdock resources including dock doors and material handling systems. The resources are assumed non-preemptive making it necessary to address the feasibility of the problem be...

This paper presents, as a case study, the application of a two-phase heuristic evolutionary algorithm to obtain personalized timetables in a Spanish university. The algorithm consists of a two-phase heuristic, which, starting from an initial ordering of the students, allocates students into groups, taking into account the student’s preferences as a primal factor for the assignment. An evolution...

Stochastic local search (SLS) algorithms have shown effectiveness on satisfiable instances of the Boolean satisfiability (SAT) problem. However, their performance is still unsatisfactory on random k-SAT at the phase transition, which is of significance and is one of the empirically hardest distributions of SAT instances. In this paper, we propose a new heuristic called DCCA, which combines two ...

A methodology using heuristic search methods is proposed for optimizing cancer chemotherapies with drugs acting on a specific phase of the cell cycle. Specifically, two evolutionary algorithms, and a simulated annealing method are considered. The methodology relies on an underlying mathematical model for tumor growth that includes cycle phase specificity, and multiple applications of a single c...

Metaheuristic approaches to examination timetabling problems are usually split up into two phases: initialisation phase in which a heuristic is employed to construct an initial solution and improvement phase which employs a metaheuristic. Different hybridisations of metaheuristics with sequential heuristics are known to lead to solutions of different quality. A Case Based Reasoning CBR methodol...

Validation studies of current GPS radio occultation experiments using meteorological analyses consistently report on a negative refractivity bias in the lower troposphere. It is shown that refractivity profiles obtained from Doppler-inverted bending angle profiles not only deviate significantly within zones of multipath propagation but also depend on the selected end point of the occultation si...

This paper is devoted to the numerical resolution of unit-commitment problems, with emphasis on the French model optimizing the daily production of electricity. The solution process has two phases. First a Lagrangian relaxation solves the dual to find a lower bound; it also gives a primal relaxed solution. We then propose to use the latter in the second phase, for a heuristic resolution based o...