Abstract: In this research, we study a control method of a multivehicle
system while considering the limitation of communication
range for each vehicles. When we control networked vehicles with
limitation of communication range, it is important to control the
communication network structure of a multi-vehicle system in order
to keep the network-s connectivity. From this, we especially aim to
control the network structure to the target structure. We formulate
the networked multi-vehicle system with some disturbance and the
communication constraints as a hybrid dynamical system, and then
we study the optimal control problems of the system. It is shown
that the system converge to the objective network structure in finite
time when the system is controlled by the receding horizon method.
Additionally, the optimal control probrems are convertible into the
mixed integer problems and these problems are solvable by some
branch and bound algorithm.
Abstract: Very Large and/or computationally complex optimization problems sometimes require parallel or highperformance computing for achieving a reasonable time for computation. One of the most popular and most complicate problems of this family is “Traveling Salesman Problem". In this paper we have introduced a Branch & Bound based algorithm for the solution of such complicated problems. The main focus of the algorithm is to solve the “symmetric traveling salesman problem". We reviewed some of already available algorithms and felt that there is need of new algorithm which should give optimal solution or near to the optimal solution. On the basis of the use of logarithmic sampling, it was found that the proposed algorithm produced a relatively optimal solution for the problem and results excellent performance as compared with the traditional algorithms of this series.
Abstract: Renewable and non-renewable resource constraints have been vast studied in theoretical fields of project scheduling problems. However, although cumulative resources are widespread in practical cases, the literature on project scheduling problems subject to these resources is scant. So in order to study this type of resources more, in this paper we use the framework of a resource constrained project scheduling problem (RCPSP) with finish-start precedence relations between activities and subject to the cumulative resources in addition to the renewable resources. We develop a branch and bound algorithm for this problem customizing precedence tree algorithm of RCPSP. We perform extensive experimental analysis on the algorithm to check its effectiveness and performance for solving different instances of the problem in question.