Optimization Online


A Branch-and-Price Algorithm for the Vehicle Routing Problem with Roaming Delivery Locations

Gizem Ozbaygin(ozbaygin***at***bilkent.edu.tr)
Oya Karasan(karasan***at***bilkent.edu.tr)
Martin Savelsbergh(martin.savelsbergh***at***isye.gatech.edu)
Hande Yaman(hyaman***at***bilkent.edu.tr)

Abstract: We study the vehicle routing problem with roaming delivery locations in which the goal is to find a least-cost set of delivery routes for a fleet of capacitated vehicles and in which a customer order has to be delivered to the trunk of the customerís car during the time that the car is parked at one of the locations in the (known) customerís travel itinerary. We formulate the problem as a set-partitioning problem and develop a branch-and-price algorithm for its solution. The algorithm can also be used for solving a more general variant in which a hybrid delivery strategy is considered that allows a delivery to either a customerís home or to the trunk of the customerís car. We evaluate the effectiveness of the many algorithmic features incorporated in the algorithm in an extensive computational study and analyze the benefits of these innovative delivery strategies. The computational results show that employing the hybrid delivery strategy results in average cost savings of nearly 20% for the instances in our test set.

Keywords: Vehicle routing, trunk delivery, roaming delivery locations, branch-and-price, resource-constrained shortest path

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

Category 2: Network Optimization

Category 3: Integer Programming


Download: [PDF]

Entry Submitted: 09/03/2016
Entry Accepted: 09/04/2016
Entry Last Modified: 09/03/2016

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 Optimization Society