Sciweavers

236 search results - page 3 / 48
» On the Vehicle Routing Problem with lower bound capacities
Sort
View
ANOR
2005
120views more  ANOR 2005»
14 years 9 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
SIAMDM
1998
55views more  SIAMDM 1998»
14 years 9 months ago
Multiple Capacity Vehicle Routing on Paths
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
D. J. Guan, Xuding Zhu
TON
2010
118views more  TON 2010»
14 years 4 months ago
Capacity Scaling of Wireless Networks With Inhomogeneous Node Density: Lower Bounds
Abstract-- We consider static ad hoc wireless networks comprising significant inhomogeneities in the node spatial distribution over the area, and analyze the scaling laws of their ...
Giusi Alfano, Michele Garetto, Emilio Leonardi, Va...
CDC
2008
IEEE
134views Control Systems» more  CDC 2008»
15 years 4 months ago
Dynamic vehicle routing with heterogeneous demands
— In this paper we study a variation of the Dynamic Traveling Repairperson Problem (DTRP) in which there are two classes of demands; high priority, and low priority. In the probl...
Stephen L. Smith, Marco Pavone, Francesco Bullo, E...
CORR
2010
Springer
140views Education» more  CORR 2010»
14 years 9 months ago
Dynamic Vehicle Routing for Data Gathering in Wireless Networks
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
Güner D. Çelik, Eytan Modiano