Sciweavers

55 search results - page 3 / 11
» Improved bounds for vehicle routing solutions
Sort
View
ATAL
2010
Springer
13 years 6 months ago
Agents towards vehicle routing problems
A multi-agent VRP solver is presented in this paper. It utilizes the contract-net protocol based allocation and several improvement strategies. It provides the solution with the q...
Jirí Vokrínek, Antonín Komend...
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 5 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
CONSTRAINTS
2000
96views more  CONSTRAINTS 2000»
13 years 5 months ago
A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...
Philip Kilby, Patrick Prosser, Paul Shaw
TRANSCI
2008
94views more  TRANSCI 2008»
13 years 3 months ago
Routing for Relief Efforts
In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Since it is critical that the deliv...
Ann Melissa Campbell, Dieter Vandenbussche, Willia...
ANOR
2005
120views more  ANOR 2005»
13 years 5 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