Abstract: This paper evaluates the accrual based scheduling for
cloud in single and multi-resource system. Numerous organizations
benefit from Cloud computing by hosting their applications. The
cloud model provides needed access to computing with potentially
unlimited resources. Scheduling is tasks and resources mapping to a
certain optimal goal principle. Scheduling, schedules tasks to virtual
machines in accordance with adaptable time, in sequence under
transaction logic constraints. A good scheduling algorithm improves
CPU use, turnaround time, and throughput. In this paper, three realtime
cloud services scheduling algorithm for single resources and
multiple resources are investigated. Experimental results show
Resource matching algorithm performance to be superior for both
single and multi-resource scheduling when compared to benefit first
scheduling, Migration, Checkpoint algorithms.
Abstract: This paper proposes a novel heuristic algorithm that aims to determine the best size and location of distributed generators in unbalanced distribution networks. The proposed heuristic algorithm can deal with the planning cases where power loss is to be optimized without violating the system practical constraints. The distributed generation units in the proposed algorithm is modeled as voltage controlled node with the flexibility to be converted to constant power factor node in case of reactive power limit violation. The proposed algorithm is implemented in MATLAB and tested on the IEEE 37 -node feeder. The results obtained show the effectiveness of the proposed algorithm.
Abstract: This paper studied the flow shop scheduling problem under machine availability constraints. The machines are subject to flexible preventive maintenance activities. The nonresumable scenario for the jobs was considered. That is, when a job is interrupted by an unavailability period of a machine it should be restarted from the beginning. The objective is to minimize the total tardiness time for the jobs and the advance/tardiness for the maintenance activities. To solve the problem, a genetic algorithm was developed and successfully tested and validated on many problem instances. The computational results showed that the new genetic algorithm outperforms another earlier proposed algorithm.
Abstract: In recent decades, probabilistic constrained optimal
control problems have attracted much attention in many research
fields. Although probabilistic constraints are generally intractable
in an optimization problem, several tractable methods haven been
proposed to handle probabilistic constraints. In most methods,
probabilistic constraints are reduced to deterministic constraints
that are tractable in an optimization problem. However, there is a
gap between the transformed deterministic constraints in case of
known and unknown probability distribution. This paper examines
the conservativeness of probabilistic constrained optimization method
for unknown probability distribution. The objective of this paper is
to provide a quantitative assessment of the conservatism for tractable
constraints in probabilistic constrained optimization with unknown
probability distribution.
Abstract: Batch production plants provide a wide range of
scheduling problems. In pharmaceutical industries a batch process
is usually described by a recipe, consisting of an ordering of tasks
to produce the desired product. In this research work we focused
on pharmaceutical production processes requiring the culture of
a microorganism population (i.e. bacteria, yeasts or antibiotics).
Several sources of uncertainty may influence the yield of the culture
processes, including (i) low performance and quality of the cultured
microorganism population or (ii) microbial contamination. For
these reasons, robustness is a valuable property for the considered
application context. In particular, a robust schedule will not collapse
immediately when a cell of microorganisms has to be thrown away
due to a microbial contamination. Indeed, a robust schedule should
change locally in small proportions and the overall performance
measure (i.e. makespan, lateness) should change a little if at all.
In this research work we formulated a constraint programming
optimization (COP) model for the robust planning of antibiotics
production. We developed a discrete-time model with a multi-criteria
objective, ordering the different criteria and performing a
lexicographic optimization. A feasible solution of the proposed
COP model is a schedule of a given set of tasks onto available
resources. The schedule has to satisfy tasks precedence constraints,
resource capacity constraints and time constraints. In particular
time constraints model tasks duedates and resource availability
time windows constraints. To improve the schedule robustness, we
modeled the concept of (a, b) super-solutions, where (a, b) are input
parameters of the COP model. An (a, b) super-solution is one in
which if a variables (i.e. the completion times of a culture tasks)
lose their values (i.e. cultures are contaminated), the solution can be
repaired by assigning these variables values with a new values (i.e.
the completion times of a backup culture tasks) and at most b other
variables (i.e. delaying the completion of at most b other tasks).
The efficiency and applicability of the proposed model is
demonstrated by solving instances taken from a real-life
pharmaceutical company. Computational results showed that
the determined super-solutions are near-optimal.
Abstract: In this article, we deal with a variant of the classical
course timetabling problem that has a practical application in many
areas of education. In particular, in this paper we are interested in
high schools remedial courses. The purpose of such courses is to
provide under-prepared students with the skills necessary to succeed
in their studies. In particular, a student might be under prepared in
an entire course, or only in a part of it. The limited availability
of funds, as well as the limited amount of time and teachers at
disposal, often requires schools to choose which courses and/or which
teaching units to activate. Thus, schools need to model the training
offer and the related timetabling, with the goal of ensuring the
highest possible teaching quality, by meeting the above-mentioned
financial, time and resources constraints. Moreover, there are some
prerequisites between the teaching units that must be satisfied. We
first present a Mixed-Integer Programming (MIP) model to solve
this problem to optimality. However, the presence of many peculiar
constraints contributes inevitably in increasing the complexity of
the mathematical model. Thus, solving it through a general-purpose
solver may be performed for small instances only, while solving
real-life-sized instances of such model requires specific techniques
or heuristic approaches. For this purpose, we also propose a heuristic
approach, in which we make use of a fast constructive procedure
to obtain a feasible solution. To assess our exact and heuristic
approaches we perform extensive computational results on both
real-life instances (obtained from a high school in Lecce, Italy) and
randomly generated instances. Our tests show that the MIP model is
never solved to optimality, with an average optimality gap of 57%.
On the other hand, the heuristic algorithm is much faster (in about the
50% of the considered instances it converges in approximately half of
the time limit) and in many cases allows achieving an improvement
on the objective function value obtained by the MIP model. Such an
improvement ranges between 18% and 66%.
Abstract: Singular value decomposition based optimisation of
geometric design parameters of a 5-speed gearbox is studied. During
the optimisation, a four-degree-of freedom torsional vibration model
of the pinion gear-wheel gear system is obtained and the minimum
singular value of the transfer matrix is considered as the objective
functions. The computational cost of the associated singular value
problems is quite low for the objective function, because it is only
necessary to compute the largest and smallest singular values (μmax
and μmin) that can be achieved by using selective eigenvalue solvers;
the other singular values are not needed. The design parameters are
optimised under several constraints that include bending stress,
contact stress and constant distance between gear centres. Thus, by
optimising the geometric parameters of the gearbox such as, the
module, number of teeth and face width it is possible to obtain a
light-weight-gearbox structure. It is concluded that the all optimised
geometric design parameters also satisfy all constraints.
Abstract: In this paper, we consider a cognitive relay network
(CRN) in which the primary receiver (PR) is protected by peak
transmit power ¯PST and/or peak interference power Q constraints.
In addition, the interference effect from the primary transmitter (PT)
is considered to show its impact on the performance of the CRN. We
investigate the outage probability (OP) and outage capacity (OC) of
the CRN by deriving closed-form expressions over Rayleigh fading
channel. Results show that both the OP and OC improve by increasing
the cooperative relay nodes as well as when the PT is far away from
the SR.
Abstract: Based on Business and Consumer Survey (BCS) data,
the European Commission (EC) regularly publishes the monthly
Economic Sentiment Indicator (ESI) for each EU member state. ESI
is conceptualized as a leading indicator, aimed ad tracking the overall
economic activity. In calculating ESI, the EC employs arbitrarily
chosen weights on 15 BCS response balances. This paper raises the
predictive quality of ESI by applying nonlinear programming to find
such weights that maximize the correlation coefficient of ESI and
year-on-year GDP growth. The obtained results show that the highest
weights are assigned to the response balances of industrial sector
questions, followed by questions from the retail trade sector. This
comes as no surprise since the existing literature shows that the
industrial production is a plausible proxy for the overall Croatian
economic activity and since Croatian GDP is largely influenced by
the aggregate personal consumption.
Abstract: This paper proposes a novel heuristic algorithm that aims to determine the best size and location of distributed generators in unbalanced distribution networks. The proposed heuristic algorithm can deal with the planning cases where power loss is to be optimized without violating the system practical constraints. The distributed generation units in the proposed algorithm is modeled as voltage controlled node with the flexibility to be converted to constant power factor node in case of reactive power limit violation. The proposed algorithm is implemented in MATLAB and tested on the IEEE 37 -node feeder. The results obtained show the effectiveness of the proposed algorithm.
Abstract: In this study, we demonstrate the production of natural gas hydrates from permeable marine sediments with simultaneous mechanisms for methane recovery and methane-air or methane-air/carbon dioxide replacement. The simultaneous melting happens until the chemical potentials become equal in both phases as natural gas hydrate depletion continues and self-regulated methane-air replacement occurs over an arbitrary point. We observed certain point between dissociation and replacement mechanisms in the natural gas hydrate reservoir, and we call this boundary as critical methane concentration. By the way, when carbon dioxide was added, the process of chemical exchange of methane by air/carbon dioxide was observed in the natural gas hydrate. The suggested process will operate well for most global natural gas hydrate reservoirs, regardless of the operating conditions or geometrical constraints.
Abstract: Cooperative spectrum sensing is a crucial challenge in
cognitive radio networks. Cooperative sensing can increase the
reliability of spectrum hole detection, optimize sensing time and
reduce delay in cooperative networks. In this paper, an efficient
central capacity optimization algorithm is proposed to minimize
cooperative sensing time in a homogenous sensor network using OR
decision rule subject to the detection and false alarm probabilities
constraints. The evaluation results reveal significant improvement in
the sensing time and normalized capacity of the cognitive sensors.
Abstract: Data mining idea is mounting rapidly in admiration
and also in their popularity. The foremost aspire of data mining
method is to extract data from a huge data set into several forms that
could be comprehended for additional use. The data mining is a
technology that contains with rich potential resources which could be
supportive for industries and businesses that pay attention to collect
the necessary information of the data to discover their customer’s
performances. For extracting data there are several methods are
available such as Classification, Clustering, Association,
Discovering, and Visualization… etc., which has its individual and
diverse algorithms towards the effort to fit an appropriate model to
the data. STATISTICA mostly deals with excessive groups of data
that imposes vast rigorous computational constraints. These results
trials challenge cause the emergence of powerful STATISTICA Data
Mining technologies. In this survey an overview of the STATISTICA
software is illustrated along with their significant features.
Abstract: This paper proposes a mathematical model and
examines the performance of an exact algorithm for a location–
transportation problems in humanitarian relief. The model determines
the number and location of distribution centers in a relief network,
the amount of relief supplies to be stocked at each distribution center
and the vehicles to take the supplies to meet the needs of disaster
victims under capacity restriction, transportation and budgetary
constraints. The computational experiments are conducted on the
various sizes of problems that are generated. Branch and bound
algorithm is applied for these problems. The results show that this
algorithm can solve problem sizes of up to three candidate locations
with five demand points and one candidate location with up to twenty
demand points without premature termination.
Abstract: In this paper, we consider the vehicle routing problem
with mixed fleet of conventional and heterogenous electric vehicles
and time dependent charging costs, denoted VRP-HFCC, in which
a set of geographically scattered customers have to be served by a
mixed fleet of vehicles composed of a heterogenous fleet of Electric
Vehicles (EVs), having different battery capacities and operating
costs, and Conventional Vehicles (CVs). We include the possibility
of charging EVs in the available charging stations during the routes
in order to serve all customers. Each charging station offers charging
service with a known technology of chargers and time dependent
charging costs. Charging stations are also subject to operating time
windows constraints. EVs are not necessarily compatible with all
available charging technologies and a partial charging is allowed.
Intermittent charging at the depot is also allowed provided that
constraints related to the electricity grid are satisfied.
The objective is to minimize the number of employed vehicles and
then minimize the total travel and charging costs.
In this study, we present a Mixed Integer Programming Model and
develop a Charging Routing Heuristic and a Local Search Heuristic
based on the Inject-Eject routine with different insertion methods. All
heuristics are tested on real data instances.
Abstract: The objective of the Economic Dispatch(ED) Problems
of electric power generation is to schedule the committed generating
units outputs so as to meet the required load demand at minimum
operating cost while satisfying all units and system equality and
inequality constraints. This paper presents a new method of ED
problems utilizing the Max-Min Ant System Optimization.
Historically, traditional optimizations techniques have been used,
such as linear and non-linear programming, but within the past
decade the focus has shifted on the utilization of Evolutionary
Algorithms, as an example Genetic Algorithms, Simulated Annealing
and recently Ant Colony Optimization (ACO). In this paper we
introduce the Max-Min Ant System based version of the Ant System.
This algorithm encourages local searching around the best solution
found in each iteration. To show its efficiency and effectiveness, the
proposed Max-Min Ant System is applied to sample ED problems
composed of 4 generators. Comparison to conventional genetic
algorithms is presented.
Abstract: Economic Dispatch (ED) is one of the most
challenging problems of power system since it is difficult to determine
the optimum generation scheduling to meet the particular load demand
with the minimum fuel costs while all constraints are satisfied. The
objective of the Economic Dispatch Problems (EDPs) of electric
power generation is to schedule the committed generating units
outputs so as to meet the required load demand at minimum operating
cost while satisfying all units and system equality and inequality
constraints. In this paper, an efficient and practical steady-state genetic
algorithm (SSGAs) has been proposed for solving the economic
dispatch problem. The objective is to minimize the total generation
fuel cost and keep the power flows within the security limits. To
achieve that, the present work is developed to determine the optimal
location and size of capacitors in transmission power system where,
the Participation Factor Algorithm and the Steady State Genetic
Algorithm are proposed to select the best locations for the capacitors
and determine the optimal size for them.
Abstract: Surplus electricity can be converted into potential energy via pumped hydroelectric storage for future usage. Similarly, thermo-electric energy storage (TEES) uses heat pumps equipped with thermal storage to convert electrical energy into thermal energy; the stored energy is then converted back into electrical energy when necessary using a heat engine. The greatest advantage of this method is that, unlike pumped hydroelectric storage and compressed air energy storage, TEES is not restricted by geographical constraints. In this study, performance variation of the TEES according to the changes in cold-side storage temperature was investigated by simulation method.
Abstract: There have been a lot of efforts and researches undertaken in developing efficient tools for performing several tasks in data mining. Due to the massive amount of information embedded in huge data warehouses maintained in several domains, the extraction of meaningful pattern is no longer feasible. This issue turns to be more obligatory for developing several tools in data mining. Furthermore the major aspire of data mining software is to build a resourceful predictive or descriptive model for handling large amount of information more efficiently and user friendly. Data mining mainly contracts with excessive collection of data that inflicts huge rigorous computational constraints. These out coming challenges lead to the emergence of powerful data mining technologies. In this survey a diverse collection of data mining tools are exemplified and also contrasted with the salient features and performance behavior of each tool.
Abstract: Vehicular Ad hoc Network (VANET) is a special case of Mobile Ad hoc Network (MANET) used to establish communications and exchange information among nearby vehicles and between vehicles and nearby fixed infrastructure. VANET is seen as a promising technology used to provide safety, efficiency, assistance and comfort to the road users. Routing is an important issue in Vehicular Ad Hoc Network to find and maintain communication between vehicles due to the highly dynamic topology, frequently disconnected network and mobility constraints.
This paper evaluates the performance of two most popular proactive routing protocols OLSR and DSDV in real city traffic scenario on the basis of three metrics namely Packet delivery ratio, throughput and average end to end delay by varying vehicles density and transmission range.