Browse by author
Lookup NU author(s): Roger Bird, Sergio Grosso
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
In this paper, an improved approach to the network count location problem (NCLP) is introduced that allows the formulation of a linear programming problem to optimise locations of detectors. The general formulation also accounts for a second-best solution if existing detectors in the network are taken into account. Furthermore, the application of OD-specific weights enables the user to obtain information-maximising count locations as opposed to maximum OD coverage. These weights are calculated based on principal concepts of information theory. The approach has been implemented in a computer program that includes both options (second-best NCLP and weights). In addition, the user needs to specify the budget, i.e. the number of detectors to be placed.
Author(s): Bird RN, Ehlert E, Grosso S, Bell MGH
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Unknown
Conference Name: 36th Annual Conference, Universities’ Transport Study Group
Year of Conference: 2004
Pages: 8B1.1-10
