THE MAXIMUM CAPTURE PROBLEM IN A WEIGHTED NETWORK

This model considers a network of nodes (shopping facilities) which offer products to a group of potential customers. It is often assumed that customers patronize the facility which is closest to them. This assumption is justified only as long as the different facilities are comparable in their prices, convenience and other features. If these differences become non-negligible, a parameter measuring the differences, here called a weight, has to be introduced. An attraction function is defined in terms of consumer-facility distance and facility weight. The paper develops a model to optimize the location and weight of a new facility on a given network. The model is illustrated with a numerical example. (a)

  • Corporate Authors:

    University of Montreal

    Center for Research on Transportation (CRT)/CIRRELT
    P.O. Box 6128, Station Centre-ville
    Montreal, Quebec  Canada  H3C 3J7
  • Authors:
    • EISELT, H A
    • Laporte, G
  • Publication Date: 1988-6

Language

  • Undetermined

Media Info

  • Pagination: 11 p.
  • Serial:
    • Issue Number: 580

Subject/Index Terms

Filing Info

  • Accession Number: 00498566
  • Record Type: Publication
  • Source Agency: Transport and Road Research Laboratory (TRRL)
  • Files: ITRD, TRIS
  • Created Date: Sep 30 1990 12:00AM