Journal of Applied Mathematics

Journal of Applied Mathematics / 2012 / Article
Special Issue

Variational Inequalities and Vector Optimization

View this Special Issue

Research Article | Open Access

Volume 2012 |Article ID 292415 | 9 pages | https://doi.org/10.1155/2012/292415

The Optimal Dispatch of Traffic and Patrol Police Service Platforms

Academic Editor: Jian-Wen Peng
Received21 Sep 2012
Accepted07 Nov 2012
Published06 Dec 2012

Abstract

The main goal of this paper is to present a minmax programming model for the optimal dispatch of Traffic and Patrol Police Service Platforms with single traffic congestion. The objective is to minimize the longest time of the dispatch for Traffic and Patrol Police Service Platforms. Some numerical experiments are carried out, and the optimal project is given.

1. Introduction

Traffic and Patrol Police Service Platforms (in short, TPPSP) in the city have been playing an important role in dealing with emergency and traffic administration. The national college mathematical modeling contest of China in 2011 proposed the problem related to the optimal dispatch of TPPSP. However, only the case without any traffic congestion is considered for the problem. It is well known that the optimal dispatch and design of TPPSP is very complicated and it is affected by many real factors, such as (i)the influence of traffic congestion on the optimal dispatch; (ii)the influence of police resources allocation for each platform; (iii) the influence of the uncertainty of road weights.

The shortest path between any two nodes in urban traffic network is usually solved by Floyd shortest path algorithm in traffic computing and path search. Also the shortest path algorithms are widely applied to computer science, operational research, geographic information systems and traffic guidance, navigation systems, and so forth [15]. Especially, given a detailed GIS mapping and image display program, Liao and Zhong [4] proved that the Floyd shortest path algorithm can quickly and easily retrieve the shortest path between two locations, saving computing time and overhead.

The minmax programming model has received more attentions in operations research and optimization fields in the literatures [69]. Averbakh and Berman [8] considered the location minmax -TSP problem, where only optimal locations of the servers must be found, without the corresponding tours and without the optimal value of the objective function. Exact linear time algorithms for the cases and are presented.

In recent years, the research on optimal dispatch of TPPSP has also received some attentions in the literatures [1012]. However, we noted that these works only focused on the case without any traffic congestion for the optimal dispatch of TPPSP.

In this paper, we first consider the optimal dispatch with single traffic congestion when the emergent event and establish a minmax programming model (model II) which objective is to minimize the longest time of the dispatch for TPPSP. Furthermore, some numerical experiments are carried out, and the optimal project is presented.

2. Notations

: The number of the TPPSP: The number of intersections that should be blockaded: The shortest distance from the th TPPSP to the th intersection without traffic congestion: The shortest time from the th TPPSP to the th intersection: The speed of police vehicles: The th TPPSP is dispatched to the th intersection or not.

Assume that every TPPSP has almost the same police force, TPPSP have been settled at some traffic centers and key parts of an urban area of a city. The average of the police car is 60 km/h.

3. Mathematical Models

In this section, we first introduce a minimax programming model for the optimal dispatch of TPPSP without any traffic congestion in the literatures. Then, we present our main model for the optimal dispatch of TPPSP with single traffic congestion.

3.1. The Case without Any Traffic Congestion

When the road section has no traffic congestion, some authors presented the following minimax programming model, which is also a 0-1 integer programming model, see literatures [10, 12], and so forth.

(model I)

The objective function (3.1) requires that the maximum time from the th TPPSP to the th node which is minimum. Besides, constraint (3.2) requires that every intersection should be blockaded by only one TPPSP. Constraint (3.3) ensures that one TPPSP can only blockade one intersection. Constraint (3.4) requires that is 0-1 variable. Constraint (3.5) shows that the relation between the time and the distance from the th TPPSP to the th intersection. Furthermore, in Constraint (3.5), the unite of is minutes, is meters per second and the symbol (the unite is millimeters) is the distance of map, (the unite is meters) is the real distance.

3.2. The Case with Single Traffic Congestion

In the real life, traffic congestion may occur in urban traffic network. Therefore, the research on the optimal dispatch of TPPSP with Traffic congestions is important and meaningful. Considering that the emergency may occur at any time and place, and the road section may have some traffic congestions, in this subsection, we present one minmax programming model for the optimal dispatch of TPPSP with single traffic congestion. The optimal dispatch of TPPSP with Traffic congestions model is more effective than model I. Moreover, the optimal dispatch of TPPSP with Traffic congestions model's results has immediate practical applications.

We assume that the traffic congestion occurs on the road section from the node to the node , where the node is adjacent to the node . And denotes the average time of blocking. Besides, denotes the shortest distance from the TPPSP to the th intersection without the road section from the node to the node , denotes the shortest path from the th TPPSP to the th node. denotes the set of which go through and nodes. denotes the shortest time from the th TPPSP to the th intersection without traffic congestion, and denotes the shortest time from the th TPPSP to the th intersection without the road section from the node to the node .

We establish the following minmax programming model II for the dispatch of TPPSP with single traffic congestion:

(model II) where

The objective function (3.6) requires that the maximum times from the th TPPSP to the th node which is minimum. The analysis of constraints (3.6)–(3.9) is the same as constraints (3.2)–(3.4). However, the value of is different from the time of the model I. In the model II, the function of is divided into three segments.

4. Numerical Experiments

In this paper, we take , , where to do specific analysis for our model. The data is based on (http://www.mcm.edu.cn/). We use Floyd Shortest Path Algorithm to figure out and by Matlab software. We can obtain the dispatch project of TPPSP without any traffic congestion when the emergent event happens in the city as Table 1.


Dispatching projectPath of choosing projectTime from the ith TPPSP to the jth intersection

1–38 1-69-70-2-40-39-38 5.880900
2–16 2-40-39-38-16 7.388100
4–48 4-57-58-59-51-50-5-47-48 7.395900
7–29 7-30-29 8.015500
9–30 9-34-33-32-7-30 3.492300
10–12 10-26-27-12 7.586600
11–22 11-22 3.269600
12–23 12-25-24-13-23 6.477000
13–24 13-24 2.385400
14–21 14-21 3.265000
15–28 15-28 4.751800
16–14 16-14 6.741700
20–62 20-85-62 6.448900

Considering the case with single traffic congestion for the optimal dispatch of TPPSP in urban traffic network, we do the numerical experiments for the minmax programming model II by using Matlab software. Here, we take , , min. The dispatching project of TPPSP with one road section having single traffic congestion when the emergent event happens is shown in Table 2.


Dispatching projectPath of choosing projectTime from the ith TPPSP to the jth intersection

1–38 1-69-70-2-40-39-38 5.880900
2–16 2-40-39-38-16 7.388100
4–48 4-57-58-59-51-50-5-47-48 7.395900
5–30 5-47-48-30 3.182900
7–29 7-30-29 8.015500
10–12 10-26-27-12 7.586600
11–24 11-25-24 3.805300
12–22 12-25-24-13-22 6.882500
13–23 13-23 0.500000
14–21 14-21 3.265000
15–28 15-28 4.751800
16–14 16-14 6.741700
18–62 18-80-79-19-77-76-64-63-4-62 6.734400

From Tables 1 and 2, we can clearly see that the maximum time of the optimal dispatch for TPPSP is the same for the case without any traffic congestion and the case with single traffic congestion in the given urban traffic network. However, the optimal dispatch project of TPPSP is different each other. Consequently, this shows that traffic congestion between the nodes in urban traffic network system will influence the optimal dispatch project of TPPSP in a certain degree when the emergent event happens.

From Tables 2, 3, 4, and 5, we can gain the different dispatch project when the time of a traffic congestions is different. We can know the traffic congestion can influence the dispatching project. The influence degree is different when the time of a traffic congestion is different. However, for the node and node , the maximum time from the TPPSP to the intersection is 8.015500 min when the time of a traffic congestion is different.


Dispatching projectPath of choosing projectTime from the ith TPPSP to the jth intersection

1–38 1-69-70-2-40-39-38 5.880900
2–16 2-40-39-38-16 7.388100
5–62 5-50-51-59-58-57-60-62 5.255100
6–48 6-47-48 2.506400
7–29 7-30-29 8.015500
8–30 8-33-32-7-30 3.060800
10–12 10-26-27-12 7.586600
11–23 11-22-13-23 4.675100
12–22 12-25-24-13-22 6.882500
13–24 13-24 2.385400
14–21 14-21 3.265000
15–28 15-28 4.751800
16–14 16-14 6.741700


Dispatching projectPath of choosing projectTime from the ith TPPSP to the jth intersection

1–62 1-75-76-64-63-4-62 4.885200
2–16 2-40-39-38-16 7.388100
6–30 6-47-48-30 3.213500
7–29 7-30-29 8.015500
8–48 8-47-48 3.099500
9–38 9-35-36-39-38 4.725700
10–22 10-26-11-22 7.707900
11–23 11-22-13-23 4.675100
12–12 12-12 0.000000
13–24 13-24 2.385400
14–21 14-21 3.265000
15–28 15-28 4.751800
16–14 16-14 6.741700


Dispatching project Path of choosing project Time from the ith TPPSP to the jth intersection

2–16 2-40-39-38-16 7.388100
4–48 4-57-58-59-51-50-5-47-48 7.395900
7–29 7-30-29 8.015500
9–30 9-34-33-32-7-30 3.492300
10–22 10-26-11-22 7.707900
11–24 11-25-24 3.805300
12–23 12-25-24-13-23 6.477000
13–12 13-24-25-12 5.977000
14–21 14-21 3.265000
15–28 15-28 4.751800
16–14 16-14 6.741700
19–38 19-79-78-1-69-70-2-40-39-38 7.639300
20–62 20-85-62 6.448900

In order to avoid the data that we use may be too special, we further take , . Still take , , and or 10 or 30 or 60 min, respectively, the dispatching project about the TPPSP with one road section having a traffic congestion when the emergent event happens as Table 6, where means blocking time, means dispatching project, means path of choosing project, and means time from the th TPPSP to the th intersection.


5 min10 min30 min60 min

1→381→38 1→38 3→48
4→48 5→48 2→16 7→28
5→16 7→28 4→48 8→30
6→62 9→14 7→28 10→24
7→28 10→12 9→14 11→21
9→14 11→21 10→22 12→21
10→22 12→22 11→12 13→22
11→23 13→24 12→24 14→23
12→24 14→23 13→23 15→29
13→12 15→29 14→21 16→14
14→21 16→30 15→29 17→16
15→29 17→16 16→30 19→38
16→30 20→62 20→62 20→62

1-69-70-2-40-39-38 1-69-70-2-40-39-38 1-69-70-2-40-39-38 3-55-54-53-49-5-47-48
4-57-58-59-51-50-5-47-48 5-47-48 2-40-39-38-16 7-15-28
5-47-8-9-35-36-16 7-15-28 4-57-58-59-51-50-5-47-48 8-47-48-30
6-59-58-57-60-62 9-35-36-16-14 7-15-28 10-26-11-25-24
7-15-28 10-26-27-12 9-35-36-16-14 11-22-21
9-35-36-16-14 11-22-21 10-26-11-22 12-12
10-26-11-22 12-25-24-13-22 11-25-12 13-22
11-22-13-23 13-24 12-25-24 14-21-22-13-23
12-25-24 14-21-22-13-23 13-23 15-28-29
13-24-25-12 15-28-29 14-21 16-14
14-21 16-36-35-9-8-47-48-30 15-28-29 17-40-39-38-16
15-28-29 17-40-39-38-16 16-36-35-9-8-47-48-30 19-79-78-1-69-70-2-40-39-38
16-36-37-7-30 20-85-62 20-85-62 20-85-62

5.880900 5.880900 5.880900 8.197900
7.395900 2.475800 7.388100 8.570200
6.228000 8.570200 7.395900 3.806600
5.337300 8.274200 8.570200 8.243600
8.570200 7.586600 8.274200 5.072300
8.274200 5.072300 7.707900 0.000000
7.7079006.882500 3.791400 0.905540
4.675100 2.385400 3.591600 6.473300
3.591600 6.473300 0.500000 5.700500
5.977000 5.700500 3.265000 6.741700
3.265000 6.498900 5.700500 8.161600
5.700500 8.161600 6.498900 7.639300
5.583100 6.448900 6.448900 6.448900

In Table 6, where , , we can also gain the different dispatching project when the time of a traffic congestion is different. However, the maximum time from the TPPSP to the intersection is 8.570200 min when the time of a traffic congestion is different.

Road section with having a traffic congestion is different, the maximum time from the TPPSP to the intersection is different. The influence degree of the time of a traffic congestion is not too large to the maximum time from the TPPSP to the intersection, but is large to the dispatching project.

5. Concluding Remarks

In this paper, we present a minmax programming models for the optimal dispatch of TPPSP with single traffic congestion. Some numerical experiments are carried out by using Matlab software and the optimal dispatch projects are given. However, in this paper, we only consider the case with single traffic congestion in model II. Hence, it is possible and meaningful to study the optimal dispatch project of TPPSP with several traffic congestions. This will be the future topics that we study.

Acknowledgments

This work is partially supported by the National Natural Science Foundation of China (Grants 71131006, 71172197, 11171363, 11271391, 11001289), Central University Fund of Sichuan University under Grant no. skgt201202, the Special Fund of Chongqing Key Laboratory (CSTC, 2011KLORSE02), the Natural Science Foundation Project of Chongqing (Grant CSTS2012jjA00002), and the Education Committee Research Foundation of Chongqing (Grant KJ110625).

References

  1. T. Dudás and R. Rudolf, “Spanning trees and shortest paths in monge graphs,” Computing, vol. 60, no. 2, pp. 109–119, 1998. View at: Publisher Site | Google Scholar | Zentralblatt MATH
  2. S. Bistarelli, U. Montanari, and F. Rossi, “Soft constraint logic programming and generalized shortest path problems,” Journal of Heuristics, vol. 8, no. 1, pp. 25–41, 2002. View at: Publisher Site | Google Scholar | Zentralblatt MATH
  3. B. Huang, W. M. Wu, and Y. N. Zheng, “The research and improvement of path optimization in vehicle navigation,” Advances in Intelligent and Soft Computing, vol. 129, pp. 203–207, 2012. View at: Google Scholar
  4. Y. M. Liao and J. Zhong, “FLOYD Algorithm Based on the Shortest Path in GIS,” Communications in Computerand Information Science, vol. 267, no. 4, pp. 574–579, 2012. View at: Publisher Site | Google Scholar
  5. H. X. Li, Q. J. Xu, and D. Q. Zhang, “An efficient constrained shortest path algorithm for traffic navigation,” Advanced Materials Research, vol. 356–360, pp. 2880–2885, 2012. View at: Google Scholar
  6. K. Fan, “Minimax theorems,” Proceedings of the National Academy of Sciences of the United States of America, vol. 39, pp. 42–47, 1953. View at: Publisher Site | Google Scholar | Zentralblatt MATH
  7. G. Mosheiov and M. Shadmon, “Minmax earliness-tardiness costs with unit processing time jobs,” European Journal of Operational Research, vol. 130, no. 3, pp. 638–652, 2001. View at: Publisher Site | Google Scholar | Zentralblatt MATH
  8. I. Averbakh and O. Berman, “Minmax p-traveling salesmen location problems on a tree,” Annals of Operations Research, vol. 110, no. 1–4, pp. 55–68, 2002. View at: Publisher Site | Google Scholar
  9. G. Mosheiov and D. Oron, “Minmax scheduling with job-classes and earliness-tardiness costs,” European Journal of Operational Research, vol. 177, no. 1, pp. 612–622, 2007. View at: Publisher Site | Google Scholar | Zentralblatt MATH
  10. J. X. Yu, D. C. Song, X. Y. Zhao, and J. Q. Li, “Research on the reasonable dispatch of service platform of trafficand patrol police,” Science Technology and Engineering, vol. 12, pp. 126–128, 2012. View at: Google Scholar
  11. S. L. Fu, L. Fang, C. L. Wang, and X. W. Yang, “The establishment and scheduling of traffic and patrol police service platform,” Journal of Logistical Engineering Universtiy, vol. 28, pp. 79–84, 2012. View at: Google Scholar
  12. X. Wei, X. X. Dong, and D. Tang, “The setting and dispatch model of the traffic and cruising police platform,” Mathematical Modeling and Its Applications, vol. 1, pp. 73–76, 2012. View at: Google Scholar

Copyright © 2012 Ke Quan Zhao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

764 Views | 457 Downloads | 0 Citations
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19.