Abstract: The uncertainty of travel times on a time-dependent network is conventionally considered as randomness or fuzziness. However, sometimes, randomness or fuzziness cannot describe the ...

Abstract: The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a ...

This paper first comprehensively combs and analyzes the different operation modes of China’s new energy vehicle mobile charging service industry through literature reading, enterprise research, ...

Evolution has led to natural algorithms that regulate collective behavior in many biological systems. Here, we investigate natural algorithms that solve the shortest path problem, a basic optimization ...

This is a stand-alone tool for running tracking of divisible objects using a modified successive shortest paths solver. The bin folder contains the tracking tool that can be run from the command line.