Path finding is an ubiquitous problem in optimization and graphs in general, for which fast algorithms exist. Yet, in many cases side constraints make these well known algorithms inapplicable. In this paper we study constraints to find shortest paths on a weighted directed graph with arbitrary side constraints. We use the conjunction of two directed tree constraints to model the path, and a bou...

Electric vehicles (EV) powered by batteries will play a significant role in the road traffic of the future. The unique characteristics of such EVs – limited cruising range, long recharge times, and the ability to regain energy during deceleration – require novel routing algorithms, since the task is now to determine the most economical route rather than just the shortest one. This paper propose...

Transmission of multimedia streams imposes a minimum-bandwidth requirementon the path being used to ensureend-to-end Quality-ofService (QoS) guarantees. While any shortest-path algorithm can be used to select a feasible path, additional constraints that limit resource consumption and balance the network load are needed to achieve efficient resource utilization. We present a systematic evaluatio...

To reduce distribution risk and improve the efficiency of medical materials delivery under major public health emergencies, this paper introduces a drone routing problem with time windows. A mixed-integer programming model is formulated considering contactless delivery, total travel time, customer service Utilizing Dantzig–Wolfe decomposition, proposed optimization converted into path-based mas...

In wireless ad hoc mobile network, a host desires to communicate with another host may need some intermediate nodes to relay data packets. To maximize the channel resource utilization and minimize the network transfer delay along the path, the shortest path with minimum hops approach is often adapted. However, by considering the employing medium access control (MAC) protocol, the minimum transf...

Given a set of n points on the plane colored with k ≤ n colors, the Trip Planning Problem asks for the shortest path visiting the k colors. It is a well-known NP-hard problem. We show that under some natural constraints on the path, the problem can be solved in polynomial time.

In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...