Sciweavers

2343 search results - page 38 / 469
» The Locomotive Routing Problem
Sort
View
ANOR
2005
120views more  ANOR 2005»
13 years 7 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
GI
2007
Springer
14 years 1 months ago
The Collaborative Carrier Vehicle Routing Problem for Capacitated Traveling Salesman Tours
Abstract: This paper concentrates on a new framework for a post-market reassignment of requests in a Collaborative Carrier Network (CCN). While the framework was applied to a picku...
Susanne Berger, Christian Bierwirth
COR
2008
160views more  COR 2008»
13 years 6 months ago
Formulations and exact algorithms for the vehicle routing problem with time windows
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
Brian Kallehauge
EVOW
2007
Springer
14 years 1 months ago
Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing ...
Marek Kubiak, Przemyslaw Wesolek
SAC
2008
ACM
13 years 7 months ago
Decentralized coordination strategies for the vehicle routing problem
Modern software control systems must cope with uncertainty, manage dynamic environments, as well as provide greater flexibility. Distributed agent-based control systems are the id...
Matteo Vasirani, Sascha Ossowski