Optimal Path of a Single Service Unit on a Network to a “Nonemergency” Destination

Oded Berman and Mina Rasty Rahnama
Additional contact information
Oded Berman: University of Calgary, Calgary, Alberta, Canada
Mina Rasty Rahnama: University of Calgary, Calgary, Alberta, Canada

Transportation Science, 1983, vol. 17, issue 2, 218-232

Abstract: This paper focuses on the problem of finding the optimal travel path of a single service unit to nonemergency destinations. Such destinations result from events other than service calls, e.g., repositioning or relocation operations, returning from the scene of the service call to the “home location,” preventive patrol, etc. The analysis is performed on a network model of the urban environment. The time period of interest begins when the service unit starts its travel to a nonemergency destination and ends when the new call for service arrives. The paper contains two models each of which is suitable for a different application. For the two models two different algorithms are presented; one of which is a dynamic programming. These algorithms take into considerations the probabilistic nature of the demand for service. Illustrative examples are also included.

Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.17.2.218 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:17:y:1983:i:2:p:218-232

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().