Showing 1 - 10 of 15,703
. Priority rule-based methods still constitute the most important class of these heuristics. Of these, in turn, parameterized …
Persistent link: https://www.econbiz.de/10011558730
. Priority rule-based methods still constitute the most important class of these heuristics. Of these, in turn, parameterized … their effectiveness considerably. We extend this approach by integrating heuristics and case-based reasoning (CBR), an … performance similar or close to state-of-the-art heuristics. In addition, the analysis undertaken provides new insight into the …
Persistent link: https://www.econbiz.de/10011558731
. Rather, any given heuristic may do well on some instances but will do worse on others. Indeed, even the 'best' heuristics …
Persistent link: https://www.econbiz.de/10011558756
Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences or feasible subsets, they all aim at finding as fast as possible...
Persistent link: https://www.econbiz.de/10011558725
Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem (RCPSP) have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences, feasible completion times or feasible subsets, they all...
Persistent link: https://www.econbiz.de/10011558739
It is well-known that for many project scheduling problems the Space AS of active schedules contains at least one optimal solution for each feasible instance, so restricting heuristic construction methods to AS will improve algorithmic efficiency without foresaking the chance to eventually find...
Persistent link: https://www.econbiz.de/10011558742
amount of time. Therefore heuristics employing genetic concepts, sampling strategies, simulated annealing or taboo search …
Persistent link: https://www.econbiz.de/10011558746
This paper introduces a new general framework for genetic algorithms to solve a broad range of optimization problems. When designing a genetic algorithm, there may be several alternatives for a component such as crossover, mutation or decoding procedure, and it may be difficult to determine the...
Persistent link: https://www.econbiz.de/10011558747
) no more than twenty to fifty activities can be solved to optimality in reasonable amount of time. Hence, heuristics must … be employed to solve larger instances. To evaluate such heuristics, lower bounds are needed. The aim of this paper is to …
Persistent link: https://www.econbiz.de/10011558760
This paper addresses the airport flight gate assignment problem with multiple objectives. The objectives are to maximize the total flight gate preferences, to minimize the number of towing activities and to minimize the absolute deviation of the new gate assignment from a so-called reference...
Persistent link: https://www.econbiz.de/10011558806