نتایج جستجو برای: allocation problem bi level programming branch and bound full enumeration clustering
تعداد نتایج: 17074859 فیلتر نتایج به سال:
One of the most complicated decision making problems for managers is the evaluation of bank performance, which involves various criteria. There are many studies about bank efficiency evaluation by network DEA in the literature review. These studies do not focus on multi-level network. Wu (Eur J Oper Res 207:856–864, 2010) proposed a bi-level structure for cost efficiency at the first time. In t...
The facility location problem described in this paper comes from an industrial application in the slaughterhouse industry of Norway. Investigations show that the slaughterhouse industry experiences economies of scale in the production facilities. We examine a location-allocation problem focusing on the location of slaughterhouses, their size and the allocation of animals in the different farmin...
In this paper, Generation Companies (GENCOs) bidding in wholesale electricity market is explained with considering the effect of transmission network and uncertainty about bidding strategy adopted by rival GENCOs. Due to oligopolistic restructured electricity market, economic model of supply function equilibrium is used for modeling GENCOs competing. In this competition, each GENCO is in search...
To ensure the equity of exclusive bus lane (EBL) allocation under multimodal traffic conditions, a bi-level programming model is first constructed. The upper-level minimum total system cost considering Gini coefficient and lower-level constructed stochastic user equilibrium (SUE) based on logit loading. Secondly, heuristic algorithm combining an improved genetic (GA) method successive average (...
This paper addresses the problem of minimizing a sum of fractional functions over a convex set, where each fractional function is described by the ratio between a convex and a concave function. Linear-fractional programming problems fall into this category as important special cases. Two global optimization algorithms based on a suitable reformulation of the problem in the outcome space are pro...
While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...
Optimization problems involving two decision makers at two different decision levels are referred to as bilevel programming problems. In this work, we present a novel algorithm for the exact and global solution of two classes of bi-level programming problems, namely (i) bi-level mixed-integer linear programming problems (B-MILP) and (ii) bi-level mixed-integer quadratic programming problems (B-...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید