This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via Google Scholar Google Scholar Articles by Berman, O. Articles by Huang, R. Search for Related Content

The Minisum Multipurpose Trip Location Problem on Networks

Joseph L. Rotman School of Management, University of Toronto, 105 Saint George Street, Toronto, Ontario, Canada M5S 3E6
School of Administrative Studies, York University, Atkinson Building, 4700 Keele Street, Toronto, Ontario, Canada M3J 1P3
berman{at}rotman.utoronto.ca
rhuang{at}yorku.ca

We investigate multipurpose trip location problems on networks with two different types of facilities and three groups of customers, two of which need only one type of service, while the third group needs both types of service in a single trip. The objective is to minimize the total weighted travel distance of all trips. We prove that there exists a dominating location set for the problem on a general network, propose a general binary programming model, and analyze the properties of optimal solutions on networks with simple topologies and one facility per type. We also investigate several heuristic approaches to the problem on general networks and present extensive computational experiments.

Key Words: facility location; multipurpose trip; median; tabu search; variable neighborhood search
History: Received: February 2006; revised: September 2006; accepted: November 2006.