Sciweavers

79 search results - page 11 / 16
» An assignment-based heuristic for vehicle routing with time ...
Sort
View
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
AIPS
2007
13 years 9 months ago
The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...
Anders Dohn, Esben Kolind, Jens Clausen
ETFA
2006
IEEE
13 years 11 months ago
An Initial Task Assignment Method for Autonomous Distributed Vehicle Systems with Finite Buffer Capacity
This paper discusses an on-line Tasks Assignment and Routing Problem(TARP) for Autonomous Transportation Systems(ATSs) in manufacturing systems. The TARP results in a constrained ...
Yusuke Morihiro, Toshiyuki Miyamoto, Sadatoshi Kum...
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
IJCAI
2007
13 years 8 months ago
Waiting and Relocation Strategies in Online Stochastic Vehicle Routing
This paper considers online stochastic multiple vehicle routing with time windows in which requests arrive dynamically and the goal is to maximize the number of serviced customers...
Russell Bent, Pascal Van Hentenryck