A Branch and Price Algorithm for the Combined Vehicle Routing and Scheduling Problem With Synchronization Constraints

22 Pages Posted: 28 Mar 2007

See all articles by David Bredstrom

David Bredstrom

Linkoping University - Department of Mathematics

M. Rönnqvist

Norwegian School of Economics (NHH) - Department of Finance

Date Written: February 13, 2007

Abstract

In this paper we present a branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. The synchronization constraints are used to model situations when two or more customers need simultaneous service. The synchronization constraints impose a temporal dependency between vehicles, and it follows that a classical decomposition of the vehicle routing and scheduling problem is not directly applicable. With our algorithm, we have solved 44 problems to optimality from the 60 problems used for numerical experiments. The algorithm performs time window branching, and the number of subproblem calls is kept low by adjustment of the columns service times.

Keywords: Routing, Scheduling, Synchronization, Branch and Price

Suggested Citation

Bredstrom, David and Ronnqvist, Mikael, A Branch and Price Algorithm for the Combined Vehicle Routing and Scheduling Problem With Synchronization Constraints (February 13, 2007). NHH Dept. of Finance & Management Science Discussion Paper No. 2007/7. Available at SSRN: https://ssrn.com/abstract=971726 or http://dx.doi.org/10.2139/ssrn.971726

David Bredstrom

Linkoping University - Department of Mathematics ( email )

Linkoping, SE-581 83
Sweden

Mikael Ronnqvist (Contact Author)

Norwegian School of Economics (NHH) - Department of Finance ( email )

Helleveien 30
N-5045 Bergen
Norway

Register to save articles to
your library

Register

Paper statistics

Downloads
370
Abstract Views
1,406
rank
79,745
PlumX Metrics