Optimization Online


A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions

Z. Akca (zelihaakca***at***lehigh.edu)
R.T. Berger (rosemary.berger***at***verizon.net)
T.K. Ralphs (ted***at***lehigh.edu)

Abstract: We investigate the problem of simultaneously determining the location of facilities and the design of vehicle routes to serve customer demands under vehicle and facility capacity restrictions. We present a set-partitioning-based formulation of the problem and study the relationship between his formulation and the graph-based formulations that have been used in previous studies of this problem. We describe a branch-and-price algorithm based on the set-partitioning formulation and discuss computational experience with both exact and heuristic variants of this algorithm.

Keywords: Branch and price, Column Generation, Vehicle routing, Integer programming

Category 1: Applications -- OR and Management Sciences (Transportation )

Category 2: Integer Programming ((Mixed) Integer Linear Programming )

Category 3: Combinatorial Optimization (Other )

Citation: COR@L Laboratory Technical Report, Lehigh University

Download: [PDF]

Entry Submitted: 06/24/2008
Entry Accepted: 06/24/2008
Entry Last Modified: 09/18/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society