Optimization Online


Modeling and Solving Location Routing and Scheduling Problems

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

Abstract: This paper studies location routing and scheduling problems, a class of problems in which the decisions of facility location, vehicle routing, and route assignment are optimized simultaneously. For a version with capacity and time restrictions, two formulations are presented, one graph-based and one set-partitioning-based. For the set-partitioning-based formulation, valid inequalities are identified and their effectiveness is demonstrated empirically. Two versions of a branch-and-price algorithm are described and the results of computational experiments for instances with 25 and 40 customers are discussed.

Keywords: Vehicle Routing, Branch and Price, Integer Programming, Column Generation

Category 1: Applications -- OR and Management Sciences (Production and Logistics )

Category 2: Integer Programming (0-1 Programming )

Category 3: Network Optimization

Citation: Technical Report, COR@L Laboratory, Department of Industrial and Systems Engineering, Lehigh University.

Download: [PDF]

Entry Submitted: 10/13/2008
Entry Accepted: 10/14/2008
Entry Last Modified: 10/13/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