نتایج جستجو برای: two stage decomposing heuristic

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

2015
Steven T. Piantadosi Benjamin Y. Hayden

Economists often model choices as if decision-makers assign each option a scalar value variable, known as utility, and then select the option with the highest utility. It remains unclear whether as-if utility models describe real mental and neural steps in choice. Although choices alone cannot prove the existence of a utility stage, utility transformations are often taken to provide the most pa...

Journal: :Computers & Chemical Engineering 2010
Ramkumar Karuppiah Mariano Martín Ignacio E. Grossmann

ABSTRACT In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approximation strategy where we reduce the number of scenarios and obtain an approximation of the original multiscenario optimization problem. In this strategy, a subset of the given set of scenarios is selected bas...

Journal: :Computers & Industrial Engineering 2015
Dong Zhang Henry Y. K. Lau Chuhang Yu

Airline disruptions incurred huge cost for airlines and serious inconvenience for travelers. In this paper, we study the integrated aircraft and crew schedule recovery problem. A two stage heuristic algorithm for the integrated recovery problem is proposed. In the first stage, the integrated aircraft recovery and flight-rescheduling model with partial crew consideration is built. This model is ...

2011
Jinlong Zhou Xipeng Qiu Xuanjing Huang

Sparse learning framework, which is very popular in the field of nature language processing recently due to the advantages of efficiency and generalizability, can be applied to Conditional Random Fields (CRFs) with L1 regularization method. Stochastic gradient descent (SGD) method has been used in training L1-regularized CRFs, because it often requires much less training time than the batch tra...

Journal: :journal of optimization in industrial engineering 2014
mahdi bashiri amir hossein parsa manesh hamid hasanzadeh

in this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (nlgp) by using an efficient initial point. some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by data envelopment analysis...

Journal: :International Journal of Mathematics in Operational Research 2018

2013
M. Bashiri M. Bagheri

Design of Cellular Manufacturing System (CMS) involves four major decisions: Cell formation (CF), Group layout (GL), Group scheduling (Gs) and Resource assignment (RA). These problems should be regarded, concurrently, in order to obtain an optimal solution in a CM environment. However; solving complexity by simultaneous consideration of these problems will be increased. In order to over come th...

Journal: :IJEOE 2012
Igor S. Litvinchev Edith Lucero Ozuna Espinosa

In the two-stage capacitated facility location problem a single product is produced at some plants in order to satisfy customer demands. The product is transported from these plants to some depots and then to the customers. The capacities of the plants and depots are limited. The aim is to select cost minimizing locations from a set of potential plants and depots. This cost includes fixed cost ...

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

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