[PDF] Top 20 An exchange heuristic for the bin packing problem

... produce identical solutions to a problem instance. However, if the random reordering is repeated, a set of different solutions can be obtained by FFDR. In fact one strong argument f[r] ... See full document

... In the HGGA version of the local search algorithm, a number of items of the initial solution are made free. The algorithm then tries to replace up to three items in each of the existing bins of the solution by one or two ... See full document

... the problem. Besides the branch and bound method, heuristic approaches are also widely used for solving the bin packing ...The heuristic methods are particularly useful for problems ... See full document

... specific packing problems that perform significantly better than the standard general-purpose heuristics such as first and best fit (Rhee and Talagrand, 1993; Coffman Jr et ...online bin packing ... See full document

... three-dimensional bin packing and knapsack packing are difficult problems in operational ...act, heuristic, and metaheuristic approaches, have been investigated to solve these prob- lems and ... See full document

... allocated bin is deter- mined by the Bottom-Left (BL) algorithm developed by Jakobs (1996) or an improved bottom left (BLLT) version proposed by Liu and Teng (1999) or a variant of the constructive approach ... See full document

... representing packing policies for online bin packing using function ...given bin after adding the current item to be packed, providing a score for the desirability of packing the item ... See full document

... The problem of virtual resource (RAM, Bandwidth and CPU) can be formulated as a variant of multidimensional bin packing ...this problem, several heuristics have been developed, such as FF ... See full document

... hyper- heuristic in the other three problem domains is more ...Salesman Problem and the Vehicle Routing Problem it is the case that either including or omitting crossover low-level heuristics ... See full document

... for bin packing and permutation flowshop scheduling as in ...bin packing. Considering the train-test sessions, Irace hyper- heuristic can be categorized as an offline learning ... See full document

... a heuristic approach BBPMM based on our earlier contributions, MCBVP and BBP as part of energy efficient management of ...the problem is formulated as Vector Bin-Packing (VBP), a combinatorial ... See full document

... minimum bin slack. In this research, each packing is determined in a search procedure that tests all possible subsets of items on the list which _t the bin capacity ...in packing A is ... See full document

... order tensor as the high quality candidate solutions vary from one generation to another under the genetic operators in GA. This construction process is repeated periodically throughout the evolutionary process. At the ... See full document

... are inspired by this model developed new location problem models with disruption consideration. They supposed that facilities are not completely reliable and customers do not have any information about a facility ... See full document

... the problem are the Suffrage heuristics that allocates the tasks that would suffer more when not allocated to their favorite machine first, KPB (K-Percent Best) and SWA (Switching Algorithm) that combine the MET ... See full document

... based heuristic per- forms better than the other heuristic, in the next phase, a comparison is done between the solution of the GA based heuristic and that of the mathematical model presented in ... See full document

... Lin et al. (2010) presented a hybrid algorithm called MPSO consisting of particle swarm optimization (PSO), a multiple-type individual enhancement (MIE) scheme based on SA technique, and random-key (RK) encoding scheme ... See full document

... optimal subset of items are called Single Knapsack Problems.. The 0-1.[r] ... See full document

... a problem in which all customer demand must be satisfied, all demands are known, all vehicles have identical, limited capacity and are based at a central ... See full document

... Abstract- One of the main challenges of cloud computing is to assign workloads to the hosts available in the data centers with the help of virtualization, i.e., by using virtual machines. Therefore, suitable resource ... See full document