نتایج جستجو برای: multi objective simulated annealing mosa

تعداد نتایج: 1117567  

Journal: :international journal of advanced biological and biomedical research 2013
marzieh mohammadi gholam-abass barani kourosh qaderi

earth dam is a structure as homogeneous or non-homogeneous forms for raising water level or water supply. earth dam consist of different parts that one of the main parts is clay core. choosing an optimal non permeable core which causes reduction of seepage through dam body and also being stable is necessary. the objective of this research is to optimize the geometry of earth dam clay core such ...

2011
Parag C. Pendharkar

We consider a special type of dimensionality reduction classification problem where the decision-making objective is to minimize misclassification cost and attributes (MMCA). We propose a two-stage solution approach for solving the MMCA problem. Using simulated data sets and different misclassification cost matrices, we test our two-stage exhaustive and simulated annealing procedures. Our resul...

2011
Matthias Springer

Metaheuristics are general problem solving algorithms which abstract from the actual problem description. Therefore they can be easily applied to many optimization problems. Simulated annealing is a simple and fast metaheuristic with an analogy to metal processing. As metal particles generate a solid and regular structure when cooling slowing simulated annealing seeks a low-energy solution avoi...

1995
Thouraya Daouas Khaled Ghédira Jean-Pierre Müller

Because of its highly combinatorial aspect, its dynamic nature and its practical interest for manufacturing systems, the scheduling problem has been widely studied in the literature by various methods: heuristics, constraint propagation techniques, Constraint Satisfaction Problem formalism, simulated annealing, Taboo search, genetic algorithms, neural networks, etc. This paper deals with the Fl...

2011
Alexander G. Nikolaev Sheldon H. Jacobson

Simulated annealing is a well-studied local search metaheuristic used to address discrete and, to a lesser extent, continuous optimization problems. The key feature of simulated annealing is that it provides a mechanism to escape local optima by allowing hill-climbing moves (i.e., moves which worsen the objective function value) in hopes of finding a global optimum. A brief history of simulated...

2016
Arun Raj Kumar

Due to advancement in reconfigurable computing, Field Programmable Gate Array (FPGA) has gained significance due to its low cost and fast prototyping. Parallelism, specialization, and hardware level adaptation, are the key features of reconfigurable computing. FPGA is a programmable chip that can be configured or reconfigured by the designer, to implement any digital circuit. One major challeng...

A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...

2004
F. DURBIN J. HAUSSY P. SIARRY W. M. ZUBEREK

The circuit design problem consists in determining acceptable parameter values (resistors, capacitors, transistor geometries . . . I which allow the circuit to meet various user given operational criteria (DC consumption, AC bandwidth, transient rise times, etc). This task is equivalent to a multidimensional and/or multi objective optimization problem: n-variables functions have to be minimized...

2005
Mark Fleischer

This article describes a set function that maps a set of Pareto optimal points to a scalar. A proof is presented that shows that the maximization of this scalar value constitutes the necessary and sufficient condition for the function’s arguments to be maximally diverse Pareto optimal solutions of a discrete, multi-objective, optimization problem. This scalar quantity, a hypervolume based on a ...

2003
Mark Fleischer

This article describes a set function that maps a set of Pareto optimal points to a scalar. A proof is presented that shows that the maximization of this scalar value constitutes the necessary and sufficient condition for the function’s arguments to be maximally diverse Pareto optimal solutions of a discrete, multi-objective, optimization problem. This scalar quantity, a hypervolume based on a ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید