The optimal dispatch of Traffic and Patrol Police Service Platforms
type: Item
instance of: scholarly article
title: The optimal dispatch of Traffic and Patrol Police Service Platforms
zbMATH Open document ID: 1271.90109
DOI: 10.1155/2012/292415
author: Li Luo
author: Yuanmei Xia
author: Kequan Zhao
published in: Journal of Applied Mathematics
publication date: 2013-06-03T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 6169882
zbMATH Keywords: single traffic congestion
zbMATH Keywords: longest time
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2012/292415
OpenAlex ID: W2081076633
Wikidata QID: Q58906572
cites work: Spanning trees and shortest paths in Monge graphs
cites work: Soft constraint logic programming and generalized shortest path problems
cites work: Q5547717
cites work: Minmax earliness-tardiness costs with unit processing time jobs
cites work: Minmax \(p\)-traveling salesmen location problems on a tree
cites work: Minmax scheduling with job-classes and earliness-tardiness costs
description: scientific article; zbMATH DE number 6169882