A NEW APPROACH TO NETWORK GENERATION AND MAP REPRESENTATION: THE LINEAR CASE OF THE LOCATION ALLOCATION PROBLEM

THIS STUDY WAS UNDERTAKEN IN PART WITHIN THE FRAMEWORK OF THE "NODE-NETWORK INTERDEPENDENCIES" PROJECT. THE GOALS OF THE PROJECT WERE TO EXAMINE VARIOUS STRATEGIES RELATING TO THE INTERRELATIONSHIPS BETWEEN THE SPATIAL STRUCTURE OF TRANSPORTATION NETWORKS OF THE OTHER HAND AND THE DISTRIBUTION OF POPULATION AND HUMAN ACTIVITIES ON THE OTHER. FIVE OTHER PAPERS HAVE CONSIDERED VARIOUS ASPECTS OF THIS FUNDAMENTAL PROBLEM. THE FOLLOWING PROBLEM IS POSED AND SOLVED HEURISTICALLY: FOR ANY GIVEN SET OF NODES, FIND THE SET OF LINE SEGMENTS WHICH MINIMIZES THE SUM ORTHOGONAL DISTANCES FROM EACH POINT TO ITS NEAREST LINE SEGMENT. AN EMPERICAL APPLICATION IS PRESENTED. PROBLEMS OF INTERPRETATION ARE DISCUSSED AND SUGGESTIONS FOR IMPROVING THE PROCEDURE INTRODUCED. /AUTHOR/

  • Supplemental Notes:
    • Res Rept No 3, 23 PP, 7 FIG, 1 TAB
  • Corporate Authors:

    University of Toronto

    Department of Geography, 100 St George Street
    Toronto, Ontario  Canada  M5S 3G3

    YORK UNIVERSIT, TORONTO

    TORONTO, ON  Canada 
  • Authors:
    • Mackinnon, R D
    • Barber, G M
  • Publication Date: 0

Subject/Index Terms

Filing Info

  • Accession Number: 00228143
  • Record Type: Publication
  • Files: TRIS
  • Created Date: May 1 1972 12:00AM