Sciweavers

116 search results - page 5 / 24
» Dynamic pickup and delivery problems
Sort
View
ORL
2002
92views more  ORL 2002»
13 years 7 months ago
Efficient feasibility testing for dial-a-ride problems
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specif...
Brady Hunsaker, Martin W. P. Savelsbergh
TAMC
2009
Springer
14 years 13 days ago
On the Complexity of the Multiple Stack TSP, kSTSP
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
Sophie Toulouse, Roberto Wolfler Calvo
EVOW
2009
Springer
14 years 2 months ago
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse
We consider a real-world problem arising in a warehouse for spare parts. Items ordered by customers shall be collected and for this purpose our task is to determine efficient picku...
Matthias Prandtstetter, Günther R. Raidl, Tho...
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...
COR
2008
111views more  COR 2008»
13 years 8 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song