Location-Routing Problems with Distance Constraints

Rosemary T. Berger (), Collette R. Coullard () and Mark S. Daskin ()
Additional contact information
Rosemary T. Berger: Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015
Collette R. Coullard: School of Mathematics and Computer Science, Lake Superior State University, Sault Sainte Marie, Michigan 49783
Mark S. Daskin: Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208

Transportation Science, 2007, vol. 41, issue 1, 29-43

Abstract: An important aspect of designing a distribution system is determining the locations of the facilities. For systems in which deliveries are made along multiple stop routes, the routing problem and location problem must be considered simultaneously. In this paper, a set-partitioning-based formulation of an uncapacitated location-routing model with distance constraints is presented. An alternate set of constraints is identified that significantly reduces the total number of constraints and dramatically improves the linear programming relaxation bound. A branch and price algorithm is developed to solve instances of the model. The algorithm provides optimal solutions in reasonable computation time for problems involving as many as 10 candidate facilities and 100 customers with various distance constraints.

Keywords: location routing; column generation; branch and price (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (20)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1060.0156 (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:1:p:29-43

Access Statistics for this article

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