• 沒有找到結果。

[PDF] Top 20 Solving Packing Problems by a Distributed Global Optimization Algorithm

Has 10000 "Solving Packing Problems by a Distributed Global Optimization Algorithm" found on our website. Below are the top 20 most common "Solving Packing Problems by a Distributed Global Optimization Algorithm".

Solving Packing Problems by a Distributed Global Optimization Algorithm

Solving Packing Problems by a Distributed Global Optimization Algorithm

... Packing problems often arise in logistic ...proposed algorithm in transportation problem and compare the result with traditional genetic ...into a container so as to deliver to 6 different ... See full document

14

A global optimization method for packing problems

A global optimization method for packing problems

... the global optimum of a packing ...efficiency a direction for future development is to implement the proposed method in a distributed computation ...use a heuristic method ... See full document

15

A distributed computation algorithm for solving portfolio problems with integer variables

A distributed computation algorithm for solving portfolio problems with integer variables

... for solving Problem 1, as described below: (i) Dual Lagrangean relaxation approach (Michelon and Maculan, 1991; Guignard and Kim, 1987): This approach decomposes Problem 1 into two sub-problems which share ... See full document

10

Chaotic catfish particle swarm optimization for solving global numerical optimization problems

Chaotic catfish particle swarm optimization for solving global numerical optimization problems

... field. A GA is a sto- chastic search procedure based on the mechanics of natural selection, genetics and evolution ...of algorithm simultaneously evaluates many points in the search space, it is more ... See full document

8

A robust evolutionary algorithm for global optimization

A robust evolutionary algorithm for global optimization

... paper a new method called family competition evolutionary algorithm (FCEA) is proposed for solving global optimization ...is a multi-operator approach which combines three ... See full document

22

Global optimization for signomial discrete programming problems in engineering design

Global optimization for signomial discrete programming problems in engineering design

... [5]. By utilizing a branch- bound algorithm or an outer approximation algorithm, a convex 0–1 program can be solved conveniently to reach a global ...optimum. A ... See full document

11

Solving the Multi-objective Dynamic Optimization Problems with Fuzzy Satisfying Method

Solving the Multi-objective Dynamic Optimization Problems with Fuzzy Satisfying Method

... programming. By using the accessible grid points and region-reduction strategy, the IDP can successfully overcome the curse of dimensionality, and its computational effectiveness has been elucidated in many ... See full document

18

Dynamic group-based differential evolution using a self-adaptive strategy for global optimization problems

Dynamic group-based differential evolution using a self-adaptive strategy for global optimization problems

... find a suitable group size. 3.1 GDE algorithm In the DE algorithm, the mutation operation is a kernel oper- ator that acts on all individuals to search potential solutions and leads to ... See full document

16

A Heuristic Approach for Solving Irregular Shapes Packing Problem 林東養、吳泰熙

A Heuristic Approach for Solving Irregular Shapes Packing Problem 林東養、吳泰熙

... faced by the industries, such as shoes making, textile, steel, clothing,and furniture, ...and packing problem, in order to obtain a good (optimal or near optimal) pattern in an acceptable ...problem, ... See full document

1

A HYBRID NEURAL NETWORK MODEL FOR SOLVING OPTIMIZATION PROBLEMS

A HYBRID NEURAL NETWORK MODEL FOR SOLVING OPTIMIZATION PROBLEMS

... Since Hopfield and Tank [SI constructed an energy function to represent the Traveling Salesman Problem (TSP) so that it could be iteratively solved on their neural ne[r] ... See full document

10

On solving rectangle bin packing problems using genetic algorithms

On solving rectangle bin packing problems using genetic algorithms

... There a r e three versions of rectangle bin packing problems to be discussed in this paper: t h e first version is to minimize the packing area, the second version is [r] ... See full document

8

A fast algorithm for assortment optimization problems

A fast algorithm for assortment optimization problems

... Assortment optimization problems intend to seek the best way of placing a given set of rectangles within a minimum-area ...Such problems are often formulated as a quadratic mixed ... See full document

8

A global optimization method for nonconvex separable programming problems

A global optimization method for nonconvex separable programming problems

... of solving nonconvex separable programming (NSP) problems by mixed integer program- ming methods requires adding numerous 0±1 ...present a new method of deriving the global optimum of ... See full document

18

Solving Container Loading Problems by Genetic Algorithm 李其憲、吳泰熙

Solving Container Loading Problems by Genetic Algorithm 李其憲、吳泰熙

... presents a heuristic methods for solving container loading problem. A ” bottom-back-left ” packing approach with GA is used and ...be solving a best solution in acceptable time. ... See full document

2

An approximately global optimization method for assortment problems

An approximately global optimization method for assortment problems

... Although Chen et al.'s model is quite promising to find solutions, there are two inadequacies in their model: firstly, the objective function in their model is a polynomial term, w[r] ... See full document

9

Heuristic Approaches for Solving Two-dimensional Packing Problems 趙楷、吳泰熙

Heuristic Approaches for Solving Two-dimensional Packing Problems 趙楷、吳泰熙

... Two-dimensional packing and cutting problems are a kind of common tasks encountered by industries, such as shoes making, textile, steel, clothing, ...propose a simulated annealing (SA) ... See full document

2

The TOC-based algorithm for solving product mix problems

The TOC-based algorithm for solving product mix problems

... when a plant has multiple resource ...explicit algorithm to address the problem. When testing its e € ectiveness by using a dual-simplex method with bounded variables, this algorithm ... See full document

12

An approximate approach of global optimization for polynomial programming problems

An approximate approach of global optimization for polynomial programming problems

... Several polynomial programming examples in the literature are tested to demonstrate that the proposed method can systematically solve these examples to find the gl[r] ... See full document

8

Approximately global optimization for assortment problems using piecewise linearization techniques

Approximately global optimization for assortment problems using piecewise linearization techniques

... approximately global solution, too many 0–1 variables are required in their solution ...for solving the same problem. The proposed method uses iteratively a technique of piecewise linearization of ... See full document

6

SOLVING SORTING AND RELATED
PROBLEMS BY QUADRATIC PERCEPTRONS

SOLVING SORTING AND RELATED PROBLEMS BY QUADRATIC PERCEPTRONS

... Taylor Indexing terms: Pulse generation, Nonlinear optics Square pulses with controllable picosecond durations have been generated from a CW input signal in the regio[r] ... See full document

3

Show all 10000 documents...