Open Advanced Search

Log in
Enterprise Plans
Free Trial

Log in
Free Trial
Enterprise Plans
Browse
Features
Pricing

DeepDyve

Advanced Search

show/hide query preview

With all of the words or DOIs:

DeepDyve's default query mode: search by keyword or DOI.

With the exact phrase:

Require these words, in this exact order. Do not surround your terms in double-quotes ("") in this field.

With at least one of the words:

Find any of these words, separated by spaces

Without the words:

Exclude each of these words, separated by spaces

With words in the article title:

Search for these terms only in the title of an article

Published between the years:

With the following authors:

Most effective as: LastName, First Name or Lastname, FN

With words in the journal name:

Search for articles published in journals where these words are in the journal name

Reset filters

Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

DeepDyve requires Javascript to function. Please enable Javascript on your browser to continue.

Shortest Path Solvers. From Software to Wetware

Part of the Emergence, Complexity and Computation Book Series (volume 32)

Editors: Adamatzky, Andrew

DOI: 10.1007/978-3-319-77510-4

ISBN: 978-3-319-77509-8

Publisher: Springer International Publishing - Springer Journals

Apr 27, 2018

1 - 10 of 17 Chapters

Available

A Parallel Algorithm for the Constrained Shortest Path Problem on Lattice Graphs

Matic, Ivan

Pages: 1 –26

[The edges of a graph are assigned weights and passage times which are assumed to be positive integers. We present a parallel algorithm for finding the shortest path whose total weight is smaller than a pre-determined value. In each step the processing elements are not analyzing the entire graph....
Available

Gathering a Swarm of Robots Through Shortest Paths

Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo

Pages: 27 –72

[The gathering problem has been largely studied in the last years with respect to different environments. The requirement is to move a team of robots initially placed at different locations toward a common point. Robots move based on the so called Look-Compute-Move model. Each time a robot wakes...
Available

The MinSum-MinHop and the MaxMin-MinHop Bicriteria Path Problems

Pascoal, Marta

Pages: 73 –97

[The number of hops (or arcs) of a path is a frequent objective function with applications to problems where network resources utilization is to be minimized. In this chapter we solve bicriteria path problems involving this objective function and two other common metrics, the path cost and the...
Available

Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks

D’Angelo, Gianlorenzo; D’Emidio, Mattia; Frigioni, Daniele

Pages: 99 –143

[Computing and updating distributed shortest paths is a core functionality of today’s communication networks. The solutions known in the literature are classified into two categories, namely Distance-Vector and Link-State algorithms. Distance-Vector algorithms usually require each node of the...
Available

Influenza Virus Algorithm for Multiobjective Energy Reduction Open Vehicle Routing Problem

Psychas, Iraklis-Dimitrios; Delimpasi, Eleni; Marinaki, Magdalene; Marinakis, Yannis

Pages: 145 –161

[We propose a Parallel Multi-Start Multiobjective Influenza Virus Algorithm (PMS-MOIVA) for the solution of the Multiobjective Energy Reduction Open Vehicle Routing Problem. The PMS-MOIVA could be categorized in the Artificial Immune System algorithms, as it simulates the process of annual...
Available

Practical Algorithms for the All-Pairs Shortest Path Problem

Brodnik, Andrej; Grgurovič, Marko

Pages: 163 –180

[We study practical algorithms for solving the all-pairs shortest path problem. The Floyd-Warshall algorithm is frequently used to solve the aforementioned problem, and we show how it can be augmented to drastically reduce the number of path combinations examined. Very favorable results are shown...
Available

Computing Shortest Paths with Cellular Automata

Akl, Selim G.

Pages: 181 –198

[We describe cellular-automaton-based algorithms for solving two shortest path problems on arbitrary connected, directed, and weighted graphs with n vertices. The first problem is that of finding the shortest path from a given vertex to another given vertex of the graph. A two-dimensional...
Available

Cellular Automata Applications in Shortest Path Problem

Tsompanas, Michail-Antisthenis I.; Dourvas, Nikolaos I.; Ioannidis, Konstantinos; Sirakoulis, Georgios Ch.; Hoffmann, Rolf; Adamatzky, Andrew

Pages: 199 –237

[Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural...
Available

Checkerboard Pattern Formed by Cellular Automata Agents

Hoffmann, Rolf

Pages: 239 –264

[Considered is a multi-agent system with agents, modeled by Cellular Automata. The agents have the task to form a checkerboard (CB) pattern on an n×n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb}...
Available

Do Ants Use Ant Colony Optimization?

von Thienen, Wolfhard; Czaczkes, Tomer J.

Pages: 265 –291

[Ant Colony Optimization (ACO)Ant Colony Optimization (ACO) is a widespread optimization technique used to solve complex problems in a broad range of fields, including engineering, software development and logistics. It was inspired by the behaviour of ants which can collectively select the...

results per page

Browse All eBooks

Features

Search and discover articles on DeepDyve, PubMed, and Google Scholar
Read the full-text of open access and premium content
Organize articles with folders and bookmarks
Collaborate on and share articles and folders

Info

Pricing
Enterprise Plans
Browse Journals & Topics
About DeepDyve

Help

Help
Publishers
Contact Us

Sign up for your 14-Day Free Trial Now!

Read and print from thousands of top scholarly journals.

System error. Please try again!

Continue with Facebook

By signing up, you agree to DeepDyve’s Terms of Service and Privacy Policy.

Already have an account? Log in

Save Article to Bookmarks

Bookmark this article. You can see your Bookmarks on your DeepDyve Library.

To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.

Subscribe to Journal Email Alerts

To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.

Follow a Journal

To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.

Our policy towards the use of cookies

All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.

cookie policy