• 沒有找到結果。

[PDF] Top 20 An approximately global optimization method for assortment problems

Has 10000 "An approximately global optimization method for assortment problems" found on our website. Below are the top 20 most common "An approximately global optimization method for assortment problems".

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

Approximately global optimization for assortment problems using piecewise linearization techniques

Approximately global optimization for assortment problems using piecewise linearization techniques

... proposed an approximate model for assortment ...find approximately global solution, too many 0–1 variables are required in their solution ...way for solving the same problem. The ... See full document

6

A global optimization method for packing problems

A global optimization method for packing problems

... Packing; Global optimization; Piecewise linearization ...packing optimization problems is to seek a minimal volume container which can contain a given set of small three-dimensional (3D) ... See full document

15

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 0}1 ... See full document

8

A global optimization method for nonconvex separable programming problems

A global optimization method for nonconvex separable programming problems

... (NSP) problems by mixed integer program- ming methods requires adding numerous 0±1 ...new method of deriving the global optimum of a NSP program using less number of 0±1 ...solvable for ... See full document

18

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

Global optimization for signomial discrete programming problems in engineering design

Global optimization for signomial discrete programming problems in engineering design

... novel method to solve signomial discrete programming (SDP) problems frequently occurring in engineering ...proposed method is guaranteed to converge to a global optimum, is computationally ... See full document

11

An improved vector particle swarm optimization for constrained optimization problems

An improved vector particle swarm optimization for constrained optimization problems

... constrained optimization problems (COP) fre- quently encountered in real-world ...paper, an improved vector particle swarm optimization (IVPSO) algorithm is proposed to solve ...the ... See full document

5

A theoretical aspect of a stochastic sketching method for global optimization

A theoretical aspect of a stochastic sketching method for global optimization

... new method for global ...solve global optimization problems in this ...only an empty canvas, drawing tools, and a still ...process for human be- ings may not be ... See full document

25

Solving Packing Problems by a Distributed Global Optimization Algorithm

Solving Packing Problems by a Distributed Global Optimization Algorithm

... methods for solving three-dimensional packing problems, Chen et ...program for container loading problems, and Li and Chang 6 developed a method for finding the approximate ... See full document

14

An interval method for computing the stability margin of real uncertainty problems

An interval method for computing the stability margin of real uncertainty problems

... tool for error ...the global optimization problem and systems of non-linear equations [2, ...become an important mathematical tool for solving the problems of global ... See full document

9

A robust evolutionary algorithm for global optimization

A robust evolutionary algorithm for global optimization

... new method called family competition evolutionary algorithm (FCEA) is proposed for solving global optimization ...35 for con- trolling step sizes to construct the relationship among ... See full document

22

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

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

... deterministic global optimizer which can guarantee convergence to the global solution, there are many ...easy for implementation and no gradient information is ...the global solution is high ... See full document

18

Parameter identification for leaky aquifers using global optimization methods

Parameter identification for leaky aquifers using global optimization methods

... parameters, an analytical aquifer model was required to estimate the predicted ...a global optimization method of simulated annealing (SA) or a genetic algorithm (GA) to determine the best-fit ... See full document

11

Chaotic catfish particle swarm optimization for solving global numerical optimization problems

Chaotic catfish particle swarm optimization for solving global numerical optimization problems

... This results in further opportunities of finding better solutions for the swarm by guiding the entire swarm to promising new regions of the search space and accelerating the search. The introduced chaotic maps ... See full document

8

AN EFFICIENT METHOD FOR UNCONSTRAINED OPTIMIZATION PROBLEMS OF NONLINEAR LARGE MESH-INTERCONNECTED SYSTEMS

AN EFFICIENT METHOD FOR UNCONSTRAINED OPTIMIZATION PROBLEMS OF NONLINEAR LARGE MESH-INTERCONNECTED SYSTEMS

... scaled gradient method with a block Gauss-Seidel with line search (BGSLS) method. Although each of the above methods is well known, combining them into one method is a[r] ... See full document

6

An efficient method for solving linear goal programming problems

An efficient method for solving linear goal programming problems

... The proposed method, however, uses a smaller number of variables to reach the optimal solution. Conclusions[r] ... See full document

5

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

... algorithm for global optimization ...and an inferior group based on their fitness ...search for better solutions near the current best position. The global mutation model is ... See full document

16

An augmented method for free boundary problems with moving contact lines

An augmented method for free boundary problems with moving contact lines

... t An augmented immersed interface method (IIM) is proposed for simulating one-phase moving contact line problems in which a liquid drop spreads or recoils on a solid ...numerical ... See full document

8

An optimization algorithm for cutting stock problems in the TFT-LCD industry

An optimization algorithm for cutting stock problems in the TFT-LCD industry

... stock optimization method for TFT-LCD industry, which can find the optimal cutting way accord- ing to the quantities of ...The optimization techniques for finding alternative solutions ... See full document

7

Show all 10000 documents...