Abstract: The overlay approach has been widely used by many service providers for Traffic Engineering (TE) in large Internet backbones. In the overlay approach, logical connections are set up between edge nodes to form a full mesh virtual network on top of the physical topology. IP routing is then run over the virtual network. Traffic engineering objectives are achieved through carefully routing logical connections over the physical links. Although the overlay approach has been implemented in many operational networks, it has a number of well-known scaling issues. This paper proposes a new approach to achieve traffic engineering without full-mesh overlaying with the help of integrated approach and equal subset split method. Traffic engineering needs to determine the optimal routing of traffic over the existing network infrastructure by efficiently allocating resource in order to optimize traffic performance on an IP network. Even though constraint-based routing [1] of Multi-Protocol Label Switching (MPLS) is developed to address this need, since it is not widely tested or debugged, Internet Service Providers (ISPs) resort to TE methods under Open Shortest Path First (OSPF), which is the most commonly used intra-domain routing protocol. Determining OSPF link weights for optimal network performance is an NP-hard problem. As it is not possible to solve this problem, we present a subset split method to improve the efficiency and performance by minimizing the maximum link utilization in the network via a small number of link weight modifications. The results of this method are compared against results of MPLS architecture [9] and other heuristic methods.
Abstract: Resource-constrained project scheduling is an NPhard
optimisation problem. There are many different heuristic
strategies how to shift activities in time when resource requirements
exceed their available amounts. These strategies are frequently based
on priorities of activities. In this paper, we assume that a suitable
heuristic has been chosen to decide which activities should be
performed immediately and which should be postponed and
investigate the resource-constrained project scheduling problem
(RCPSP) from the implementation point of view. We propose an
efficient routine that, instead of shifting the activities, extends their
duration. It makes it possible to break down their duration into active
and sleeping subintervals. Then we can apply the classical Critical
Path Method that needs only polynomial running time. This
algorithm can simply be adapted for multiproject scheduling with
limited resources.
Abstract: In ad hoc networks, the main issue about designing of protocols is quality of service, so that in wireless sensor networks the main constraint in designing protocols is limited energy of sensors. In fact, protocols which minimize the power consumption in sensors are more considered in wireless sensor networks. One approach of reducing energy consumption in wireless sensor networks is to reduce the number of packages that are transmitted in network. The technique of collecting data that combines related data and prevent transmission of additional packages in network can be effective in the reducing of transmitted packages- number. According to this fact that information processing consumes less power than information transmitting, Data Aggregation has great importance and because of this fact this technique is used in many protocols [5]. One of the Data Aggregation techniques is to use Data Aggregation tree. But finding one optimum Data Aggregation tree to collect data in networks with one sink is a NP-hard problem. In the Data Aggregation technique, related information packages are combined in intermediate nodes and form one package. So the number of packages which are transmitted in network reduces and therefore, less energy will be consumed that at last results in improvement of longevity of network. Heuristic methods are used in order to solve the NP-hard problem that one of these optimization methods is to solve Simulated Annealing problems. In this article, we will propose new method in order to build data collection tree in wireless sensor networks by using Simulated Annealing algorithm and we will evaluate its efficiency whit Genetic Algorithm.
Abstract: This paper presents a hybrid approach for solving nqueen problem by combination of PSO and SA. PSO is a population based heuristic method that sometimes traps in local maximum. To solve this problem we can use SA. Although SA suffer from many iterations and long time convergence for solving some problems, By good adjusting initial parameters such as temperature and the length of temperature stages SA guarantees convergence. In this article we use discrete PSO (due to nature of n-queen problem) to achieve a good local maximum. Then we use SA to escape from local maximum. The experimental results show that our hybrid method in comparison of SA method converges to result faster, especially for high dimensions n-queen problems.
Abstract: The design of technological procedures for
manufacturing certain products demands the definition and
optimization of technological process parameters. Their
determination depends on the model of the process itself and its
complexity. Certain processes do not have an adequate mathematical
model, thus they are modeled using heuristic methods. First part of
this paper presents a state of the art of using soft computing
techniques in manufacturing processes from the perspective of
applicability in modern CAx systems. Methods of artificial
intelligence which can be used for this purpose are analyzed. The
second part of this paper shows some of the developed models of
certain processes, as well as their applicability in the actual
calculation of parameters of some technological processes within the
design system from the viewpoint of productivity.
Abstract: Voltage collapse is instability of heavily loaded electric
power systems that cause to declining voltages and blackout. Power
systems are predicated to become more heavily loaded in the future
decade as the demand for electric power rises while economic and
environmental concerns limit the construction of new transmission
and generation capacity. Heavily loaded power systems are closer to
their stability limits and voltage collapse blackouts will occur if
suitable monitoring and control measures are not taken. To control
transmission lines, it can be used from FACTS devices.
In this paper Harmony search algorithm (HSA) and Genetic
Algorithm (GA) have applied to determine optimal location of
FACTS devices in a power system to improve power system stability.
Three types of FACTS devices (TCPAT, UPFS, and SVC) have been
introduced. Bus under voltage has been solved by controlling reactive
power of shunt compensator. Also a combined series-shunt
compensators has been also used to control transmission power flow
and bus voltage simultaneously.
Different scenarios have been considered. First TCPAT, UPFS, and
SVC are placed solely in transmission lines and indices have been
calculated. Then two types of above controller try to improve
parameters randomly. The last scenario tries to make better voltage
stability index and losses by implementation of three types controller
simultaneously. These scenarios are executed on typical 34-bus test
system and yields efficiency in improvement of voltage profile and
reduction of power losses; it also may permit an increase in power
transfer capacity, maximum loading, and voltage stability margin.
Abstract: This research deals with a flexible flowshop
scheduling problem with arrival and delivery of jobs in groups and
processing them individually. Due to the special characteristics of
each job, only a subset of machines in each stage is eligible to
process that job. The objective function deals with minimization of
sum of the completion time of groups on one hand and minimization
of sum of the differences between completion time of jobs and
delivery time of the group containing that job (waiting period) on the
other hand. The problem can be stated as FFc / rj , Mj / irreg which
has many applications in production and service industries. A
mathematical model is proposed, the problem is proved to be NPcomplete,
and an effective heuristic method is presented to schedule
the jobs efficiently. This algorithm can then be used within the body
of any metaheuristic algorithm for solving the problem.
Abstract: The multiple traveling salesman problem (mTSP) can be used to model many practical problems. The mTSP is more complicated than the traveling salesman problem (TSP) because it requires determining which cities to assign to each salesman, as well as the optimal ordering of the cities within each salesman's tour. Previous studies proposed that Genetic Algorithm (GA), Integer Programming (IP) and several neural network (NN) approaches could be used to solve mTSP. This paper compared the results for mTSP, solved with Genetic Algorithm (GA) and Nearest Neighbor Algorithm (NNA). The number of cities is clustered into a few groups using k-means clustering technique. The number of groups depends on the number of salesman. Then, each group is solved with NNA and GA as an independent TSP. It is found that k-means clustering and NNA are superior to GA in terms of performance (evaluated by fitness function) and computing time.
Abstract: In this paper, a heuristic method for simultaneous
rescue robot path-planning and mission scheduling is introduced
based on project management techniques, multi criteria decision
making and artificial potential fields path-planning. Groups of
injured people are trapped in a disastrous situation. These people are
categorized into several groups based on the severity of their
situation. A rescue robot, whose ultimate objective is reaching
injured groups and providing preliminary aid for them through a path
with minimum risk, has to perform certain tasks on its way towards
targets before the arrival of rescue team. A decision value is assigned
to each target based on the whole degree of satisfaction of the criteria
and duties of the robot toward the target and the importance of
rescuing each target based on their category and the number of
injured people. The resulted decision value defines the strength of the
attractive potential field of each target. Dangerous environmental
parameters are defined as obstacles whose risk determines the
strength of the repulsive potential field of each obstacle. Moreover,
negative and positive energies are assigned to the targets and
obstacles, which are variable with respects to the factors involved.
The simulation results show that the generated path for two cases
studies with certain differences in environmental conditions and
other risk factors differ considerably.
Abstract: Connected dominating set (CDS) problem in unit disk
graph has signi£cant impact on an ef£cient design of routing protocols
in wireless sensor networks, where the searching space for a
route is reduced to nodes in the set. A set is dominating if all the
nodes in the system are either in the set or neighbors of nodes in the
set. In this paper, a simple and ef£cient heuristic method is proposed
for £nding a minimum connected dominating set (MCDS) in ad hoc
wireless networks based on the new parameter support of vertices.
With this parameter the proposed heuristic approach effectively
£nds the MCDS of a graph. Extensive computational experiments
show that the proposed approach outperforms the recently proposed
heuristics found in the literature for the MCD
Abstract: The necessity of solving multi dimensional
complicated scientific problems beside the necessity of several
objective functions optimization are the most motive reason of born
of artificial intelligence and heuristic methods.
In this paper, we introduce a new method for multiobjective
optimization based on learning automata. In the proposed method,
search space divides into separate hyper-cubes and each cube is
considered as an action. After gathering of all objective functions
with separate weights, the cumulative function is considered as the
fitness function. By the application of all the cubes to the cumulative
function, we calculate the amount of amplification of each action and
the algorithm continues its way to find the best solutions. In this
Method, a lateral memory is used to gather the significant points of
each iteration of the algorithm. Finally, by considering the
domination factor, pareto front is estimated. Results of several
experiments show the effectiveness of this method in comparison
with genetic algorithm based method.
Abstract: In this paper, we research the standard 13-point difference schemes for solving the biharmonic equation. Heuristic method is applied to judging the stability of multi-level difference schemes of the biharmonic equation. It is showed that the standard 13-point difference schemes are stable.
Abstract: Weather systems use enormously complex
combinations of numerical tools for study and forecasting.
Unfortunately, due to phenomena in the world climate, such
as the greenhouse effect, classical models may become
insufficient mostly because they lack adaptation. Therefore,
the weather forecast problem is matched for heuristic
approaches, such as Evolutionary Algorithms.
Experimentation with heuristic methods like Particle Swarm
Optimization (PSO) algorithm can lead to the development of
new insights or promising models that can be fine tuned with
more focused techniques. This paper describes a PSO
approach for analysis and prediction of data and provides
experimental results of the aforementioned method on realworld
meteorological time series.
Abstract: Spatial trends are one of the valuable patterns in geo
databases. They play an important role in data analysis and
knowledge discovery from spatial data. A spatial trend is a regular
change of one or more non spatial attributes when spatially moving
away from a start object. Spatial trend detection is a graph search
problem therefore heuristic methods can be good solution. Artificial
immune system (AIS) is a special method for searching and
optimizing. AIS is a novel evolutionary paradigm inspired by the
biological immune system. The models based on immune system
principles, such as the clonal selection theory, the immune network
model or the negative selection algorithm, have been finding
increasing applications in fields of science and engineering.
In this paper, we develop a novel immunological algorithm based
on clonal selection algorithm (CSA) for spatial trend detection. We
are created neighborhood graph and neighborhood path, then select
spatial trends that their affinity is high for antibody. In an
evolutionary process with artificial immune algorithm, affinity of
low trends is increased with mutation until stop condition is satisfied.