Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Repositioning of Two Distinguishable Service Vehicles on Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

The problem of repositioning urban emergency service vehicles on the transportation network is discussed. Repositioning problems deal with real-time movement of available servers to better anticipate short-term future requests for service. It is assumed that there are two distinguishable service units in the network and that repositioning can take place to any node of the network. The objective is to find the optimum repositioning policy that minimizes the long-term expected cost (total travel time) of operating the system.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:11 ,  Issue: 3 )