One of user's queries from navigation service is to find the nearest facility in terms of time. The facility that is being questioned by the user as a destination may have a queuing service system (e.g. bank), which means that the cost function of the shortest path includes the waiting time at the destination as well as the travel time. This research conducts in the zone 1 of Mashhad with Bank ...

This study considers a vehicle routing problem with time windows, accessibility restrictions on customers and a fleet that is heterogeneous with regard to capacity and average speed. A vehicle can perform multiple routes per day, all starting and ending at a single depot, and it is assigned to a single driver, whose total work hours are limited. A column generation algorithm embedded in a branc...

The modern network service of finding the optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. gives rise to the multiconstrained optimal-path (MCOP) QoS routing problem, which is NP-complete. In this paper, this problem is solved through both exact and heuristic algorithms. We propose an exact algorithm E MCOP, which first constructs...

In this paper we study the relationship between Constraint Programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and modality-based SP problems can be naturally modeled and solved within the Soft Constraint Logic Programming (SCLP) framework, where logic programming is coupled with soft constraints. In this way we provide this...

We provide several new algorithmic results for the secluded path problem, specifically approximation and optimality results for the static algorithm of [3, 5], and an extension (h-Memory) of it based on de Bruijn graphs, when applied to bounded degree graphs and some other special graph classes which can model wireless communication and line-of-sight settings. Our primary result is that h-Memor...

The link failure due to the secondary users exiting the licensed channels when primary users reoccupy the licensed channels is very important in cognitive wireless mesh networks (CWMNs). A multipath routing and spectrum allocation algorithm based on channel interference and reusability with Quality of Service (QoS) constraints in CWMNs (MRIR) was proposed. Maximizing the throughput and the acce...

We present a new algorithm, A*Prune, to list (in order of increasing length) the first K Multiple-Constrained-Shortest-Path (KMCSP) between a given pair of nodes in a digraph in which each arc is associated with multiple Quality-of-Service (QoS) metrics. The algorithm constructs paths starting at the source and going towards the destination. But, at each iteration, the algorithm gets rid of all...

This paper addresses the problem of time-dependent shortest multimodal path in complex and large urban areas. This problem is one of the important and practical problems in several fields such as transportation, and recently attracts the research focus due to developments in new application areas. An adapted evolutionary algorithm, in which chromosomes with variable lengths and particularly def...