Ozbaygin G.Ekin Karasan O.Savelsbergh M.Yaman, H.2018-04-122018-04-1220171912615http://hdl.handle.net/11693/37318We 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-covering 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. © 2017 Elsevier LtdEnglishBranch-and-priceResource-constrained shortest pathRoaming delivery locationsTrunk deliveryVehicle routingCostsFleet operationsLocationRouting algorithmsSalesVehicle routingVehiclesBranch and priceBranch-and-price algorithmsCapacitated vehiclesComputational resultsComputational studiesConstrained shortest pathTrunk deliveryVehicle Routing ProblemsInteger programmingalgorithmfreight transportspatial analysistransportation economicstravel behaviortravel timeArticle10.1016/j.trb.2017.02.003