نتایج جستجو برای: objective programming mop

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

2013
Duy Tin Truong

Although population-based algorithms are robust in solving Multi-objective Optimization Problems (MOP), they often require a large number of function evaluations. In contrast, individual-solution based algorithms are fast but can be stuck in local minima. To solve these problems, we introduce a fast and adaptive local search algorithm for MOP. Our algorithm is an individual-solution algorithm w...

2005
Igor Bisio

The paper formalizes the bandwidth allocation process over space communication systems as a Multi – Objective Programming (MOP) problem and proposes an allocation scheme based on the GOAL programming called “Minimum Distance” (MD) algorithm. The method is aimed at following the performance obtained by each station when there is no conflict among the stations to access the channel. In short, the...

Journal: :Mathematical and Computer Modelling 2011
B. A. Ghaznavi-ghosoni Esmaile Khorram

This paper deals with approximate solutions of general (that is, without any convexity assumption) multi-objective optimization problems (MOPs). In this text, by reviewing some standard scalarization techniques we are interested in finding the relationships between ε-(weakly, properly) efficient points of an MOP and ε-optimal solutions of the related scalarized problem. For this purpose, the re...

2005
Feng Chen Grigore Rosu

A Java-based tool-supported software development and analysis framework is presented, where monitoring is a foundational principle. Expressive requirements specification formalisms can be included into the framework via logic plug-ins, allowing one to refer not only to the current state, but also to both past and future states.

2017
Desheng Wu David L. Olson

This paper considers three types of risk evaluation models within supply chains: chance constrained programming (CCP), data envelopment analysis (DEA), and multi-objective programming (MOP) models. Various risks are modeled in the form of probability and simulation of specific probability distribution in risk-embedded attributes is conducted in these three types of risk evaluation models. We mo...

Journal: :cell journal 0

objective: 8-methoxypsoralen (8-mop) is a photoactive compound widely used in the treatment of proliferate disorders. the present study investigates the effects of 8-mop on ovary function and pituitary-gonad axis in mice. materials and methods: in this experimental analytical study, 45 female balb/c mice were divided into three groups (n=15), control, sham (olive oil injection) and experimental...

Journal: :اقتصاد و توسعه کشاورزی 0
باقری باقری فرج زاده فرج زاده

abstract regarding the imprecise or fuzzy data on the agriculture activities, applying models based on fuzzy data may be useful. in line with this condition this study tries to compare the ability of possiblistic programming approach in developing optimal solution with fuzzy and deterministic programming. to get this objective a data set obtained from 90 farmers of kohgilooye region, gathered i...

2014
Marius Senftleben Mihai Bucicoiu Erik Tews Frederik Armknecht Stefan Katzenbeisser Ahmad-Reza Sadeghi

Microblogging services have become popular, especially since smartphones made them easily accessible for common users. However, current services like Twitter rely on a centralized infrastructure, which has serious drawbacks from privacy and reliability perspectives. In this paper, we present a decentralized privacy-preserving microblogging infrastructure based on a distributed peer-to-peer netw...

2007
Sibel Yaman Chin-Hui Lee

The design of supervised learning systems for classification require finding a trade-off among a number of competing performance criteria. A common approach is to optimize an overall objective derived from the individual performance objectives. Such a simplified approach promises only for the chosen performance metric when evaluated over the training samples, yet does not make any guarantee on ...

2016
Merve Bodur Shabbir Ahmed Natashia Boland George L. Nemhauser H. Milton Stewart

We consider integer programming (IP) problems consisting of (possibly a large number of) subsystems and a small number of coupling constraints that link variables from different subsystems. Such problems are called loosely coupled or nearly decomposable. Motivated by recent developments in multiobjective programming (MOP), we develop a MOP-based decomposition algorithm to solve loosely coupled ...

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

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