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: The aim of this paper is to present the optimization
methodology developed in the frame of a Coastal Transport
Information System. The system will be used for the effective design
of coastal transportation lines and incorporates subsystems that
implement models, tools and techniques that may support the design
of improved networks. The role of the optimization and decision
subsystem is to provide the user with better and optimal scenarios
that will best fulfill any constrains, goals or requirements posed. The
complexity of the problem and the large number of parameters and
objectives involved led to the adoption of an evolutionary method
(Genetic Algorithms). The problem model and the subsystem
structure are presented in detail, and, its support for simulation is also
discussed.
Abstract: Power systems are operating under stressed condition
due to continuous increase in demand of load. This can lead to
voltage instability problem when face additional load increase or
contingency. In order to avoid voltage instability suitable size of
reactive power compensation at optimal location in the system is
required which improves the load margin. This work aims at
obtaining optimal size as well as location of compensation in the 39-
bus New England system with the help of Bacteria Foraging and
Genetic algorithms. To reduce the computational time the work
identifies weak candidate buses in the system, and then picks only
two of them to take part in the optimization. The objective function is
based on a recently proposed voltage stability index which takes into
account the weighted average sensitivity index is a simpler and faster
approach than the conventional CPF algorithm. BFOA has been
found to give better results compared to GA.
Abstract: The pursuit of the MPPT has led to the development of many kinds of controllers, one of which is the Fuzzy Logic controller, which has proven its worth. To further tune this controller this paper will discuss and analyze the use of Genetic Algorithms to tune the Fuzzy Logic Controller. It will provide an introduction to both systems, and test their compatibility and performance.
Abstract: Artificial Immune Systems (AIS), inspired by the
human immune system, are algorithms and mechanisms which are
self-adaptive and self-learning classifiers capable of recognizing and
classifying by learning, long-term memory and association. Unlike
other human system inspired techniques like genetic algorithms and
neural networks, AIS includes a range of algorithms modeling on
different immune mechanism of the body. In this paper, a mechanism
of a human immune system based on apoptosis is adopted to build an
Intrusion Detection System (IDS) to protect computer networks.
Features are selected from network traffic using Fisher Score. Based
on the selected features, the record/connection is classified as either
an attack or normal traffic by the proposed methodology. Simulation
results demonstrates that the proposed AIS based on apoptosis
performs better than existing AIS for intrusion detection.
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: Time and cost are the main goals of the construction
project management. The first schedule developed may not be a
suitable schedule for beginning or completing the project to achieve
the target completion time at a minimum total cost. In general, there
are trade-offs between time and cost (TCT) to complete the activities
of a project. This research presents genetic algorithms (GAs) multiobjective
model for project scheduling considering different
scenarios such as least cost, least time, and target time.
Abstract: This paper presents a new meta-heuristic bio-inspired
optimization algorithm which is called Cuttlefish Algorithm (CFA).
The algorithm mimics the mechanism of color changing behavior of
the cuttlefish to solve numerical global optimization problems. The
colors and patterns of the cuttlefish are produced by reflected light
from three different layers of cells. The proposed algorithm considers
mainly two processes: reflection and visibility. Reflection process
simulates light reflection mechanism used by these layers, while
visibility process simulates visibility of matching patterns of the
cuttlefish. To show the effectiveness of the algorithm, it is tested with
some other popular bio-inspired optimization algorithms such as
Genetic Algorithms (GA), Particle Swarm Optimization (PSO) and
Bees Algorithm (BA) that have been previously proposed in the
literature. Simulations and obtained results indicate that the proposed
CFA is superior when compared with these algorithms.
Abstract: Artificial Neural Networks (ANN) trained using backpropagation
(BP) algorithm are commonly used for modeling
material behavior associated with non-linear, complex or unknown
interactions among the material constituents. Despite multidisciplinary
applications of back-propagation neural networks
(BPNN), the BP algorithm possesses the inherent drawback of
getting trapped in local minima and slowly converging to a global
optimum. The paper present a hybrid artificial neural networks and
genetic algorithm approach for modeling slump of ready mix
concrete based on its design mix constituents. Genetic algorithms
(GA) global search is employed for evolving the initial weights and
biases for training of neural networks, which are further fine tuned
using the BP algorithm. The study showed that, hybrid ANN-GA
model provided consistent predictions in comparison to commonly
used BPNN model. In comparison to BPNN model, the hybrid ANNGA
model was able to reach the desired performance goal quickly.
Apart from the modeling slump of ready mix concrete, the synaptic
weights of neural networks were harnessed for analyzing the relative
importance of concrete design mix constituents on the slump value.
The sand and water constituents of the concrete design mix were
found to exhibit maximum importance on the concrete slump value.
Abstract: This paper deals with modeling and optimization of two NP-hard problems in production planning of flexible manufacturing system (FMS), part type selection problem and loading problem. The part type selection problem and the loading problem are strongly related and heavily influence the system’s efficiency and productivity. These problems have been modeled and solved simultaneously by using real coded genetic algorithms (RCGA) which uses an array of real numbers as chromosome representation. The novel proposed chromosome representation produces only feasible solutions which minimize a computational time needed by GA to push its population toward feasible search space or repair infeasible chromosomes. The proposed RCGA improves the FMS performance by considering two objectives, maximizing system throughput and maintaining the balance of the system (minimizing system unbalance). The resulted objective values are compared to the optimum values produced by branch-and-bound method. The experiments show that the proposed RCGA could reach near optimum solutions in a reasonable amount of time.
Abstract: This investigation presents the formulation of kerf (width of slit) and optimal control parameter settings of wire electrochemical discharge machining which results minimum possible kerf while machining Al7075/SiCp MMCs. WEDM is proved its efficiency and effectiveness to cut the hard ceramic reinforced MMCs within the permissible budget. Among the distinct performance measures of WEDM process, kerf is an important performance characteristic which determines the dimensional accuracy of the machined component while producing high precision components. The lack of available of the machinability information such advanced MMCs result the more experimentation in the manufacturing industries. Therefore, extensive experimental investigations are essential to provide the database of effect of various control parameters on the kerf while machining such advanced MMCs in WEDM. Literature reviled the significance some of the electrical parameters which are prominent on kerf for machining distinct conventional materials. However, the significance of reinforced particulate size and volume fraction on kerf is highlighted in this work while machining MMCs along with the machining parameters of pulse-on time, pulse-off time and wire tension. Usually, the dimensional tolerances of machined components are decided at the design stage and a machinist pay attention to produce the required dimensional tolerances by setting appropriate machining control variables. However, it is highly difficult to determine the optimal machining settings for such advanced materials on the shop floor. Therefore, in the view of precision of cut, kerf (cutting width) is considered as the measure of performance for the model. It was found from the literature that, the machining conditions of higher fractions of large size SiCp resulting less kerf where as high values of pulse-on time result in a high kerf. A response surface model is used to predict the relative significance of various control variables on kerf. Consequently, a powerful artificial intelligence called genetic algorithms (GA) is used to determine the best combination of the control variable settings. In the next step the conformation test was conducted for the optimal parameter settings and found good agreement between the GA kerf and measured kerf. Hence, it is clearly reveal that the effectiveness and accuracy of the developed model and program to analyze the kerf and to determine its optimal process parameters. The results obtained in this work states that, the resulted optimized parameters are capable of machining the Al7075/SiCp MMCs more efficiently and with better dimensional accuracy.
Abstract: The Choquet integral is a tool for the information fusion that is very effective in the case where fuzzy measures associated with it are well chosen. In this paper, we propose a new approach for calculating fuzzy measures associated with the Choquet integral in a context of data fusion in multimodal biometrics. The proposed approach is based on genetic algorithms. It has been validated in two databases: the first base is relative to synthetic scores and the second one is biometrically relating to the face, fingerprint and palmprint. The results achieved attest the robustness of the proposed approach.
Abstract: In this paper a genetic algorithm (GA) with dual-fitness function is proposed and applied to solve the deterministic identical machine scheduling problem. The mating fitness function value was used to determine the mating for chromosomes, while the selection fitness function value was used to determine their survivals. The performance of this algorithm was tested on deterministic identical machine scheduling using simulated data. The results obtained from the proposed GA were compared with classical GA and integer programming (IP). Results showed that dual-fitness function GA outperformed the classical single-fitness function GA with statistical significance for large problems and was competitive to IP, particularly when large size problems were used.
Abstract: Image registration is the process of establishing point
by point correspondence between images obtained from a same
scene. This process is very useful in remote sensing, medicine,
cartography, computer vision, etc. Then, the task of registration is to
place the data into a common reference frame by estimating the
transformations between the data sets. In this work, we develop a
rigid point registration method based on the application of genetic
algorithms and Hausdorff distance. First, we extract the feature points
from both images based on the algorithm of global and local
curvature corner. After refining the feature points, we use Hausdorff
distance as similarity measure between the two data sets and for
optimizing the search space we use genetic algorithms to achieve
high computation speed for its inertial parallel. The results show the
efficiency of this method for registration of satellite images.
Abstract: In this paper, we present a comparative study of the
genetic algorithms and Hessian-s methods for optimal research of the
active powers in an electric network of power. The objective function
which is the performance index of production of electrical energy is
minimized by satisfying the constraints of the equality type and
inequality type initially by the Hessian-s methods and in the second
time by the genetic Algorithms. The results found by the application
of AG for the minimization of the electric production costs of power
are very encouraging. The algorithms seem to be an effective
technique to solve a great number of problems and which are in
constant evolution. Nevertheless it should be specified that the
traditional binary representation used for the genetic algorithms
creates problems of optimization of management of the large-sized
networks with high numerical precision.
Abstract: Fine-grained data replication over the Internet allows duplication of frequently accessed data objects, as opposed to entire sites, to certain locations so as to improve the performance of largescale content distribution systems. In a distributed system, agents representing their sites try to maximize their own benefit since they are driven by different goals such as to minimize their communication costs, latency, etc. In this paper, we will use game theoretical techniques and in particular auctions to identify a bidding mechanism that encapsulates the selfishness of the agents, while having a controlling hand over them. In essence, the proposed game theory based mechanism is the study of what happens when independent agents act selfishly and how to control them to maximize the overall performance. A bidding mechanism asks how one can design systems so that agents- selfish behavior results in the desired system-wide goals. Experimental results reveal that this mechanism provides excellent solution quality, while maintaining fast execution time. The comparisons are recorded against some well known techniques such as greedy, branch and bound, game theoretical auctions and genetic algorithms.
Abstract: The Genetic Algorithm (GA) is one of the most important methods used to solve many combinatorial optimization problems. Therefore, many researchers have tried to improve the GA by using different methods and operations in order to find the optimal solution within reasonable time. This paper proposes an improved GA (IGA), where the new crossover operation, population reformulates operation, multi mutation operation, partial local optimal mutation operation, and rearrangement operation are used to solve the Traveling Salesman Problem. The proposed IGA was then compared with three GAs, which use different crossover operations and mutations. The results of this comparison show that the IGA can achieve better results for the solutions in a faster time.
Abstract: While to minimize the overall project cost is always
one of the objectives of construction managers, to obtain the
maximum economic return is definitely one the ultimate goals of the
project investors. As there is a trade-off relationship between the
project time and cost, and the project delivery time directly affects the
timing of economic recovery of an investment project, to provide a
method that can quantify the relationship between the project delivery
time and cost, and identify the optimal delivery time to maximize
economic return has always been the focus of researchers and
industrial practitioners. Using genetic algorithms, this study
introduces an optimization model that can quantify the relationship
between the project delivery time and cost and furthermore, determine
the optimal delivery time to maximize the economic return of the
project. The results provide objective quantification for accurately
evaluating the project delivery time and cost, and facilitate the
analysis of the economic return of a project.
Abstract: Time-Cost Optimization "TCO" is one of the greatest challenges in construction project planning and control, since the optimization of either time or cost, would usually be at the expense of the other. Since there is a hidden trade-off relationship between project and cost, it might be difficult to predict whether the total cost would increase or decrease as a result of the schedule compression. Recently third dimension in trade-off analysis is taken into consideration that is quality of the projects. Few of the existing algorithms are applied in a case of construction project with threedimensional trade-off analysis, Time-Cost-Quality relationships. The objective of this paper is to presents the development of a practical software system; that named Automatic Multi-objective Typical Construction Resource Optimization System "AMTCROS". This system incorporates the basic concepts of Line Of Balance "LOB" and Critical Path Method "CPM" in a multi-objective Genetic Algorithms "GAs" model. The main objective of this system is to provide a practical support for typical construction planners who need to optimize resource utilization in order to minimize project cost and duration while maximizing its quality simultaneously. The application of these research developments in planning the typical construction projects holds a strong promise to: 1) Increase the efficiency of resource use in typical construction projects; 2) Reduce construction duration period; 3) Minimize construction cost (direct cost plus indirect cost); and 4) Improve the quality of newly construction projects. A general description of the proposed software for the Time-Cost-Quality Trade-Off "TCQTO" is presented. The main inputs and outputs of the proposed software are outlined. The main subroutines and the inference engine of this software are detailed. The complexity analysis of the software is discussed. In addition, the verification, and complexity of the proposed software are proved and tested using a real case study.
Abstract: The direct synthesis process of dimethyl ether (DME)
from syngas in slurry reactors is considered to be promising because
of its advantages in caloric transfer. In this paper, the influences of
operating conditions (temperature, pressure and weight hourly space
velocity) on the conversion of CO, selectivity of DME and methanol
were studied in a stirred autoclave over Cu-Zn-Al-Zr slurry catalyst,
which is far more suitable to liquid phase dimethyl ether synthesis
process than bifunctional catalyst commercially. A Langmuir-
Hinshelwood mechanism type global kinetics model for liquid phase
DME direct synthesis based on methanol synthesis models and a
methanol dehydration model has been investigated by fitting our
experimental data. The model parameters were estimated with
MATLAB program based on general Genetic Algorithms and
Levenberg-Marquardt method, which is suitably fitting experimental
data and its reliability was verified by statistical test and residual
error analysis.