Routing problems are among the most studied ones in the operations research community, and many works have been devoted to the analysis of optimal routing policies in various static and dynamic scenarios. Most of these works have aimed at developing centralized algorithms to determine an optimal routing strategy. When the size of the system is not too large, a single routing agent can then impl...

In the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. On the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. Effective transport activities are also one of the most important c...

Simultaneous routing and resource allocation has been considered in wireless networks for its performance improvement. In this paper we propose a cross-layer optimization framework for worst-case queue length minimization in some type of FDMA based wireless networks, in which the the data routing and the power allocation problem are jointly optimized with Fuzzy distributed H∞ control strategy ....

This paper proposes a novel scheme of Fuzzy Logic based dynamic routing in computer networks. The proposed dynamic routing algorithm is suited for application in Interior Gateway Protocols (IGP) inside an autonomous system (AS), such as a Local Area Networks (LAN). It is used in the protocols to find out a set of best possible routes, where each of the nodes broadcasts link status rather than b...

Mobile ad-hoc networks (MANETs) are the wireless ad-hoc networks which enclose sovereign group of wireless mobile nodes. The communication is relayed via routes which are discovered using various routing protocols. Diverse routing protocols have been proposed so far in MANETs. Likewise, swarm intelligence (SI) based ant colony optimization (ACO) technique have various routing protocols which ca...

Moat routing is the routing of nets between the input/output pads and the core circuit. In this paper, it is proved that moat routing is NP-complete under the routing model in which there are no vertical con icts and doglegs are disallowed (i.e., every net is routed within a single track). This contrasts with the fact that channel routing is e ciently solvable under these restrictions. The pape...

Legacy networks are often designed to operate with simple single-path routing, like shortest-path, which is known to be throughput suboptimal. On the other hand, previously proposed throughput optimal policies (i.e., backpressure) require every device in the network to make dynamic routing decisions. In this work, we study an overlay architecture for dynamic routing such that only a subset of d...

in a logistic system, decisions on location of depot, vehicle routing and assignment of routes to vehicles should be considered simultaneously. the location-routing problems are defined to find the optimal number and locations of depots, and at the same time with the distribution routes for the vehicles. because of the complexity and the time consuming computation, this problem belongs to a cla...

We study optimal static routing problems in open multiclass networks with state-independent arrival and service rates. Our goal is to study the uniqueness of optimal routing under different scenarios. We consider first the overall optimal policy that is the routing policy whereby the overall mean cost of a job is minimized. We then consider an individually optimal policy whereby jobs are routed...