Engineering Papers⌕ Search

Engineering topics

Vlachos, D S

Publications and source records attributed to Vlachos, D S.

A NEW FAMILY OF MULTISTEP METHODS WITH IMPROVED PHASE-LAG CHARACTERISTICS FOR THE INTEGRATION OF ORBITAL PROBLEMS

In this paper, we introduce a new family of 10-step linear multistep methods for the integration of orbital problems. The new methods are constructed by adopting a new methodology which improves the phase-lag characteristics by vanishing both the phase-lag function and its first derivatives at a specific frequency. The efficiency of the new family of methods is proved via error analysis and numerical applications.

79 ASTRONOMY AND ASTROPHYSICS↗

Fuzzy Neural Networks for Decision Support in Negotiation

There is a large number of parameters which one can take into account when building a negotiation model. These parameters in general are uncertain, thus leading to models which represents them with fuzzy sets. On the other hand, the nature of these parameters makes them very difficult to model them with precise values. During negotiation, these parameters play an important role by altering the outcomes or changing the state of the negotiators. One reasonable way to model this procedure is to accept fuzzy relations (from theory or experience). The action of these relations to fuzzy sets, produce new fuzzy sets which describe now the new state of the system or the modified parameters. But, in the majority of these situations, the relations are multidimensional, leading to complicated models and exponentially increasing computational time. In this paper a solution to this problem is presented. The use of fuzzy neural networks is shown that it can substitute the use of fuzzy relations with comparable results. Finally a simple simulation is carried in order to test the new method.

99 GENERAL AND MISCELLANEOUS↗

A Discrete Lagrangian Algorithm for Optimal Routing Problems

The ideas of discrete Lagrangian methods for conservative systems are exploited for the construction of algorithms applicable in optimal ship routing problems. The algorithm presented here is based on the discretisation of Hamilton's principle of stationary action Lagrangian and specifically on the direct discretization of the Lagrange-Hamilton principle for a conservative system. Since, in contrast to the differential equations, the discrete Euler-Lagrange equations serve as constrains for the optimization of a given cost functional, in the present work we utilize this feature in order to minimize the cost function for optimal ship routing.

97 MATHEMATICS AND COMPUTING↗

Obstacle Bypassing in Optimal Ship Routing Using Simulated Annealing

In this paper we are going to discuss a variation on the problem of finding the shortest path between two points in optimal ship routing problems consisting of obstacles that are not allowed to be crossed by the path. Our main goal are going to be the construction of an appropriate algorithm, based in an earlier work by computing the shortest path between two points in the plane that avoids a set of polygonal obstacles.

97 MATHEMATICS AND COMPUTING↗