[PDF] Top 20 The Resolution of Packing Problems Using Simulated Annealing and Genetic Algorithms

... the genetic algorithm, and then it fic- titiously places the guillotine in the top, right-hand corner of the metal sheet and attempts to start cut- ting the different pieces one by ... See full document

... To the best of our knowledge so far no solution procedure has been proposed to this problem. The complexity of the problem necessitates meta-heuristic methods for solving large scale problems. Our contribution is ... See full document

... It is well known that the Steiner tree problem (Hwang and Richards 1992), the underlying model of MRPs, is a NP-hard combinatorial optimisation problem (Garey and Johnson 1979). It has also been proved that finding a ... See full document

... selection using Algorithmic Information ...the algorithms and the entropy function can be derived from the ...for problems with different complexities without relying in nature-inspired models such ... See full document

... based genetic algorithm operating with a simplistic rule set can perform as well or better than an expert, which in this case will be represented by an algorithm explicitly designed for this class of ... See full document

... optimization problems are unlikely to be solved to optimality within polynomially-bounded computation time and the only possibility for coping with such problems is to trade optimality for efficiency ... See full document

... category, genetic algorithm (GA) and simulated annealing (SA) type techniques are two common methods for solving a wide variety of optimiza- tion problems ...[7]. Genetic algorithm has ... See full document

... The resolution framework was reduced to a combinatorial ...GA-based algorithms to obtain approximate solutions within short ...solution using the SA-based algorithm was better than that using ... See full document

... of problems in medium sizes need powerful computers; so the heuristic approaches are used to solve the real problems ...as simulated annealing and genetic algorithms ...and ... See full document

... from genetic individuals that the population in nature, causing a variety of individuals and individual differences and they are apparent and the genetic algorithm and solve problems caused scattered ... See full document

... based problems. The proposed system combines three heuristic algorithms, namely simulated annealing, particle swarm optimization and genetic algorithm to balance the load and to ... See full document

... found [16]. Ribeiro et al. (2002) proposed a hybrid GRASP to solve steiner problems in graphs using weight perturbation and adaptive path relinking heuristic (HGP-PR) [103]. Hirsch et al. (2007) introduced ... See full document

... two algorithms namely SA (simulated annealing) and ACO (ant-colony algorithm) to solve the Scheduling ...ACO algorithms and illustrated the way they are used to solve combinatorial ... See full document

... In this paper, the basic Genetic algorithm is improved by combining it with Simulated annealing Algorithm. The GASA which is synergistic combination of the two algorithms that takes the merits ... See full document

... In this section, we discuss how we adapt the GA algorithm into the video transcoding service composition problem domain. GA is a meta-heuristic searching algorithm used to generate useful solutions to the optimization ... See full document

... BIN PACKING and provide a O (n log n)-time 2-approximate algorithm, where n denotes the number of items of the ...BIN PACKING and improve this further to get a fully asymptotic PTAS, which has a worse ... See full document

... presented simulated an- nealing (MSA), hybrid genetic (HGA) and variable neighborhood search (VNS) algorithms for the max- imally diverse grouping ...these algorithms we conducted ... See full document

... status using image ...models using GAs, DPSO, HBMO, SA, ACO, IWD, DFA, DHRIO and FSI have better performance for minimizing prediction error than model using individual feature-subset or without ... See full document

... a simulated annealing algorithm to minimize the makespan in the single machine scheduling problem with uniform parallel ...The simulated annealing algorithm has emerged from annealing ... See full document

... decomposition method to obtain an approximate solution for the large scale job shop scheduling problem. Halim and Ohta (1993) developed a heuristic algorithm for solving scheduling problem of flow shop with receiving and ... See full document