the inventory routing problem (irp) arises in the context of vendor-managed systems. this problem addresses jointly solving an inventory management problem and a vehicle routing problem. in this paper, we consider a multi-depot multi-vehicle inventory routing problem in which suppliers produce one type of product to be delivered to customers during a finite time horizon. we propose a two-phase ...

Wireless mesh sensor networks (WMSNs) have recently gained a lot of interest due to their communication capability to support various applications with different Quality of Service (QoS) requirements. The most challenging issue is providing a tradeoff between the resource efficiency and the multiconstrained QoS support. For this purpose, we propose a cross-layer algorithm JSAR (Joint duty cycle...

In this paper, we study the cost optimal solution of the well-known multi-constrained multicast routing problem. This problem consists in finding a multicast structure that spans a source node and a set of destination nodes with respect to a set of constraints. This optimization problem is particularly interesting for the multicast network communications that require Quality of Service (QoS) gu...

In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...

The modern network service of finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. gives rise to the multi-path constrained (MCP) or multi-constrained optimal-path (MCOP) QoS routing problems, which are NP-complete. In this paper, these problems are solved through exact algorithms. Even though exact algorithms...

Multi-constrained quality-of-service routing (QoSR) is to find a feasible path that satisfies multiple constraints simultaneously, as an NPC problem, which is also a big challenge for the upcoming next-generation networks. In this paper, we propose SA_MCP, a novel heuristic algorithm, by applying simulated annealing to Dijkstra's algorithm. This algorithm first uses a nonlinear energy function ...

Multi-constrained path (MCP) selection is one of the great challenges that QoS routing (QoSR) faces. To address it in an efficient and highly responsive manner, we propose a new QoSR algorithm, namely NM MCP. Using the Dijkstra’s algorithm with respect to each link metric, NM MCP pre-computes k primary paths, where k is the number of link weights. When a routing request arrives, it executes a m...