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

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

using greedy clustering method to solve capacitated location-routing problem with fuzzy demands abstract in this paper, the capacitated location routing problem with fuzzy demands (clrp_fd) is considered. in clrp_fd, facility location problem (flp) and vehicle routing problem (vrp) are observed simultaneously. indeed the vehicles and the depots have a predefined capacity to serve the customerst...

internet traffic has grown exponentially over last few years due to provision of multiple class services through internet backbone. with the explosive use of internet, contemporary internet routers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. in this paper, an analysis is made how forecasting technique, routing algorithm and genetic...

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

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

We prove the existence of an oblivious routing scheme that is -competitive in terms , thus resolving a well-known question routing. Concretely, consider undirected network and set packets each with its own source destination. The objective to choose path for packet, from destination, so as minimize defined follows: dilation maximum hop length, congestion number paths include any single edge. ob...

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...

HighSpeed Multimedia Networks (HSMN) have diverse Quality of Service (QoS) requirements. Designing QoS routing protocols that optimizes multiple QoS requirements is one of the major issues in these networks. Traditional routing algorithms are not adequate to handle QoS requirements of real-time multimedia applications. QoS Routing is defined as finding paths satisfying multiple QoS constraints....

in this paper, the capacitated location-routing problem with fuzzy demands (clrp-fd) is considered. the clrp-fd is composed of two well-known problems: facility location problem and vehicle routing problem. the problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. in clrp-fd, a set of c...