نتایج جستجو برای: fuzzy mixed integer linear programming f milp

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

Journal: :مهندسی برق و الکترونیک ایران 0
m. mollahassani-pour m. rashidinejad a. abdollahi s. nikbakhsh

preventive maintenance scheduling of generating units is addressed as a long-term scheduling in power system studies aiming to increase the reliability incorporating cost reduction. it consists of knowing which generating units should be shut down for regular safety inspection. in this paper, a new formulation of preventive maintenance scheduling associated with cost reduction index (cri) is pr...

Journal: :international journal of smart electrical engineering 0
zahra sabouri department of industrial engineering, faculty of engineering, south tehran branch, islamic azad university, tehran, iran mahmoodreza haghifam department of industrial engineering, faculty of engineering, south tehran branch, islamic azad university, tehran, iran

with the aim of reducing cost of electricity consumption and peak load reduction, tools requirement for better managing electricity consumption have become inevitable in recent years. smart home has some equipment which are controllable and this ability is used for increasing comfort and minimizing electricity cost for residence. as a key component of smart home , electric vehicle(ev) ,increase...

2011
I-Lun Tseng Yung-Wei Kao Cheng-Yuan Chang Adam Postula

Channel routing is a type of problems arising in the detailed routing phase of VLSI physical design automation as well as in the design of printed circuit boards (PCBs). It has been known that channel routing problems can be formulated as constraint programming (CP) problems and thus CP solvers can be used to find solutions. In this article, we present a mixed integer linear programming (MILP) ...

2007
Federico Mari Enrico Tronci

Many hybrid systems can be conveniently modeled as Piecewise Affine Discrete Time Hybrid Systems PA-DTHS. As well known Bounded Model Checking (BMC) for such systems comes down to solve a Mixed Integer Linear Programming (MILP) feasibility problem. We present a SAT based BMC algorithm for automatic verification of PA-DTHSs. Using Counterexample Guided Abstraction Refinement (CEGAR) our algorith...

2006
Toni Jarimo Ahti Salo

In this paper, we consider the problem of partner selection in a virtual organisation (VO); specifically, we develop mixed integer linear programming (MILP) models to support the configuration of VOs in a virtual organisation breeding environment (VBE). Apart from the basic model which focuses on the minimisation of total fixed and variable costs we present extensions which capture transportati...

2006
Toni Jarimo Ahti Salo

In this paper, we consider the problem of partner selection in a virtual organisation (VO); specifically, we develop mixed integer linear programming (MILP) models to support the configuration of VOs in a virtual organisation breeding environment (VBE). Apart from the basic model which focuses on the minimisation of total fixed and variable costs we present extensions that capture transportatio...

Journal: :Math. Program. 2008
Pierre Bonami Gérard Cornuéjols Sanjeeb Dash Matteo Fischetti Andrea Lodi

Recent experiments by Fischetti and Lodi show that the first Chvátal closure of a pure integer linear program (ILP) often gives a surprisingly tight approximation of the integer hull. They optimize over the first Chvátal closure by modeling the Chvátal–Gomory (CG) separation problem as a mixed integer linear program (MILP) which is then solved by a generalGérard Cornuéjols was supported in part...

Journal: :Computers & OR 2018
Matteo Fischetti Michele Monaci Domenico Salvagnin

SelfSplit is a simple mechanism to convert a sequential tree-search code into a parallel one. In this paradigm, tree-search is distributed among a set of workers, each of which is able to autonomously determine—without any communication with the other workers—the job parts it has to process. SelfSplit already proved quite effective in parallelizing Constraint Programming solvers. In the present...

Journal: :Discrete Applied Mathematics 2017
Matteo Fischetti Leo Liberti Domenico Salvagnin Toby Walsh

We present a method, based on formulation symmetry, for generating Mixed-Integer Linear Programming (MILP) relaxations with fewer variables than the original symmetric MILP. Our technique also extends to convex MINLP, and some nonconvex MINLP with a special structure. We showcase the effectiveness of our relaxation when embedded in a decomposition method applied to two important applications (m...

2002
L. Magatão F. Neves

This paper addresses the problem of developing an optimisation model to aid the operational decision-making process in pipeline systems. The model is applied on a real world pipeline oil distribution scenario, which connects an inland refinery to a harbour, conveying multiple types of commodities. The optimisation model was developed based on mixed integer linear programming (MILP) with uniform...

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

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