Location-Routing Problems with Distance Constraints

Authors:
Rosemary T. Berger;Collette R. Coullard;Mark S. Daskin
Affiliations:
Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015;School of Mathematics and Computer Science, Lake Superior State University, Sault Sainte Marie, Michigan 49783;Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208
Venue:
Transportation Science
Year:
2007

Citing 10
Cited 4

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
The location-routing problem: considerations in physical distribution system design

Computers and Operations Research
A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Solving airline crew scheduling problems by branch-and-cut

Management Science
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Drive: Dynamic Routing of Independent Vehicles

Operations Research
2-Path Cuts for the Vehicle Routing Problem with Time Windows

Transportation Science
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

Networks
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3

INFORMS Journal on Computing

Heuristic for lane reservation problem in time constrained transportation

CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
The Stochastic Multiperiod Location Transportation Problem

Transportation Science
Primal-dual schema and lagrangian relaxation for the k-location-routing problem

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Approximation results for a min-max location-routing problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

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.