In this paper, we show that cost variation for long-distance travel is often substantial and discuss why it likely to increase further in the future. Thus, current practice large-scale models, set one single a combination of origin, destination, mode, purpose, has potential improvement. To tackle issue, develop ways accounting model estimation forecasting. For public transport, two approaches a...

Let G be a connected graph and k ≥ 1 an integer. The open k-neighborhood Nk G(v) of v ∈ V (G) is the set = {u \ {v}: dG(u, v) ≤ k}. A S vertices called distance k-cost effective if for every vertex u in S, |Nk G(u) ∩ (V S)| − S| 0. maximum cardinality upper number G. In this paper, we characterized sets corona lexicographic product two graphs. Consequently, bounds or exact values numbers these ...

Consider the following classical search problem: given a target point p ∈ <, starting at the origin, find p with minimum cost, where cost is defined as the distance travelled. Let D = |p| be the distance of the point p from the origin. When no lower bound on D is given, no competitive search strategy exists. Demaine, Fekete and Gal (Online searching with turn cost, Theor. Comput. Sci., 361(2-3)...

BACKGROUND There are three different types of ambulance systems, all of which can manage the same secondary intensive care patient transport mission: road ambulance, rotor-wing ambulance, and fixed-wing ambulance. We hypothesized that costs for specific transport distances would differ between systems. We aimed to analyze distances and observed times for ambulance intensive care secondary trans...

this paper submitting the computation of optimize point of ordering in inventory control systems and particularly for continuous review of ordering system (r,q) by fuzzy logic method which similarly can be used for other ordering systems. since in the ordering models we cannot forecast the parameters like cost exactly, we have ambiguity. in this case using precise parameters may cause wrong dec...

let $g$ be a connected graph with vertex set $v(g)$‎. ‎the‎ ‎degree resistance distance of $g$ is defined as $d_r(g) = sum_{{u‎,‎v} subseteq v(g)} [d(u)+d(v)] r(u,v)$‎, ‎where $d(u)$ is the degree‎ ‎of vertex $u$‎, ‎and $r(u,v)$ denotes the resistance distance between‎ ‎$u$ and $v$‎. ‎in this paper‎, ‎we characterize $n$-vertex unicyclic‎ ‎graphs having minimum and second minimum degree resista...