Detection of Minimal Set of Trips Causing the Necessity to Use Extra Vehicle for Vehicle Scheduling Problem
Vehicle scheduling problem addresses the task of assigning vehicles to cover all trips in a timetable. Minimum number <i>m</i> of vehicles is determined by the number of trips in the peak hours of demand (highest density of trips). In this paper, we propose an approach to detect the mini...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
International Institute of Informatics and Cybernetics
2018-06-01
|
| Series: | Journal of Systemics, Cybernetics and Informatics |
| Subjects: | |
| Online Access: | http://www.iiisci.org/Journal/CV$/sci/pdfs/SA786SY18.pdf
|