Multicriterion optimization of composite laminates for maximum failure margins with an interactive descent algorithm

Kere, Petri; Koski, Juhani

doi:10.1007/s00158-002-0205-3

Cited by 10 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such problems are commonly encountered in many areas of human activity including business, management, engineering and many other areas where decision-making requires consideration of competing objectives. Examples of the use of MOILPs can be found in capital budgeting (Bhaskar, 1979), location analysis (Ferreira et al, 1994) and engineering design (Kere and Koski, 2002).…”

Section: Introductionmentioning

confidence: 99%

Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming

Abbas

Chergui

Mehdi

2012

IJMOR

View full text Add to dashboard Cite

In this paper, a branch and bound multi-objective based method is proposed for reaching the non-dominated set. Two types of nodes are considered in the tree-search. The first type characterises the non-integer solutions found which are transformed to integer solutions by applying a branching procedure. The second type of nodes contains an integer solution and in this case efficient cuts are established in order either to remove dominated integer vectors or to fathom them. The method is compared advantageously with two exact methods of the literature tailored for the general case and also analysed computationally on benchmarks of MCDM library.Keywords: branch and bound; multi-objective programming; nondominated solution.Reference to this paper should be made as follows: Abbas, M., Chergui, M.E-A. and Mehdi, M.A. (2012) 'Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming', Int. Efficient cuts for generating the non-dominated vectors for MOILP 303of Mathematics and Laboratory LAID3, USTHB, his research interests include mathematical technics and tools for combinatorial optimisation problems. He works on modelling and solving real-world problems as an expert and develops exact and metaheuristic methods for multiobjective discrete optimisation problems. His recent works are focused on Multiobjective Combinatorial Optimisation (MOCO) in linear, hyperbolic and quadratic cases.Meriem Ait Mehdi received her Master's Degree in Operation Research from the

show abstract

Section: Introductionmentioning

confidence: 99%

Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming

Abbas

Chergui

Mehdi

2012

IJMOR

View full text Add to dashboard Cite

show abstract

“…Examples may be found in many areas where decision-making requires consideration of competing objectives, such as capital budgeting (Bhaskar, 1979), location analysis (Ferreira, Climaco, and Paixão, 1994), and engineering design (Kere and Koski, 2002).…”

Section: Introductionmentioning

confidence: 99%

An improved algorithm for solving biobjective integer programs

2006

View full text Add to dashboard Cite

A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that provides access to all Pareto outcomes. Extensive computational tests on instances of the biobjective knapsack problem and a capacitated network routing problem are presented.

show abstract

“…In many of the topological optimization studies, homogenization method 243,358,378,427,466,472,514,528,776,806,828,846,886,888,925,939,966,982 is used. In some of the studies, researchers used search algorithms specifically developed for composites optimization like layerwise optimization, 206,447,490,586,630,681,688,723,783,837,895 in which each layer is one-by-one sequentially optimized. In some of the studies, 192,261,269,293,429,452,495,501,563,753,775,868,871,894,912,948 multilevel approach is adopted in which one objective function is extremized after another or the same objective function is extremized using different design variables at different stages.…”

Section: Introductionmentioning

confidence: 99%

Optimum Design of Composite Structures: A Literature Survey (1969–2009)

Sonmez

2016

Journal of Reinforced Plastics and Composites

View full text Add to dashboard Cite

Optimum structural design of composites is a research subject that has drawn the attention of many researchers for more than 40 years with a growing interest. In this study, a review of the literature on this subject is presented. The papers are classified according to the type of the composite structure optimized in those studies, the loading conditions, the objective function, the structural analysis method, the design variables, the constraints, the failure criteria, and the search algorithm used by the researchers.

show abstract

Multicriterion optimization of composite laminates for maximum failure margins with an interactive descent algorithm

Cited by 10 publications

References 19 publications

Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming

Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming

An improved algorithm for solving biobjective integer programs

Optimum Design of Composite Structures: A Literature Survey (1969–2009)

Contact Info

Product

Resources

About