The Minisum Multipurpose Trip Location Problem on Networks

Oded Berman () and Rongbing Huang ()
Additional contact information
Oded Berman: Joseph L. Rotman School of Management, University of Toronto, 105 Saint George Street, Toronto, Ontario, Canada M5S 3E6
Rongbing Huang: School of Administrative Studies, York University, Atkinson Building, 4700 Keele Street, Toronto, Ontario, Canada M3J 1P3

Transportation Science, 2007, vol. 41, issue 4, 500-515

Abstract: 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.

Keywords: facility location; multipurpose trip; median; tabu search; variable neighborhood search (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1060.0186 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:41:y:2007:i:4:p:500-515

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().