Strip Packing Based on Local Search and a Randomized Best-Fit

In both situations, the requirements induced at the first echelon are assigned to the second echelon center u with the lowest unit production and transportation cost ( f puw + c jpu

Table 2 presents the results of MS-ILS on 10 runs, and compare them with the current state-of-the-art solutions – Best Known Lower Bounds (BKLB) and Upper Bounds (BKUB) – reported

• The Virtual Machine Image is configured with the same version of Condor demons that are running on the physical machines aow5grid.uab.es and aow4grid.uab.es to avoid

We then reuse learned clauses, assumptions, and models, which are obtained from previously solved SAT problems, to efficiently compute the minimum height.. We at- tempt to solve

We propose new modifications of the greedy agglomerative heuristic algo- rithms with local search in SWAP neighborhood for the p-medoid problems and j-means procedure for

This new kind of optimality is named weak optimality or experimental optimality in that it relies on an estimator of the number of legal k-colorings (admissible solutions for a

In the second one, the technique called SBDD (for Symmetry Breaking via Dominance Detection) was applied with success to the Social Golfer Problem and allows us to compute all

The heuristic returns good results in a short computation time, whereas the metaheuristic (a Tabu search method) returns the best results known to have been obtained so far for all