An Integer Linear Programming model and Adaptive Genetic Algorithm approach to minimize energy consumption of Cloud computing data centers

2018 ◽  
Vol 67 ◽  
pp. 551-565 ◽  
Author(s):  
Huda Ibrahim ◽  
Raafat O. Aburukba ◽  
Khaled El-Fakih
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Linear Programming ◽  
Energy Consumption ◽  
Integer Linear Programming ◽  
Data Centers ◽  
Programming Model ◽  
Adaptive Genetic Algorithm ◽  
Integer Linear Programming Model ◽  
Genetic Algorithm Approach

scholarly journals A mixed integer linear programming model applied in barge planning for Omya

2015 ◽  
Vol 2 ◽  
pp. 150-155 ◽  
Author(s):  
David Bredström ◽  
Kjetil Haugen ◽  
Asmund Olstad ◽  
Jan Novotný
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Programming Model ◽  
Linear Programming Model ◽  
Mixed Integer ◽  
Integer Linear Programming Model

scholarly journals Equivalent Transformation of Nonlinear Constraints to Linear Constraints in Petri Nets

2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
YuFeng Chen ◽  
Abdulrahman Al-Ahmari ◽  
Chi Tin Hon ◽  
NaiQi Wu
Keyword(s):  
Linear Programming ◽  
Petri Nets ◽  
Integer Linear Programming ◽  
Programming Model ◽  
Linear Constraints ◽  
Linear Programming Model ◽  
Equivalent Transformation ◽  
Nonlinear Constraints ◽  
Nonlinear Constraint ◽  
Integer Linear Programming Model

This paper focuses on the enforcement of nonlinear constraints in Petri nets. An integer linear programming model is formulated to transform a nonlinear constraint to a minimal number of conjunctive linear constraints that have the same admissible marking space as the nonlinear one does in Petri nets. The obtained linear constraints can be easily enforced to be satisfied by a set of control places with a place invariant based method. The control places make up a supervisor that can enforce the given nonlinear constraint. For a case that the admissible marking space decided by a nonlinear constraint is nonconvex, another integer linear programming model is developed to obtain a minimal number of constraints whose disjunctions are equivalent to the nonlinear constraint with respect to the reachable markings. Finally, a number of examples are provided to demonstrate the proposed approach.

Sign in / Sign up

Export Citation Format

Share Document