Dynamic scheduling of recreational rental vehicles with revenue management extensions
نویسندگان
چکیده
The Rental Fleet Scheduling Problem (RFSP) arises in vehicle rental operations that offer a wide variety of vehicle types to customers, and allow a rented vehicle to “migrate” to a setdown depot other than the pickup depot. When there is a shortage of vehicles of a particular type at a depot, vehicles may be relocated to that depot, or vehicles of similar types may be substituted. The RFSP involves assigning vehicles to rentals so as to minimise the costs of these operations, and arises in both static and on-line contexts. The authors have adapted a well-known assignment algorithm for application in the online context. In addition, a network-flow algorithm with more comprehensive coverage of problem conditions is used to investigate the determination of rental pricing using Revenue Management principles. The paper concludes with an outline of the algorithms’ use in supporting the operations of a large recreational vehicle rental company.
منابع مشابه
Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملStatic and Dynamic Order Scheduling for Recreational Rental Vehicles at Tourism Holdings Limited
Tourism Holdings Limited (THL) operates a fleet of around 4000 recreational rental vehicles of many types, based at a dozen locations in Australia and New Zealand. The allocation of vehicles to bookings is performed centrally. If demand for a particular vehicle type at a location exceeds supply, THL may substitute vehicles of similar types or relocate vehicles where they are needed. The static ...
متن کاملAn efficient Lagrangean heuristic for rental vehicle scheduling
In this article we present a heuristic based on Lagrangean relaxation for scheduling rental vehicles. The scheduling problem can be formulated as a set of large assignment problems with linking constraints. We discuss the theory behind the heuristic, including the ability to obtain lower bounds. The heuristic is based on ideas first introduced by D. Wedelin. Empirical testing shows that our heu...
متن کاملAn Adaptive Dynamic Programming Algorithm for Integer Stochastic, Dynamic Resource Allocation Problems
We consider a stochastic version of a dynamic resource allocation problem. In this setting, reusable resources must be assigned to tasks that arise randomly over time. Both resources and tasks are heterogeneous, and servicing a task generally will change the attributes of a resource. These problems arise in eet management, personnel training and assignment, and the remnant inventory problem. We...
متن کاملHeuristic Approach for Specially Structured Two Stage Flow Shop Scheduling to Minimize the Rental Cost, Processing Time, Set Up Time Are Associated with Their Probabilities Including Transportation Time and Job Weightage
The present paper is an attempt to develop a new heuristic algorithm, find the optimal sequence to minimize the utilization time of the machines and hence their rental cost for two stage specially structured flow shop scheduling under specified rental policy in which processing times and set up time are associated with their respective probabilities including transportation time. Further jo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JORS
دوره 61 شماره
صفحات -
تاریخ انتشار 2010