numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(fspp). the main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...

In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...

A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem of determining ψk(G) is NP-hard for each k ≥ 2, while for trees the problem can be solved in linear time. We investigate upper bounds on the value of ψk(G) and pr...

We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the Vickrey cost of a minimum spanning tree (MST) in a complete graph with random edge weights; and the Vickrey cost of a perfect matching in a complete bipartite graph with random edge weights. In each case, in the large-size...

We consider the problem of computing a minimum-weight polygonal path between two points in a weighted polygonal subdivision, subject to the constraint that the path have few segments (links). We give an algorithm that generates paths of weighted length at most (1 + 2) times the weight of a minimum-cost k-link path, for any fixed 2 > 0, while using at most 2k − 1 links. This is an improvement ov...

This investigation examines all-optical multicast routing in wavelength-routed optical networks with sparse Multicast Capable (MC) nodes that have three phases. The first phase is the MC node placement, and the maximum path count first (MPCF) algorithm is utilized to obtain candidates for MC nodes. The second phase is a multicast routing with MC-based schemes which including two algorithms, nam...

in this article we present an algorithm for converting a network problem with several sources and several sinks including several transfer nodes and condition of supplying the demand of any sink from a particular source to the transportation problem.  towards this end, and considering the very special structure of transportation algorithm, after implementing the shortest path algorithm or solvi...

Some new results on our approach 2] of edge integration for shape mod-eling are presented. It enables to nd the global minimum of active contour models' energy between two points. Initialization is made easier and the curve cannot be trapped at a local minimum by spurious edges. We modiied the \snake" energy by including the internal regularization term in the external potential term. Our metho...

Some new results on our approach 2] of edge integration for shape mod-eling are presented. It enables to nd the global minimum of active contour models' energy between two points. Initialization is made easier and the curve cannot be trapped at a local minimum by spurious edges. We modiied the \snake" energy by including the internal regularization term in the external potential term. Our metho...