نتایج جستجو برای: objective mixed integer linear planning
تعداد نتایج: 1404160 فیلتر نتایج به سال:
This paper presents a framework for long term transmission expansion planning in power pool competitive electricity markets. In the proposed approach, maximization of network users’ benefits with satisfying of security constraints is considered for determination of transmission expansion strategy. The proposed model is a complicated non-linear mixed-integer optimization problem. A hybrid ...
this paper investigates the problem of selecting and scheduling a set of projects among available projects. each project consists of several tasks and to perform each one some resource is required. the objective is to maximize total benefit. the paper constructs a mathematical formulation in form of mixed integer linear programming model. three effective metaheuristics in form of the imperialis...
This article addresses a general tri-objective two-echelon capacitated vehicle routing problem (2E-CVRP) to minimize the total travel cost, customers waiting times and carbon dioxide emissions simultaneously in distributing perishable products. In distributing perishable products, customers’ satisfaction is very important and is inversely proportional to the customers waiting times. The propose...
In the present paper a bi-objective integer linear programming problem (BILP) is discussed. The main effort in this work to effectively implement ?-constraint method produce complete set of non dominated points. convergence algorithm has been established theoretically. Further comparative study some existing also made.
Abstract In this article we introduce robustness measures in the context of multi-objective integer linear programming problems. The proposed are line with concept decision robustness, which considers uncertainty respect to implementation a specific solution. An efficient solution is considered be robust if many solutions its neighborhood as well. This rather new area research differs from conc...
We survey the techniques used for presolving Mixed-integer linear programs (MILPs). Presolving is an important component of all modern MILP solvers. It is used for simplifying a given instance, for detecting any obvious problems or errors, and for identifying structures and characteristics that are useful for solving an instance.
This paper presents an application of Benders decomposition to deal with the complexities in the simultaneous Generation Expansion Planning (GEP) and Transmission Expansion Planning (TEP). Unlike the power system operation fields of study, the power system planning methods are not expected to be fast. However, it is always preferable to speed up computations to provide more analysis options for...
a comprehensive and integrated study of any supply chain (sc) environment is a vital requirement that can create various advantages for the sc owners. this consideration causes productive managing of the sc through its whole wide components from upstream suppliers to downstream retailers and customers. on this issue, despite many valuable studies reported in the current literature, considerabl...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید