Simulation of a large scale dynamic pickup and delivery problem

SIMUTools 2010 - 3rd International ICST Conference on Simulation Tools and Techniques

Volumn , Issue , 2010, Pages

  Hyytiä, Esa ^a   Häme, Lauri ^a   Penttinen, Aleksi ^a   Sulonen, Reijo ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Dial A ride problem; Vehicle routing

Indexed keywords

FLEET OPERATIONS; LARGE SCALE SYSTEMS; MOTOR TRANSPORTATION; PICKUPS; VEHICLE ROUTING; VEHICLES;

DIAL-A-RIDE PROBLEM; DYNAMIC VEHICLE ROUTING PROBLEMS; EXTENSIVE SIMULATIONS; LARGE-SCALE DYNAMICS; MODULAR SIMULATION; PARAMETER OPTIMIZATION; PICKUP AND DELIVERY PROBLEMS; TRANSPORTATION SYSTEM;

PROBLEM SOLVING;

EID: 84922879888     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4108/ICST.SIMUTOOLS2010.8701     Document Type: Conference Paper

References (23)

1. N. Ascheuer, S. O. Krumke, and J. Rambau. Online dial -A-ride problems: Minimizing the completion time. In STACS 2000 Lecture Notes in Computer Science, volume 1770, pages 639-650. Springer, Berlin, 2000.
2. J. Banks, J. S. C. II, B. L. Nelson, and D. M. Nicol. Discrete-Event System Simulation. Prentice-Hall International Series in Industrial and Systems Engineering. Prentice-Hall, third edition, 2001.
3. C. Bettstetter, G. Resta, and P. Santi. The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Trans. on Mobile Computing, 2(3):257-269, Jul.-Sept. 2003.
4. J.-F. Cordeau, G. Laporte, J.-Y. Potvin, and M. Savelsbergh. Transportation on demand. In Transportation, pages 429-466. Amsterdam: North-Holland, 2007a.
5. E. Feuerstein and L. Stougie. On-line single-server dial -A-ride problems. Theoretical Computer Science, 268:91-105, 2001.
6. G. Berbeglia, J.-F. Cordeau, and G. Laporte. Dynamic pickup and delivery problems. European Journal of Operational Research, 2009. In press.
7. M. Gendreau, F. Guertin, J.-Y. Potvin, and R. Séguin. Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research Part C, 14:157-174, 2006.
8. G. Ghiani, F. Guerriero, G. Laporte, and R. Musmanno. Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. European Journal of Operational Research, 151:1-11, 2003.
9. G. Ghiani, E. Manni, A. Quaranta, and C. Triki. Anticipatory algorithms for same-day courier dispatching. Transportation Research Part E, 45:96-106, 2009.
10. E. Hyytia, P. Lassila, and J. Virtamo. Spatial node distribution of the random waypoint mobility model with applications. IEEE Trans. on Mobile Computing, 5(6):680-694, June 2006.
11. A. Larsen. The dynamic vehicle routing problem. PhD thesis, Technical University of Denmark, 2000.
12. P. L'Ecuyer. Random number generation. In Handbook of Computational Statistics, chapter 2, pages 35-70. Springer-Verlag, 2004.
13. M. Lipmann, X. Lu, W. E. de Paepe, R. A. Sitters, and L. Stougie. On-line dial -A-ride problems under restricted information model. Algorithmica, 40:319-329, 2004.
14. J. D. C. Little. A proof of the queueing formula L = λW. Operations Research, (9): 383/387, 1961.
15. M. Matsumoto and T. Nishimura. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. on Modeling and Computer Simulation, 8(1), Jan. 1998.
16. S. Mitrovic-Minic, R. Krishnamurti, and G. Laporte. Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Research Part B, 38:669-685, 2004.
17. S. Mitrovic-Minic and G. Laporte. Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research Part B, 38:635-655, 2004.
18. W. Navidi and T. Camp. Stationary distributions for the random waypoint mobility model. IEEE Trans. on Mobile Computing, 3(1):99-108, Jan-Mar 2004.
19. H. Psaraftis. A dynamic programming approach to the single-vehicle, many-to-many immediate request dial -A-ride problem. Transportation Science, 14:130-154, 1980.
20. H. Psaraftis. Dynamic vehicle routing: status and prospects. Annals of Operations Research, 61, 1995.
21. M. Savelsbergh and M. Sol. DRIVE: Dynamic routing of independent vehicles. Operations Research, 46, 1998.
22. D. Sáez, C. Cortés, and A. Núñez. Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering. Computers and Operations Research, 35:3412-3438, 2008.
23. H. Waisanen, D. Shah, and M. Dahleh. A dynamic pickup and delivery problem in mobile networks under information constraints. IEEE Trans. on Automatic Control, 53:1419-143, 2008.