Sciweavers

58 search results - page 5 / 12
» Approximation algorithms for deadline-TSP and vehicle routin...
Sort
View
EUROCAST
2007
Springer
126views Hardware» more  EUROCAST 2007»
14 years 1 months ago
Parallel Tabu Search and the Multiobjective Capacitated Vehicle Routing Problem with Soft Time Windows
Abstract. In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with soft Time Windows...
Andreas Beham
GECCO
2009
Springer
125views Optimization» more  GECCO 2009»
14 years 6 days ago
Preserving population diversity for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
Abel Garcia-Najera
IPPS
2007
IEEE
14 years 1 months ago
Parallel Tabu Search and the Multiobjective Vehicle Routing Problem with Time Windows
Abstract—In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with Time Windows (CV...
Andreas Beham
IOR
2006
173views more  IOR 2006»
13 years 7 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
SAC
2003
ACM
14 years 26 days ago
Manpower Scheduling with Time Windows
In this paper, we propose a manpower allocation model with time windows which is of practical interest to serviceman scheduling operations. Specifically, this problem originates f...
Andrew Lim, Brian Rodrigues, Lei Song