Nowadays, the development of „smart cities‟ with a high level of quality of life is becoming a prior challenge to be addressed. In this framework, promoting the model shift towards more reliable, greener and in general more sustainable transportation modes, namely towards a „smart mobility‟ could significantly contribute to achieve this goal. The aim of this paper is to provide users with more ...

This paper describ esa new search algorithm, Dual Dijkstra Search. F roma given initial and nal conguration, Dual Dijkstra Search nds various paths which have di er enttop olo giessimultaneously. This alo grithm allows you to enumerate not only the optimal one but variety of meaningful candidates among local minimum paths. It is based on the algorithm of Dijkstra[10], which is populary used to ...

Nacrtak This paper describes a program for optimizing forest road alignments using the Dijkstra shortest path method and a cubic spline function. We previously developed a method for optimizing forest road alignments once a series of intersection points (IPs) were selected manually using Tabu Search. The application of the program to a part of Capitol State Forest in Washington State, USA indic...

Based on rapid upsurge in the demand and usage of electronic media devices such as tablets, smart phones, laptops, personal computers, etc. and its different display specifications including the size and shapes, image retargeting became one of the key components of communication technology and internet. The existing techniques in image resizing cannot save the most valuable information of image...

Abstract Determination of the best path or often called shortest finding is a method that has many benefits and can be applied in various cases fields science. In previous studies, authors have developed program using algorithms, such as held-karp, iterative deepening search, bidirectional depth first search limited search. this research author implements on information system for determining f...

A common algorithm to solve the shortest path problem (SPP) is the Dijkstra algorithm. In this paper, a generalized Dijkstra algorithm is proposed to handle SPP in an uncertain environment. Two key issues need to be addressed in SPP with fuzzy parameters. One is how to determine the addition of two edges. The other is how to compare the distance between two different paths with vailable online ...

We revisit a concept that has been central in some early stages of computer science, that of structured programming: a set of rules that an algorithm must follow in order to acquire a structure that is desirable in many aspects. While much has been written about structured programming, an important issue has been left unanswered: given an arbitrary, compiled program, describe an algorithm to de...

We present a HOL formalization of the foundational parts of Dijkstra’s classic monograph “A Discipline of Programming”. While embedding programming language semantics in theorem provers is hardly new, this particular undertaking raises several interesting questions, and perhaps makes an interesting supplement to the monograph. Moreover, the failure of HOL’s first order proof tactic to prove one...

This paper presents a new method for finding the node-disjoint paths with maximum combined bandwidth in communication networks. This problem is an NP-complete problem which can be optimally solved in exponential time using integer linear programming (ILP). The presented method uses a maximum-cost variant of Dijkstra algorithm and a virtual-node representation to obtain the maximum-bandwidth nod...

Are you feeling up today, or down in the dumps? Spatial metaphors that connote affective valence are common in English, where up in space=happy/positive and down in space=sad/negative. Past research suggests that these metaphors have some measure of psychological reality: people are faster to respond to words with an emotional connotation in metaphorcongruent regions of space (Meier & Robinson,...