Sciweavers

58 search results - page 9 / 12
» Approximation algorithms for deadline-TSP and vehicle routin...
Sort
View
CORR
2010
Springer
61views Education» more  CORR 2010»
13 years 7 months ago
Optimization of Multiple Vehicle Routing Problems using Approximation Algorithms
R. Nallusamy, K. Duraiswamy, R. Dhanalakshmi, P. P...
TRANSCI
2010
169views more  TRANSCI 2010»
13 years 2 months ago
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
Ilgaz Sungur, Yingtao Ren, Fernando Ordó&nt...
KES
2007
Springer
14 years 1 months ago
Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: A Case Study
Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The e...
Paola Pellegrini, Daniela Favaretto, Elena Moretti
JAL
2006
175views more  JAL 2006»
13 years 7 months ago
Approximations for minimum and min-max vehicle routing problems
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
Esther M. Arkin, Refael Hassin, Asaf Levin
WAOA
2010
Springer
256views Algorithms» more  WAOA 2010»
13 years 5 months ago
The Train Delivery Problem - Vehicle Routing Meets Bin Packing
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
Aparna Das, Claire Mathieu, Shay Mozes