We are considering a problem of faulttolerant wormhole unicast routing in computer networks, consisting of nodes (processor units), connected by bi-directional links. Each node can be viewed as the combination of a router and a processor with some RAM, bus and I/O circuitry. We concentrate on networks with arbitrary (irregular) topologies. The problem of routing in the presence of faults is div...

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

In this thesis, we present new approximation algorithms as well as hardness of approximation results for N P-hard vehicle routing problems related to public transportation. We consider two different problem classes that also occur frequently in areas such as logistics, robotics, or distribution systems. For the first problem class, the goal is to visit as many locations in a network as possible...

Ad hoc networks are multihop wireless networks without fixed infrastructure, whose topology changes frequently and unpredictably. How to issue routes in such networks with sufficient and constant bandwidth is a key problem for some real-time services like audio and video services. This paper proposes a novel QoS solution using code division multiple access (CDMA) scheme, named CDMA Bus Lane, wh...

We consider routing in multiple-bus systems with faulty nodes and buses. A cube-based multiple-bus system is used as an example to demonstrate our approach. In such a system, processors are partitioned into two sets based on the bipartite graph definition, one set is called a processor set and the other one becomes a bus set. A fault-tolerant routing scheme is proposed based on limited global i...

Most of the children develop extra-curricular activities in the afternoon after the school timetable. These activities are generally organized in each school, but sometimes the amount de scholars interested in one activity is very limited; the school has a few available resources or the preferences of their students do not match with the facilities. To expand the number of activities offered to...

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

the problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. the purpose of this paper is to develop a vehicle routing problem (vrp) model that addresses stochastic simultaneous pickup and delivery in the urban pub...

stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for lar...