TABU SEARCH ALGORITHMS FOR THE (R/XP)-MEDIANOID AND (R/P)-CENTROID PROBLEMS

The (r/Xp)-medianoid and (r/p)-centroid problems are two well-known competitive location problems on networks. In the medianoid problem, a player locates r facilities in a network in order to maximize its market share, given that p facilities are already located. In the centroid problem, two players in turn locate p and r facilities at the vertices of a network in order to maximize their market share. The problem is for the first player to find a set of locations that will minimize the second player's maximal market share. These problems are both NP-hard. They are solved by means of tabu search heuristics. Computational results confirm the value of the proposed approach. (A)

  • Corporate Authors:

    CENTRE DE RECHERCHE SUR LES TRANSPORTS. UNIVERSITE DE MONTREAL

    C.P. 6128, SUCCURSALE A
    MONTREAL, QUEBEC  Canada  H3C 3J7
  • Authors:
    • BENATI, S
    • Laporte, G
  • Publication Date: 1994-3

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00726418
  • Record Type: Publication
  • Source Agency: Transportation Association of Canada (TAC)
  • Files: ITRD
  • Created Date: Oct 28 1996 12:00AM