IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this paper

A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints

Listed author(s):
  • Bredström, David


    (Dept. of Mathematics, Linköpings universitet)

  • Rönnqvist, Mikael


    (Dept. of Finance and Management Science, Norwegian School of Economics and Business Administration)

Registered author(s):

    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.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: no

    Paper provided by Department of Business and Management Science, Norwegian School of Economics in its series Discussion Papers with number 2007/7.

    in new window

    Length: 21 pages
    Date of creation: 13 Feb 2007
    Handle: RePEc:hhs:nhhfms:2007_007
    Contact details of provider: Postal:
    NHH, Department of Business and Management Science, Helleveien 30, N-5045 Bergen, Norway

    Phone: +47 55 95 92 93
    Fax: +47 55 95 96 50
    Web page:

    More information through EDIRC

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    in new window

    1. Freling, R. & Huisman, D. & Wagelmans, A.P.M., 2000. "Models and algorithms for Integration of Vehicle and Crew Scheduling," ERIM Report Series Research in Management ERS-2000-14-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    2. Bredström, David & Rönnqvist, Mikael, 2006. "Combined vehicle routing and scheduling with temporal precedence and synchronization constraints," Discussion Papers 2006/18, Department of Business and Management Science, Norwegian School of Economics.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:hhs:nhhfms:2007_007. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Stein Fossen)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.