The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates

Cattaruzza, Diego; Absi, Nabil; Feillet, Dominique

doi:10.1287/trsc.2015.0608

Cited by 109 publications

(63 citation statements)

References 32 publications

(21 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…To the best of our knowledge, Cattaruzza et al (2013Cattaruzza et al ( , 2014Cattaruzza et al ( , 2016 are the first ones to investigate a VRP-rd and extend it to a VRP with time windows and release dates (VRPTW-rd) in which each of the identical capacitated vehicles can conduct multiple trips. The delivery of goods should start within the time window specified.…”

Section: Vehicle Routing Problem With Release Datesmentioning

confidence: 99%

“…Furthermore, each vehicle has to return to the depot before the end of the time horizon. The objective is to minimize the total time traveled in Cattaruzza et al (2013), and to minimize the total distance traveled in Cattaruzza et al (2014Cattaruzza et al ( , 2016. Archetti et al (2015a) examine the complexity of a VRP-rd when the graph describing the locations of the depot and the customers has a special structure, either a star or a line.…”

Section: Vehicle Routing Problem With Release Datesmentioning

confidence: 99%

“…Our formulated problem differs from the above mentioned studies in the following ways. First, a fleet of heterogeneous vehicles is used instead of a single or an unlimited number of uncapacitated vehicles in Archetti et al (2015a), or a homogeneous capacitated fleet in Cattaruzza et al (2013Cattaruzza et al ( , 2014Cattaruzza et al ( , 2016, Archetti et al (2015b) and Liu et al (2017). In reality, a company often owns vehicles with different capacity restrictions and cost structures.…”

Section: Vehicle Routing Problem With Release Datesmentioning

confidence: 99%

See 2 more Smart Citations

Integration of order picking and vehicle routing in a B2C e-commerce context

et al. 2017

View full text Add to dashboard Cite

E-commerce sales are increasing every year and customers who buy goods on the Internet have high service level expectations. In order to meet these expectations, a company's logistics operations need to be performed carefully. Optimizing only internal warehouse processes will often lead to suboptimal solutions. The interrelationship between the order picking process and the delivery process should not be ignored. Therefore, in this study, an order picking problem and a vehicle routing problem with time windows and release dates are solved simultaneously using a single optimization framework. To the best of our knowledge, it is the first time that an order picking problem and a vehicle routing problem are integrated. A mixed integer linear programming formulation for this integrated order picking-vehicle routing problem (OP-VRP) is provided. The integrated OP-VRP is solved for small instances and the results are compared to these of an uncoordinated approach. Computational experiments show that integration can lead to cost savings of 14% on average. Furthermore, higher service levels can be offered by allowing customers to request their orders later and still get delivered within the same time windows.

show abstract

Section: Vehicle Routing Problem With Release Datesmentioning

confidence: 99%

Section: Vehicle Routing Problem With Release Datesmentioning

confidence: 99%

Section: Vehicle Routing Problem With Release Datesmentioning

confidence: 99%

See 1 more Smart Citation

Integration of order picking and vehicle routing in a B2C e-commerce context

et al. 2017

View full text Add to dashboard Cite

show abstract

“…The closest dispatch-related problem found in the literature to the DDWP is perhaps the VRP with release dates (VRP-rd) [7,16] that considers a deterministic problem with a depot dispatching orders with previously known release dates. A release date specifies the earliest time when the order can be picked up at the depot before it is transported to its customer's location.…”

Section: Vehicle Routing and Dispatch Problemsmentioning

confidence: 99%

“…The authors provide polynomial time algorithms for the cases in which requests are placed over the line and other simplified topologies. In [16], the authors study an extension of the VRP-rd in a general network topology that incorporates service time windows, capacity constraints and a homogeneous fleet of capacitated vehicles. The authors provide heuristic solutions based on genetic algorithms combined with local search procedures.…”

Section: Vehicle Routing and Dispatch Problemsmentioning

confidence: 99%

The One-Dimensional Dynamic Dispatch Waves Problem

Klapp

Erera

Toriello

2018

Transportation Science

View full text Add to dashboard Cite

We study same-day delivery (SDD) systems by formulating the Dynamic Dispatch Waves Problem (DDWP), which models a depot where delivery requests arrive dynamically throughout a service day. At any dispatch epoch (wave), the information available to the decision maker is (1) a set of known, open requests which remain unfulfilled, and (2) a set of potential requests that may arrive later in the service day. At each wave, the decision maker decides whether or not to dispatch a vehicle, and if so, which subset of open requests to serve, with the objective of minimizing expected vehicle operating costs and penalties for unserved requests. We consider the DDWP with a single delivery vehicle and request destinations on a line, where vehicle operating times and costs depend only on the distance between points. We propose an efficient dynamic programming approach for the deterministic variant, and leverage it to design an optimal a priori policy with predetermined routes for the stochastic case. We then show that fully dynamic policies may perform arbitrarily better than a priori ones, and propose heuristics and dual bounds for this case.One enhancement to customer service in this sector is same-day delivery (SDD). Several e-retailers and logistics service providers have introduced programs in major US cities; see Table 1. We define SDD as a distribution service where consumers place orders on the same day that they should be delivered. For companies that implement SDD, it is imperative to both offer high levels of customer service and keep logistics costs as low as possible.Providing SDD services requires two core logistics processes: (1) order management at the stocking location, including receiving, picking, and packing orders; and (2) order distribution from the stocking location to delivery locations. To date, two classes of service providers have deployed SDD services: retailers offering items primarily from owned stocks (in distribution centers or retail stores) such as Amazon and Walmart, and logistics providers serving as intermediaries that pick up packages from stocking locations and deliver them to customers, such as Google and Instacart as well as USPS, FedEx and UPS. Retailers must manage both core logistics processes, while logistics providers are typically concerned with the second one. This research effort is a study of primary tradeoffs in SDD distribution. We formulate the Dynamic Dispatch Waves Problem (DDWP) as a Markov Decision Process (MDP). The DDWP models the dynamics of a single dispatch facility (depot) where customer order requests arrive dynamically throughout an operating day. At any decision epoch, which we call a wave, the logistics operator maintains a set of known open requests with known delivery destinations and a set of potential requests that may arrive before the end of the day. At each wave, the operator decides whether or not to dispatch vehicles loaded with known orders, and the vehicle routes for dispatched orders. The objective is to minimize expected operational costs and expect...

show abstract

Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies

Schubert

Kühn

Holzapfel

2020

Naval Research Logistics

View full text Add to dashboard Cite

Currently, the most common delivery mode offered in online retailing is next‐day delivery. Retailers, however, are investigating whether same‐day deliveries can be offered to online and store customers in order to meet increasing customer requirements. The present paper considers an integrated order picking and vehicle routing problem assuming same‐day delivery in the field of omnichannel retailing. Within this context the paper focuses on the picking and delivery process for large durable consumer goods, for example, consumer electronics and home appliances with the option of associated installation services at the customer's home as well as store deliveries for click‐and‐collect customers and the short‐term replenishment of store inventory. We develop a decision support model and a general variable neighborhood search‐based algorithm that tackle the problem described by considering the tradeoff between picking and delivery costs while ensuring customers' delivery time windows. The results show the benefits of an integrated solution approach amounting to approx. 13% total cost savings on average, compared to a sequential approach typically applied in retail practice. A case study from an internationally operating omnichannel retailer demonstrates the advantages and applicability of the modeling and solution approach suggested.

show abstract

The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates

Cited by 109 publications

References 32 publications

Integration of order picking and vehicle routing in a B2C e-commerce context

Integration of order picking and vehicle routing in a B2C e-commerce context

The One-Dimensional Dynamic Dispatch Waves Problem

Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies

Contact Info

Product

Resources

About