Abstract: Power loss reduction is one of the main targets in power industry and so in this paper, the problem of finding the optimal configuration of a radial distribution system for loss reduction is considered. Optimal reconfiguration involves the selection of the best set of branches to be opened ,one each from each loop, for reducing resistive line losses , and reliving overloads on feeders by shifting the load to adjacent feeders. However ,since there are many candidate switching combinations in the system ,the feeder reconfiguration is a complicated problem. In this paper a new approach is proposed based on a simple optimum loss calculation by determining optimal trees of the given network. From graph theory a distribution network can be represented with a graph that consists a set of nodes and branches. In fact this problem can be viewed as a problem of determining an optimal tree of the graph which simultaneously ensure radial structure of each candidate topology .In this method the refined genetic algorithm is also set up and some improvements of algorithm are made on chromosome coding. In this paper an implementation of the algorithm presented by [7] is applied by modifying in load flow program and a comparison of this method with the proposed method is employed. In [7] an algorithm is proposed that the choice of the switches to be opened is based on simple heuristic rules. This algorithm reduce the number of load flow runs and also reduce the switching combinations to a fewer number and gives the optimum solution. To demonstrate the validity of these methods computer simulations with PSAT and MATLAB programs are carried out on 33-bus test system. The results show that the performance of the proposed method is better than [7] method and also other methods.
Abstract: Network reconfiguration in distribution system is realized by changing the status of sectionalizing switches to reduce the power loss in the system. This paper presents a new method which applies an artificial bee colony algorithm (ABC) for determining the sectionalizing switch to be operated in order to solve the distribution system loss minimization problem. The ABC algorithm is a new population based metaheuristic approach inspired by intelligent foraging behavior of honeybee swarm. The advantage of ABC algorithm is that it does not require external parameters such as cross over rate and mutation rate as in case of genetic algorithm and differential evolution and it is hard to determine these parameters in prior. The other advantage is that the global search ability in the algorithm is implemented by introducing neighborhood source production mechanism which is a similar to mutation process. To demonstrate the validity of the proposed algorithm, computer simulations are carried out on 14, 33, and 119-bus systems and compared with different approaches available in the literature. The proposed method has outperformed the other methods in terms of the quality of solution and computational efficiency.
Abstract: A new generation of manufacturing machines
so-called MIMCA (modular and integrated machine control
architecture) capable of handling much increased complexity in
manufacturing control-systems is presented. Requirement for more
flexible and effective control systems for manufacturing machine
systems is investigated and dimensioned-which highlights a need for
improved means of coordinating and monitoring production
machinery and equipment used to- transport material. The MIMCA
supports simulation based on machine modeling, was conceived by
the authors to address the issues. Essentially MIMCA comprises an
organized unification of selected architectural frameworks and
modeling methods, which include: NISTRCS, UMC and Colored
Timed Petri nets (CTPN). The unification has been achieved; to
support the design and construction of hierarchical and distributed
machine control which realized the concurrent operation of reusable
and distributed machine control components; ability to handle
growing complexity; and support requirements for real- time control
systems. Thus MIMCA enables mapping between 'what a machine
should do' and 'how the machine does it' in a well-defined but
flexible way designed to facilitate reconfiguration of machine
systems.
Abstract: Software projects are very dynamic and require
recurring adjustments of their project plans. These settings can be
understood as reconfigurations in the schedule, in the resources
allocation and other design elements. Yet, during the planning and
execution of a software project, the integration of specific activities
in the projects with the activities that take part in the organization-s
common activity flow should be considered. This article presents the
results from a systematic review of aspects related to software
projects- dynamic reconfiguration emphasizing the integration of
project management with the organizational flows. A series of studies
was analyzed from the year 2000 to the present. The results of this
work show that there is a diversity of techniques and strategies for
dynamic reconfiguration of software projects-. However, few
approaches consider the integration of software project activities with
the activities that take part in the organization-s common workflow.
Abstract: Urban road network traffic has become one of the
most studied research topics in the last decades. This is mainly due to
the enlargement of the cities and the growing number of motor
vehicles traveling in this road network. One of the most sensitive
problems is to verify if the network is congestion-free. Another
related problem is the automatic reconfiguration of the network
without building new roads to alleviate congestions. These problems
require an accurate model of the traffic to determine the steady state
of the system. An alternative is to simulate the traffic to see if there
are congestions and when and where they occur. One key issue is to
find an adequate model for road intersections. Once the model
established, either a large scale model is built or the intersection is
represented by its performance measures and simulation for analysis.
In both cases, it is important to seek the queueing model to represent
the road intersection. In this paper, we propose to model the road
intersection as a BCMP queueing network and we compare this
analytical model against a simulation model for validation.
Abstract: The NGN (Next Generation Network), which can
provide advanced multimedia services over an all-IP based network, has been the subject of much attention for years. While there have
been tremendous efforts to develop its architecture and protocols, especially for IMS, which is a key technology of the NGN, it is far
from being widely deployed. However, efforts to create an advanced
signaling infrastructure realizing many requirements have resulted in a
large number of functional components and interactions between those
components. Thus, the carriers are trying to explore effective ways to
deploy IMS while offering value-added services. As one such
approach, we have proposed a self-organizing IMS. A self-organizing
IMS enables IMS functional components and corresponding physical
nodes to adapt dynamically and automatically based on situation such
as network load and available system resources while continuing IMS
operation. To realize this, service continuity for users is an important
requirement when a reconfiguration occurs during operation. In this
paper, we propose a mechanism that will provide service continuity to
users and focus on the implementation and describe performance
evaluation in terms of number of control signaling and processing time
during reconfiguration