Sciweavers

204 search results - page 13 / 41
» Solving a Dynamic Real-Life Vehicle Routing Problem
Sort
View
AEI
2004
150views more  AEI 2004»
13 years 8 months ago
Ant colony optimization techniques for the vehicle routing problem
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
John E. Bell, Patrick R. McMullen
HIS
2008
13 years 10 months ago
A GRASP Algorithm Using RNN for Solving Dynamics in a P2P Live Video Streaming Network
In this paper, we present an algorithm based on the GRASP metaheuristic for solving a dynamic assignment problem in a P2P network designed for sending real-time video over the Int...
Marcelo Martínez, Alexis Morón, Fran...
NETWORKS
2007
13 years 8 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
EOR
2007
90views more  EOR 2007»
13 years 8 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
MP
2006
138views more  MP 2006»
13 years 8 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...