• Nenhum resultado encontrado

[PDF] Top 20 A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS

Has 10000 "A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS" found on our website. Below are the top 20 most common "A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS".

A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS

A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS

... consider the one-dimensional cutting stock problem of cutting objects of known dimension into smaller ...that the stock objects be cut, which is typically ... See full document

23

Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost

Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost

... patterns with high frequencies of use. The model proposed by Vahrenkamp (1996) considered these two descriptors and the search for the next pattern is chosen according to the best ... See full document

12

Repositório Institucional UFC: Contributions to the two-dimensional guillotine cutting stock problem

Repositório Institucional UFC: Contributions to the two-dimensional guillotine cutting stock problem

... of the two-dimensional guillotine cutting stock problem was ...presented. The variant dealt with the k-stage case in which setup cost related to the stages ... See full document

58

A genetic algorithm for the ligand-protein docking problem

A genetic algorithm for the ligand-protein docking problem

... With the increasing amount of molecular biological structures available, docking approaches have been very important and useful tools in structure-based rational drug discovery and design (Gane and Dean, ... See full document

6

Mathematical Model for Waste Reduction in Aluminum Fabrication Industry in Kuwait

Mathematical Model for Waste Reduction in Aluminum Fabrication Industry in Kuwait

... an algorithm that uses both recursive and dynamic programming techniques to solve a rectangular two-dimensional cutting stock problem in a steel bridge ...examined the classical ... See full document

6

The sequential value correction method for the two-dimensional irregular cutting stock problem.

The sequential value correction method for the two-dimensional irregular cutting stock problem.

... investigates the possibilities for adapting the method of sequential value correction to irregular cutting stock ...rectangular cutting problems. It is used for solving ICSP in ... See full document

14

A genetic symbiotic algorithm applied to the one-dimensional cutting stock problem

A genetic symbiotic algorithm applied to the one-dimensional cutting stock problem

... The genetic symbiotic algorithm (GSA), also called cooperative algorithm (Potter, 1997; Kim et ...breaks the problem down into n sub-problems using n different ...Dividing ... See full document

18

Genetic Algorithm for Flexible Job Shop Scheduling Problem - a Case Study

Genetic Algorithm for Flexible Job Shop Scheduling Problem - a Case Study

... complex problem consisting in determining the optimal allocation of tasks to resources under a set of constraints, which in enterprise business assumes a critical ...requires the use of optimization ... See full document

5

Comput. Appl. Math.  vol.22 número1

Comput. Appl. Math. vol.22 número1

... simplified, one-dimensional model for the optimal design of a plate of variable thickness which is assumed to be infinite along one of its ...general, the Kirchhoff model for pure ... See full document

15

Convalesce Optimization for Input Allocation Problem Using Hybrid Genetic Algorithm

Convalesce Optimization for Input Allocation Problem Using Hybrid Genetic Algorithm

... learning: The Lamarckian approach is based on the inheritance of acquired characteristics obtained through ...forces the genetic structure to reflect the result of local ...search. ... See full document

4

4 A Dynamical Ant Colony Optimization with Heuristics for Scheduling Jobs on a Single Machine with a Common Due Date

4 A Dynamical Ant Colony Optimization with Heuristics for Scheduling Jobs on a Single Machine with a Common Due Date

... scheduling problem with a common due date, known as NP-complete problem, has been investigated extensively ...of problem has become an attraction research with the advent of ... See full document

14

A Biased Random Key Genetic Algorithm Approach for Unit Commitment Problem

A Biased Random Key Genetic Algorithm Approach for Unit Commitment Problem

... applying Genetic Algorithms (GAs) to find good quality solutions for the UC ...problem. The majority of the reported GA implementations to ad- dress the UC problem are ... See full document

12

A new fuzzy algorithm for ecological ranking

A new fuzzy algorithm for ecological ranking

... on the basis of multiple weighted criteria, and then ranked from the best to the worst, or vice ...versa. The resulting ranking is then used to choose the course of an action ...(e.g., ... See full document

3

An Integer Programming Formulation for the Lot Streaming Problem in a Job Shop Environment with Setups

An Integer Programming Formulation for the Lot Streaming Problem in a Job Shop Environment with Setups

... indivisible. The entire lot must be completed before being transferred to its successor operation, which leads to low machine utilization and long completion ...on the other hand, provide the ... See full document

6

A genetic algorithm to solve a multi-product distribution problem

A genetic algorithm to solve a multi-product distribution problem

... The problem to be solved in the dissertation fits, in most part, in the Lot Sizing Problem ...of the latter one. The LSP has many variants resulting from the ... See full document

82

NOVEL RECURSIVE ALGORITHM FOR REALIZATION OF ONE-DIMENSIONAL DISCRETE HARTLEY TRANSFORM

NOVEL RECURSIVE ALGORITHM FOR REALIZATION OF ONE-DIMENSIONAL DISCRETE HARTLEY TRANSFORM

... recursive algorithm for realization of one-dimensional discrete Hartley transform of even ...length. The transform is constructed by single folding of input data and using Chebyshev ...folding ... See full document

8

INTEGRATED CUTTING MACHINE PROGRAMMING AND LOT SIZING IN FURNITURE INDUSTRY Silvia Grandi dos Santos

INTEGRATED CUTTING MACHINE PROGRAMMING AND LOT SIZING IN FURNITURE INDUSTRY Silvia Grandi dos Santos

... around the country, is concentrated in regional centers, mostly situated in the south and southeast regions (Valença et ...in the northwest region of São Paulo state, which is included in the ... See full document

17

Investigation of the three-dimensional lattice HP protein folding model using a genetic algorithm

Investigation of the three-dimensional lattice HP protein folding model using a genetic algorithm

... on the original model’s scoring sys- tem proved to be useful in obtaining structures that are more natural-like (globular), more compact and more seg- ...that the more segregated the structure, ... See full document

5

Level of Repair Analysis based on Genetic Algorithm with Tabu Search

Level of Repair Analysis based on Genetic Algorithm with Tabu Search

... model the objective function has two elements: a fixed costFC of setting up maintenance facilities (test equipment, labour manpower and technical data); and a variable cost CV of ordering and holding spare ... See full document

7

Pesqui. Oper.  vol.22 número2

Pesqui. Oper. vol.22 número2

... into the problem of minimisation. On the other hand, each approximating function is required to contain the DMUs that determine each straight-line ...At the DMU with the ... See full document

19

Show all 10000 documents...