stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for lar...

one may daresay that the foremost issue and problem in translation is to observe “translation equivalence principle” so that the translated text to be the equivalent and all-out mirror against the original text. to obtain this goal, it is perfectly necessary to pay attention to semantic different layers, ranged from referential meaning to empirical, interactive, implicit, meanings, semantic uni...

‎the notion of quasi-einstein metric in physics is equivalent to the notion of ricci soliton in riemannian spaces‎. ‎quasi-einstein metrics serve also as solution to the ricci flow equation‎. ‎here‎, ‎the riemannian metric is replaced by a hessian matrix derived from a finsler structure and a quasi-einstein finsler metric is defined‎. ‎in compact case‎, ‎it is proved that the quasi-einstein met...

Generalized entropies are studied as Lyapunov functions for the Master equation (Markov chains). Three basic properties of these Lyapunov functions are taken into consideration: universality (independence of the kinetic coefficients), trace-form (the form of sum over the states), and additivity (for composition of independent subsystems). All the entropies, which have all three properties simul...

In this paper, we introduce the concept of x-maximal flatness. A control system is x-maximally flat if the number of new states gained by each successive derivation of the flat output is the largest possible. Firstly, we show that the only control-linear systems that are xmaximally flat are those that are static feedback equivalent to the m-chained form. Secondly, we generalize that result from...

Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...