Abstract: This paper introduces a digital method for fault section identification in transmission lines. The method uses digital set of the measured short circuit current to locate faults in electrical power systems. The digitized current is used to construct a set of overdetermined system of equations. The problem is then constructed and solved using the proposed digital optimization technique to find the fault distance. The proposed optimization methodology is an application of simulated annealing optimization technique. The method is tested using practical case study to evaluate the proposed method. The accurate results obtained show that the algorithm can be used as a powerful tool in the area of power system protection.
Abstract: In telemedicine, the image repository service is important to increase the accuracy of diagnostic support of medical personnel. This study makes comparison between two routing algorithms regarding the quality of service (QoS), to be able to analyze the optimal performance at the time of loading and/or downloading of medical images. This study focused on comparing the performance of Tabu Search with other heuristic and metaheuristic algorithms that improve QoS in telemedicine services in Colombia. For this, Tabu Search and Simulated Annealing heuristic algorithms are chosen for their high usability in this type of applications; the QoS is measured taking into account the following metrics: Delay, Throughput, Jitter and Latency. In addition, routing tests were carried out on ten images in digital image and communication in medicine (DICOM) format of 40 MB. These tests were carried out for ten minutes with different traffic conditions, reaching a total of 25 tests, from a server of Universidad Militar Nueva Granada (UMNG) in Bogotá-Colombia to a remote user in Universidad de Santiago de Chile (USACH) - Chile. The results show that Tabu search presents a better QoS performance compared to Simulated Annealing, managing to optimize the routing of medical images, a basic requirement to offer diagnostic images services in telemedicine.
Abstract: In this paper, there is concentration on collaborative transportation planning (CTP) among multiple carriers with pickup and delivery requests and time windows. This problem is a vehicle routing problem with constraints from standard vehicle routing problems and new constraints from a real-world application. In the problem, each carrier has a finite number of vehicles, and each request is a pickup and delivery request with time window. Moreover, each carrier has reserved requests, which must be served by itself, whereas its exchangeable requests can be outsourced to and served by other carriers. This collaboration among carriers can help them to reduce total transportation costs. A mixed integer programming model is proposed to the problem. To solve the model, a hybrid algorithm that combines Genetic Algorithm and Simulated Annealing (GASA) is proposed. This algorithm takes advantages of GASA at the same time. After tuning the parameters of the algorithm with the Taguchi method, the experiments are conducted and experimental results are provided for the hybrid algorithm. The results are compared with those obtained by a commercial solver. The comparison indicates that the GASA significantly outperforms the commercial solver.
Abstract: Traditionally, three important manufacturing functions which are process planning, scheduling and due-date assignment are performed sequentially and separately. Although there are numerous works on the integration of process planning and scheduling and plenty of works focusing on scheduling with due date assignment, there are only a few works on integrated process planning, scheduling and due-date assignment. Although due-dates are determined without taking into account of weights of the customers in the literature, here weighted due-date assignment is employed to get better performance. Jobs are scheduled according to weighted earliest due date dispatching rule and due dates are determined according to some popular due date assignment methods by taking into account of the weights of each job. Simulated Annealing, Evolutionary Strategies, Random Search, hybrid of Random Search and Simulated Annealing, and hybrid of Random Search and Evolutionary Strategies, are applied as solution techniques. Three important manufacturing functions are integrated step-by-step and higher integration levels are found better. Search meta-heuristics are found to be very useful while improving performance measure.
Abstract: This paper aims to present non-population search algorithms called tabu search (TS), simulated annealing (SA) and variable neighborhood search (VNS) to minimize the total cost of capacitated MRP problem in multi-stage assembly flow shop with two alternative machines. There are three main steps for the algorithm. Firstly, an initial sequence of orders is constructed by a simple due date-based dispatching rule. Secondly, the sequence of orders is repeatedly improved to reduce the total cost by applying TS, SA and VNS separately. Finally, the total cost is further reduced by optimizing the start time of each operation using the linear programming (LP) model. Parameters of the algorithm are tuned by using real data from automotive companies. The result shows that VNS significantly outperforms TS, SA and the existing algorithm.
Abstract: Traditionally, the three important manufacturing functions, which are process planning, scheduling and due-date assignment, are performed separately and sequentially. For couple of decades, hundreds of studies are done on integrated process planning and scheduling problems and numerous researches are performed on scheduling with due date assignment problem, but unfortunately the integration of these three important functions are not adequately addressed. Here, the integration of these three important functions is studied by using genetic, random-genetic hybrid, simulated annealing, random-simulated annealing hybrid and random search techniques. As well, the importance of the integration of these three functions and the power of meta-heuristics and of hybrid heuristics are studied.
Abstract: Wireless Sensor Network (WSN) clustering architecture enables features like network scalability, communication overhead reduction, and fault tolerance. After clustering, aggregated data is transferred to data sink and reducing unnecessary, redundant data transfer. It reduces nodes transmitting, and so saves energy consumption. Also, it allows scalability for many nodes, reduces communication overhead, and allows efficient use of WSN resources. Clustering based routing methods manage network energy consumption efficiently. Building spanning trees for data collection rooted at a sink node is a fundamental data aggregation method in sensor networks. The problem of determining Cluster Head (CH) optimal number is an NP-Hard problem. In this paper, we combine cluster based routing features for cluster formation and CH selection and use Minimum Spanning Tree (MST) for intra-cluster communication. The proposed method is based on optimizing MST using Simulated Annealing (SA). In this work, normalized values of mobility, delay, and remaining energy are considered for finding optimal MST. Simulation results demonstrate the effectiveness of the proposed method in improving the packet delivery ratio and reducing the end to end delay.
Abstract: Genetic algorithm is widely used in optimization
problems for its excellent global search capabilities and highly parallel
processing capabilities; but, it converges prematurely and has a poor
local optimization capability in actual operation. Simulated annealing
algorithm can avoid the search process falling into local optimum. A
hybrid genetic algorithm based on simulated annealing is designed by
combining the advantages of genetic algorithm and simulated
annealing algorithm. The numerical experiment represents the hybrid
genetic algorithm can be applied to solve the function optimization
problems efficiently.
Abstract: This paper sets out a behavioral macro-model of a
Merged PiN and Schottky (MPS) diode based on silicon carbide
(SiC). This model holds good for both static and dynamic electrothermal
simulations for industrial applications. Its parameters have
been worked out from datasheets curves by drawing on the
optimization method: Simulated Annealing (SA) for the SiC MPS
diodes made available in the industry. The model also adopts the
Analog Behavioral Model (ABM) of PSPICE in which it has been
implemented. The thermal behavior of the devices was also taken
into consideration by making use of Foster’ canonical network as
figured out from electro-thermal measurement provided by the
manufacturer of the device.
Abstract: Multiprocessor task scheduling problem for dependent
and independent tasks is computationally complex problem. Many
methods are proposed to achieve optimal running time. As the
multiprocessor task scheduling is NP hard in nature, therefore, many
heuristics are proposed which have improved the makespan of the
problem. But due to problem specific nature, the heuristic method
which provide best results for one problem, might not provide good
results for another problem. So, Simulated Annealing which is meta
heuristic approach is considered. It can be applied on all types of
problems. However, due to many runs, meta heuristic approach takes
large computation time. Hence, the hybrid approach is proposed by
combining the Duplication Scheduling Heuristic and Simulated
Annealing (SA) and the makespan results of Simple Simulated
Annealing and Hybrid approach are analyzed.
Abstract: Plasmin plays an important role in the human
circulatory system owing to its catalytic ability of fibrinolysis. The
immediate injection of plasmin in patients of strokes has intrigued
many scientists to design vectors that can transport plasmin to the
desired location in human body. Here we predict the structure of
human plasmin and investigate the interaction of plasmin with the
gold-nanoparticle.
Because the crystal structure of plasminogen has been solved, we
deleted N-terminal domain (Pan-apple domain) of plasminogen and
generate a mimic of the active form of this enzyme (plasmin). We
conducted a simulated annealing process on plasmin and discovered a
very large conformation occurs. Kringle domains 1, 4 and 5 had been
observed to leave its original location relative to the main body of the
enzyme and the original doughnut shape of this enzyme has been
transformed to a V-shaped by opening its two arms. This observation
of conformational change is consistent with the experimental results of
neutron scattering and centrifugation.
We subsequently docked the plasmin on the simulated gold surface
to predict their interaction. The V-shaped plasmin could utilize its
Kringle domain and catalytic domain to contact the gold surface.
Our findings not only reveal the flexibility of plasmin structure but
also provide a guide for the design of a plasmin-gold nanoparticle.
Abstract: Now-a-days autonomous mobile robots have found
applications in diverse fields. An autonomous robot system must be
able to behave in an intelligent manner to deal with complex and
changing environment. This work proposes the performance of path
planning and navigation of autonomous mobile robot using
Gravitational Search Algorithm (GSA), Simulated Annealing (SA)
and Particle Swarm optimization (PSO) based intelligent controllers
in an unstructured environment. The approach not only finds a valid
collision free path but also optimal one. The main aim of the work is
to minimize the length of the path and duration of travel from a
starting point to a target while moving in an unknown environment
with obstacles without collision. Finally, a comparison is made
between the three controllers, it is found that the path length and time
duration made by the robot using GSA is better than SA and PSO
based controllers for the same work.
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: The emergence of the Semantic Web technology
increases day by day due to the rapid growth of multiple web pages.
Many standard formats are available to store the semantic web data.
The most popular format is the Resource Description Framework
(RDF). Querying large RDF graphs becomes a tedious procedure
with a vast increase in the amount of data. The problem of query
optimization becomes an issue in querying large RDF graphs.
Choosing the best query plan reduces the amount of query execution
time. To address this problem, nature inspired algorithms can be used
as an alternative to the traditional query optimization techniques. In
this research, the optimal query plan is generated by the proposed
SAPSO algorithm which is a hybrid of Simulated Annealing (SA)
and Particle Swarm Optimization (PSO) algorithms. The proposed
SAPSO algorithm has the ability to find the local optimistic result
and it avoids the problem of local minimum. Experiments were
performed on different datasets by changing the number of predicates
and the amount of data. The proposed algorithm gives improved
results compared to existing algorithms in terms of query execution
time.
Abstract: In this paper, we propose an optimization technique
that can be used to optimize the placements of reference nodes and
improve the location determination performance for the multi-floor
building. The proposed technique is based on Simulated Annealing
algorithm (SA) and is called MSMR-M. The performance study in
this work is based on simulation. We compare other node-placement
techniques found in the literature with the optimal node-placement
solutions obtained from our optimization. The results show that using
the optimal node-placement obtained by our proposed technique can
improve the positioning error distances up to 20% better than those of
the other techniques. The proposed technique can provide an average
error distance within 1.42 meters.
Abstract: This paper proposes an application of probabilistic technique, namely Gaussian process regression, for estimating an optimal sequence of the single machine with total weighted tardiness (SMTWT) scheduling problem. In this work, the Gaussian process regression (GPR) model is utilized to predict an optimal sequence of the SMTWT problem, and its solution is improved by using an iterated local search based on simulated annealing scheme, called GPRISA algorithm. The results show that the proposed GPRISA method achieves a very good performance and a reasonable trade-off between solution quality and time consumption. Moreover, in the comparison of deviation from the best-known solution, the proposed mechanism noticeably outperforms the recently existing approaches.
Abstract: This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results are presented.
Abstract: In the paper we discuss the influence of the route
flexibility degree, the open rate of operations and the production type
coefficient on makespan. The flexible job-open shop scheduling
problem FJOSP (an extension of the classical job shop scheduling) is
analyzed. For the analysis of the production process we used a
hybrid heuristic of the GRASP (greedy randomized adaptive search
procedure) with simulated annealing algorithm. Experiments with
different levels of factors have been considered and compared. The
GRASP+SA algorithm has been tested and illustrated with results for
the serial route and the parallel one.
Abstract: The aim of the current work is to present a comparison among three popular optimization methods in the inverse elastostatics problem (IESP) of flaw detection within a solid. In more details, the performance of a simulated annealing, a Hooke & Jeeves and a sequential quadratic programming algorithm was studied in the test case of one circular flaw in a plate solved by both the boundary element (BEM) and the finite element method (FEM). The proposed optimization methods use a cost function that utilizes the displacements of the static response. The methods were ranked according to the required number of iterations to converge and to their ability to locate the global optimum. Hence, a clear impression regarding the performance of the aforementioned algorithms in flaw identification problems was obtained. Furthermore, the coupling of BEM or FEM with these optimization methods was investigated in order to track differences in their performance.
Abstract: The conventional GA combined with a local search
algorithm, such as the 2-OPT, forms a hybrid genetic algorithm(HGA)
for the traveling salesman problem (TSP). However, the geometric
properties which are problem specific knowledge can be used to
improve the search process of the HGA. Some tour segments (edges)
of TSPs are fine while some maybe too long to appear in a short tour.
This knowledge could constrain GAs to work out with fine tour
segments without considering long tour segments as often.
Consequently, a new algorithm is proposed, called intelligent-OPT
hybrid genetic algorithm (IOHGA), to improve the GA and the 2-OPT
algorithm in order to reduce the search time for the optimal solution.
Based on the geometric properties, all the tour segments are assigned
2-level priorities to distinguish between good and bad genes. A
simulation study was conducted to evaluate the performance of the
IOHGA. The experimental results indicate that in general the IOHGA
could obtain near-optimal solutions with less time and better accuracy
than the hybrid genetic algorithm with simulated annealing algorithm
(HGA(SA)).