Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
On-line single-server dial-a-ride problems
Theoretical Computer Science
Drive: Dynamic Routing of Independent Vehicles
Operations Research
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Spatial Node Distribution of the Random Waypoint Mobility Model with Applications
IEEE Transactions on Mobile Computing
Stationary Distributions for the Random Waypoint Mobility Model
IEEE Transactions on Mobile Computing
Congestive collapse and its avoidance in a dynamic dial-a-ride system with time windows
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Hi-index | 0.00 |
We study a variant of dynamic vehicle routing problem with pickups and deliveries where a vehicle is allocated to each service (i.e., trip) request immediately upon the arrival of the request. Solutions to this problem can be characterized as dynamic policies that define how each customer is handled by operating a fleet of vehicles. Evaluation of such policies is beyond the grasp of analytical studies and requires extensive simulations. We present an efficient and modular simulation tool developed for studying the performance of a large scale system with different policies under given trip arrival process. Numerical and analytical observations on the model are utilized to provide guidelines for solving the routing problem efficiently, and to support the validation of the simulation results. Application of the developed framework is demonstrated by several numerical examples, e.g., policy parameter optimization, which all give insight on the viability of this type of transportation system.