The Vehicle Scheduling Problem for Fleets with Alternative-Fuel Vehicles
| Autor: | Pitu B. Mirchandani, Jonathan D. Adler |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
050210 logistics & transportation
Engineering 021103 operations research Job shop scheduling business.industry Heuristic (computer science) 05 social sciences 0211 other engineering and technologies Scheduling (production processes) ComputerApplications_COMPUTERSINOTHERSYSTEMS Transportation 02 engineering and technology Fair-share scheduling Automotive engineering Alternative fuel vehicle Bus network 0502 economics and business Column generation business Civil and Structural Engineering Fleet management |
| Zdroj: | Transportation Science. 51:441-456 |
| ISSN: | 1526-5447 0041-1655 |
| DOI: | 10.1287/trsc.2015.0615 |
| Popis: | Alternative-fuel vehicles are gaining popularity as a mode of transit, and research is being done into how current infrastructure can accommodate them. The problem of vehicle scheduling consists of assigning a fleet of vehicles to service a given set of trips with start and end times. Vehicle scheduling changes when alternative-fuel vehicles are used since the vehicles can carry only a limited amount of fuel and can refuel only at fixed locations. This paper presents the alternative-fuel multiple depot vehicle scheduling problem, a modification of the standard multiple depot vehicle scheduling problem where there is a given set of fueling stations and a fuel capacity for the vehicles. The problem is formally defined and formulated as an integer program, and a branch-and-price algorithm is proposed to solve the problem. A heuristic solution is also presented, and both are tested on randomly generated data and data on the Valley Metro bus network in the Phoenix, Arizona, metropolitan area. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|