Abstract: This paper addresses minimizing the makespan of the
distributed permutation flow shop scheduling problem. In this
problem, there are several parallel identical factories or flowshops
each with series of similar machines. Each job should be allocated to
one of the factories and all of the operations of the jobs should be
performed in the allocated factory. This problem has recently gained
attention and due to NP-Hard nature of the problem, metaheuristic
algorithms have been proposed to tackle it. Majority of the proposed
algorithms require large computational time which is the main
drawback. In this study, a general variable neighborhood search
algorithm (GVNS) is proposed where several time-saving schemes
have been incorporated into it. Also, the GVNS uses the sophisticated
method to change the shaking procedure or perturbation depending
on the progress of the incumbent solution to prevent stagnation of the
search. The performance of the proposed algorithm is compared to
the state-of-the-art algorithms based on standard benchmark
instances.
Abstract: In the present paper the design of plate heat exchangers
is formulated as an optimization problem considering two
mathematical modelling. The number of plates is the objective
function to be minimized, considering implicitly some parameters
configuration. Screening is the optimization method used to solve the
problem. Thermal and hydraulic constraints are verified, not viable
solutions are discarded and the method searches for the convergence to
the optimum, case it exists. A case study is presented to test the
applicability of the developed algorithm. Results show coherency with
the literature.
Abstract: Localization of nodes is one of the key issues of
Wireless Sensor Network (WSN) that gained a wide attention in
recent years. The existing localization techniques can be generally
categorized into two types: range-based and range-free. Compared
with rang-based schemes, the range-free schemes are more costeffective,
because no additional ranging devices are needed. As a
result, we focus our research on the range-free schemes. In this paper
we study three types of range-free location algorithms to compare the
localization error and energy consumption of each one. Centroid
algorithm requires a normal node has at least three neighbor anchors,
while DV-hop algorithm doesn’t have this requirement. The third
studied algorithm is the amorphous algorithm similar to DV-Hop
algorithm, and the idea is to calculate the hop distance between two
nodes instead of the linear distance between them. The simulation
results show that the localization accuracy of the amorphous
algorithm is higher than that of other algorithms and the energy
consumption does not increase too much.
Abstract: Voting algorithms are extensively used to make
decisions in fault tolerant systems where each redundant module
gives inconsistent outputs. Popular voting algorithms include
majority voting, weighted voting, and inexact majority voters. Each
of these techniques suffers from scenarios where agreements do not
exist for the given voter inputs. This has been successfully overcome
in literature using fuzzy theory. Our previous work concentrated on a
neuro-fuzzy algorithm where training using the neuro system
substantially improved the prediction result of the voting system.
Weight training of Neural Network is sub-optimal. This study
proposes to optimize the weights of the Neural Network using
Artificial Bee Colony algorithm. Experimental results show the
proposed system improves the decision making of the voting
algorithms.
Abstract: The lifetime of a wireless sensor network can be
effectively increased by using scheduling operations. Once the
sensors are randomly deployed, the task at hand is to find the largest
number of disjoint sets of sensors such that every sensor set provides
complete coverage of the target area. At any instant, only one of these
disjoint sets is switched on, while all other are switched off. This
paper proposes a heuristic search method to find the maximum
number of disjoint sets that completely cover the region. A
population of randomly initialized members is made to explore the
solution space. A set of heuristics has been applied to guide the
members to a possible solution in their neighborhood. The heuristics
escalate the convergence of the algorithm. The best solution explored
by the population is recorded and is continuously updated. The
proposed algorithm has been tested for applications which require
sensing of multiple target points, referred to as point coverage
applications. Results show that the proposed algorithm outclasses the
existing algorithms. It always finds the optimum solution, and that
too by making fewer number of fitness function evaluations than the
existing approaches.
Abstract: Ant Colony Optimization (ACO) is a promising
modern approach to the unused combinatorial optimization. Here
ACO is applied to finding the shortest during communication link
failure. In this paper, the performances of the prim’s and ACO
algorithm are made. By comparing the time complexity and program
execution time as set of parameters, we demonstrate the pleasant
performance of ACO in finding excellent solution to finding shortest
path during communication link failure.
Abstract: Several parameters are established in order to measure
biodiesel quality. One of them is the iodine value, which is an
important parameter that measures the total unsaturation within a
mixture of fatty acids. Limitation of unsaturated fatty acids is
necessary since warming of higher quantity of these ones ends in
either formation of deposits inside the motor or damage of lubricant.
Determination of iodine value by official procedure tends to be very
laborious, with high costs and toxicity of the reagents, this study uses
artificial neural network (ANN) in order to predict the iodine value
property as an alternative to these problems. The methodology of
development of networks used 13 esters of fatty acids in the input
with convergence algorithms of back propagation of back
propagation type were optimized in order to get an architecture of
prediction of iodine value. This study allowed us to demonstrate the
neural networks’ ability to learn the correlation between biodiesel
quality properties, in this caseiodine value, and the molecular
structures that make it up. The model developed in the study reached
a correlation coefficient (R) of 0.99 for both network validation and
network simulation, with Levenberg-Maquardt algorithm.
Abstract: This paper proposed the comparison made between
Multi-Carrier Pulse Width Modulation, Sinusoidal Pulse Width
Modulation and Selective Harmonic Elimination Pulse Width
Modulation technique for minimization of Total Harmonic Distortion
in Cascaded H-Bridge Multi-Level Inverter. In Multicarrier Pulse
Width Modulation method by using Alternate Position of Disposition
scheme for switching pulse generation to Multi-Level Inverter.
Another carrier based approach; Sinusoidal Pulse Width Modulation
method is also implemented to define the switching pulse generation
system in the multi-level inverter. In Selective Harmonic Elimination
method using Genetic Algorithm and Particle Swarm Optimization
algorithm for define the required switching angles to eliminate low
order harmonics from the inverter output voltage waveform and
reduce the total harmonic distortion value. So, the results validate that
the Selective Harmonic Elimination Pulse Width Modulation method
does capably eliminate a great number of precise harmonics and
minimize the Total Harmonic Distortion value in output voltage
waveform in compared with Multi-Carrier Pulse Width Modulation
method, Sinusoidal Pulse Width Modulation method. In this paper,
comparison of simulation results shows that the Selective Harmonic
Elimination method can attain optimal harmonic minimization
solution better than Multi-Carrier Pulse Width Modulation method,
Sinusoidal Pulse Width Modulation method.
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: Any signal transmitted over a channel is corrupted by noise and interference. A host of channel coding techniques has been proposed to alleviate the effect of such noise and interference. Among these Turbo codes are recommended, because of increased capacity at higher transmission rates and superior performance over convolutional codes. The multimedia elements which are associated with ample amount of data are best protected by Turbo codes. Turbo decoder employs Maximum A-posteriori Probability (MAP) and Soft Output Viterbi Decoding (SOVA) algorithms. Conventional Turbo coded systems employ Equal Error Protection (EEP) in which the protection of all the data in an information message is uniform. Some applications involve Unequal Error Protection (UEP) in which the level of protection is higher for important information bits than that of other bits. In this work, enhancement to the traditional Log MAP decoding algorithm is being done by using optimized scaling factors for both the decoders. The error correcting performance in presence of UEP in Additive White Gaussian Noise channel (AWGN) and Rayleigh fading are analyzed for the transmission of image with Discrete Cosine Transform (DCT) as source coding technique. This paper compares the performance of log MAP, Modified log MAP (MlogMAP) and Enhanced log MAP (ElogMAP) algorithms used for image transmission. The MlogMAP algorithm is found to be best for lower Eb/N0 values but for higher Eb/N0 ElogMAP performs better with optimized scaling factors. The performance comparison of AWGN with fading channel indicates the robustness of the proposed algorithm. According to the performance of three different message classes, class3 would be more protected than other two classes. From the performance analysis, it is observed that ElogMAP algorithm with UEP is best for transmission of an image compared to Log MAP and MlogMAP decoding algorithms.
Abstract: Nowadays, the use of renewable energy sources has been increasingly great because of the cost increase and public demand for clean energy sources. One of the fastest growing sources is wind energy. In this paper, Wind Diesel Hybrid System (WDHS) comprising a Diesel Generator (DG), a Wind Turbine Generator (WTG), the Consumer Load, a Battery-based Energy Storage System (BESS), and a Dump Load (DL) is used. Voltage is controlled by Diesel Generator; the frequency is controlled by BESS and DL. The BESS elimination is an efficient way to reduce maintenance cost and increase the dynamic response. Simulation results with graphs for the frequency of Power System, active power, and the battery power are presented for load changes. The controlling parameters are optimized by using Imperialist Competitive Algorithm (ICA). The simulation results for the BESS/no BESS cases are compared. Results show that in no BESS case, the frequency control is more optimal than the BESS case by using ICA.
Abstract: This paper presented a study of three algorithms, the
equalization algorithm to equalize the transmission channel with ZF
and MMSE criteria, application of channel Bran A, and adaptive
filtering algorithms LMS and RLS to estimate the parameters of the
equalizer filter, i.e. move to the channel estimation and therefore
reflect the temporal variations of the channel, and reduce the error in
the transmitted signal. So far the performance of the algorithm
equalizer with ZF and MMSE criteria both in the case without noise,
a comparison of performance of the LMS and RLS algorithm.
Abstract: The system for analyzing and eliciting public
grievances serves its main purpose to receive and process all sorts of
complaints from the public and respond to users. Due to the more
number of complaint data becomes big data which is difficult to store
and process. The proposed system uses HDFS to store the big data
and uses MapReduce to process the big data. The concept of cache
was applied in the system to provide immediate response and timely
action using big data analytics. Cache enabled big data increases the
response time of the system. The unstructured data provided by the
users are efficiently handled through map reduce algorithm. The
processing of complaints takes place in the order of the hierarchy of
the authority. The drawbacks of the traditional database system used
in the existing system are set forth by our system by using Cache
enabled Hadoop Distributed File System. MapReduce framework
codes have the possible to leak the sensitive data through
computation process. We propose a system that add noise to the
output of the reduce phase to avoid signaling the presence of
sensitive data. If the complaints are not processed in the ample time,
then automatically it is forwarded to the higher authority. Hence it
ensures assurance in processing. A copy of the filed complaint is sent
as a digitally signed PDF document to the user mail id which serves
as a proof. The system report serves to be an essential data while
making important decisions based on legislation.
Abstract: The Trustworthy link failure recovery algorithm is
introduced in this paper, to provide the forwarding continuity even
with compound link failures. The ephemeral failures are common in
IP networks and it also has some proposals based on local rerouting.
To ensure forwarding continuity, we are introducing the compound
link failure recovery algorithm, even with compound link failures.
For forwarding the information, each packet carries a blacklist, which
is a min set of failed links encountered along its path, and the next
hop is chosen by excluding the blacklisted links. Our proposed
method describes how it can be applied to ensure forwarding to all
reachable destinations in case of any two or more link or node
failures in the network. After simulating with NS2 contains lot of
samples proved that the proposed protocol achieves exceptional
concert even under elevated node mobility using Trustworthy link
Failure Recovery Algorithm.
Abstract: The Orthogonal Frequency Division Multiplexing
(OFDM) with high data rate, high spectral efficiency and its ability to
mitigate the effects of multipath makes them most suitable in wireless
application. Impulsive noise distorts the OFDM transmission and
therefore methods must be investigated to suppress this noise. In this
paper, a State Space Recursive Least Square (SSRLS) algorithm
based adaptive impulsive noise suppressor for OFDM
communication system is proposed. And a comparison with another
adaptive algorithm is conducted. The state space model-dependent
recursive parameters of proposed scheme enables to achieve steady
state mean squared error (MSE), low bit error rate (BER), and faster
convergence than that of some of existing algorithm.
Abstract: The polymer foil used for manufacturing of
laminated glass members behaves in a viscoelastic manner with
temperature dependance. This contribution aims at incorporating
the time/temperature-dependent behavior of interlayer to our earlier
elastic finite element model for laminated glass beams. The model
is based on a refined beam theory: each layer behaves according
to the finite-strain shear deformable formulation by Reissner and
the adjacent layers are connected via the Lagrange multipliers
ensuring the inter-layer compatibility of a laminated unit. The
time/temperature-dependent behavior of the interlayer is accounted
for by the generalized Maxwell model and by the time-temperature
superposition principle due to the Williams, Landel, and Ferry.
The resulting system is solved by the Newton method with
consistent linearization and the viscoelastic response is determined
incrementally by the exponential algorithm. By comparing the model
predictions against available experimental data, we demonstrate that
the proposed formulation is reliable and accurately reproduces the
behavior of the laminated glass units.
Abstract: In this work, we explore the capability of the mean
shift algorithm as a powerful preprocessing tool for improving the
quality of spatial data, acquired from airborne scanners, from densely
built urban areas. On one hand, high resolution image data corrupted
by noise caused by lossy compression techniques are appropriately
smoothed while at the same time preserving the optical edges and, on
the other, low resolution LiDAR data in the form of normalized
Digital Surface Map (nDSM) is upsampled through the joint mean
shift algorithm. Experiments on both the edge-preserving smoothing
and upsampling capabilities using synthetic RGB-z data show that the
mean shift algorithm is superior to bilateral filtering as well as to
other classical smoothing and upsampling algorithms. Application of
the proposed methodology for 3D reconstruction of buildings of a
pilot region of Athens, Greece results in a significant visual
improvement of the 3D building block model.
Abstract: Evolutionary optimization methods such as genetic
algorithms have been used extensively for the construction site layout
problem. More recently, ant colony optimization algorithms, which
are evolutionary methods based on the foraging behavior of ants,
have been successfully applied to benchmark combinatorial
optimization problems. This paper proposes a formulation of the site
layout problem in terms of a sequencing problem that is suitable for
solution using an ant colony optimization algorithm.
In the construction industry, site layout is a very important
planning problem. The objective of site layout is to position
temporary facilities both geographically and at the correct time such
that the construction work can be performed satisfactorily with
minimal costs and improved safety and working environment. During
the last decade, evolutionary methods such as genetic algorithms
have been used extensively for the construction site layout problem.
This paper proposes an ant colony optimization model for
construction site layout. A simple case study for a highway project is
utilized to illustrate the application of the model.
Abstract: In this paper, we introduced a gradient-based inverse
solver to obtain the missing boundary conditions based on the
readings of internal thermocouples. The results show that the method
is very sensitive to measurement errors, and becomes unstable when
small time steps are used. The artificial neural networks are shown to
be capable of capturing the whole thermal history on the run-out
table, but are not very effective in restoring the detailed behavior of
the boundary conditions. Also, they behave poorly in nonlinear cases
and where the boundary condition profile is different.
GA and PSO are more effective in finding a detailed
representation of the time-varying boundary conditions, as well as in
nonlinear cases. However, their convergence takes longer. A
variation of the basic PSO, called CRPSO, showed the best
performance among the three versions. Also, PSO proved to be
effective in handling noisy data, especially when its performance
parameters were tuned. An increase in the self-confidence parameter
was also found to be effective, as it increased the global search
capabilities of the algorithm. RPSO was the most effective variation
in dealing with noise, closely followed by CRPSO. The latter
variation is recommended for inverse heat conduction problems, as it
combines the efficiency and effectiveness required by these
problems.
Abstract: Nature is the immense gifted source for solving
complex problems. It always helps to find the optimal solution to
solve the problem. Mobile Ad Hoc NETwork (MANET) is a wide
research area of networks which has set of independent nodes. The
characteristics involved in MANET’s are Dynamic, does not depend
on any fixed infrastructure or centralized networks, High mobility.
The Bio-Inspired algorithms are mimics the nature for solving
optimization problems opening a new era in MANET. The typical
Swarm Intelligence (SI) algorithms are Ant Colony Optimization
(ACO), Artificial Bee Colony (ABC), Particle Swarm Optimization
(PSO), Modified Termite Algorithm, Bat Algorithm (BA), Wolf
Search Algorithm (WSA) and so on. This work mainly concentrated
on nature of MANET and behavior of nodes. Also it analyses various
performance metrics such as throughput, QoS and End-to-End delay
etc.