publication . Article . 1986

Asymmetry in some common assignment algorithms: the dispersion factor solution

T de la Barra; B Pérez;
Open Access
  • Published: 01 Jan 1986 Journal: Environment and Planning B: Planning and Design, volume 13, pages 293-304 (issn: 0265-8135, eissn: 1472-3417, Copyright policy)
  • Publisher: SAGE Publications
Many common assignment algorithms are based on Dial's original design to determine the paths that trip makers will follow from a given origin to destination centroids. The purpose of this paper is to show that the rules that have to be applied result in two unwanted properties. The first is that trips assigned from an origin centroid i to a destination j can be dramatically different to those resulting from centroid j to centroid i , even if the number of trips is the same and the network is perfectly symmetric. The second is that the number of paths that are 'accepted' by the algorithm can be surprisingly small. Asymmetry can cause numerous problems in transpor...
free text keywords: Geography, Planning and Development, General Environmental Science
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue