Model of violator detector network problem: A case study sioux falls network

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 44
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorShafiq, Amberko
dc.date.accessioned2023-10-18T11:01:36Z-
dc.date.available2023-10-18T11:01:36Z-
dc.date.created2023-10-18-
dc.date.issued2016-03-
dc.identifier.citation6th International Conference on Industrial Engineering and Operations Management in Kuala Lumpur, IEOM 2016, pp.2856-
dc.identifier.urihttp://hdl.handle.net/10203/313551-
dc.description.abstractThis paper focuses on planning detector locations in a general traffic network to maximize the expected benefit to catch the violators who are threat for public safety. We install the detectors on candidate locations where peoples or vehicles flow passing on the road. Model was then solved using two approaches: Detector Add and drop greedy heuristic and Genetics Algorithm. The results show that the Genetic Algorithm outperforms detector add and drop heuristic and solution is very close to optimum in terms of the number of detectors needed to detect expected number of violators and objective function.-
dc.languageEnglish-
dc.publisherIEOM Society-
dc.titleModel of violator detector network problem: A case study sioux falls network-
dc.typeConference-
dc.identifier.scopusid2-s2.0-85018725331-
dc.type.rimsCONF-
dc.citation.beginningpage2856-
dc.citation.publicationname6th International Conference on Industrial Engineering and Operations Management in Kuala Lumpur, IEOM 2016-
dc.identifier.conferencecountryMY-
dc.identifier.conferencelocationKuala Lumpur-
Appears in Collection
RIMS Conference Papers
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0