The optimal dispatch of Traffic and Patrol Police Service Platforms (Q1952815): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q264425 |
Created claim: Wikidata QID (P12): Q58906572, #quickstatements; #temporary_batch_1714633800427 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Ke Quan Zhao / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2012/292415 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081076633 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58906572 / rank | |||
Normal rank | |||
Revision as of 08:10, 2 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The optimal dispatch of Traffic and Patrol Police Service Platforms |
scientific article |
Statements
The optimal dispatch of Traffic and Patrol Police Service Platforms (English)
0 references
3 June 2013
0 references
Summary: 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.
0 references
single traffic congestion
0 references
longest time
0 references
