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 ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

Chinese computer scientists have solved a 40-year-old mathematics bottleneck, an advance that might help boost performance in hi-tech areas ranging from chip design and telecommunications to drone ...

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.

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 ...

All chip designers know that they must take special care to avoid metastability problems when they have multiple, asynchronous clock domains. In contrast, a design in which all clocks are synchronous ...

This paper aims to optimize the “Parts to Picker” picking system with order sorting and AGV path planning as its priorities according to AGV-based “Parts to Picker” sorting mode and the order picking ...

This paper proposes an improved ant colony algorithm to achieve efficient searching capabilities of path planning in complicated maps for mobile robot. The improved ant colony algorithm uses the ...