By Topic

Routing a Patrolling Unit in Distributed Service 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)
Wan-Lung Ng ; City Univ. of Hong Kong, Hong Kong

This paper investigates the routing problem of a patrolling unit in a distributed service network. The objective is to determine an optimal routing so that response time to service call in a distributed network can be optimized. A node-arc network is presented to model problem with nodes representing the location of clients while arcs length the travel time between nodes. Applying an analysis on the expected maximum response times on each arc to all nodes, we re-model the problem into a new node-arc network with arc lengths are measured in expected maximum response time. A mathematical model is then applied to select the best route minimizing the expected maximum response time of the whole system. The mathematical model can be easily formulated and implemented in commonly available package.

Published in:

Service Systems and Service Management, 2007 International Conference on

Date of Conference:

9-11 June 2007