Vehicle routing problem with time windows having stochastic customers demands and stochastic service times: Modelling and solution

Goel, Rajeev K.; Maini, Raman; Bansal, Sandhya

doi:10.1016/j.jocs.2019.04.003

Cited by 32 publications

(19 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, [14] proposed a hybrid preventive replenishment, risk measure and distance measure recourse policy. In the existing literature about SPR for SVRP with time windows, we only find two kinds of recourse policy: the time windows violation cost [15] and the skip recourse policy [16].…”

Section: The Main Methods Used To Solving Svrpmentioning

confidence: 99%

The Stochastic and Dynamic Vehicle Routing Problem: A Literature Review

Zhang

Guo³

2021

Proceedings of 2021 Chinese Intelligent Automation Conference

View full text Add to dashboard Cite

Because of its inherent difficulties and wide actual application requirements, uncertain vehicle routing problem has attracted extensive attention recently. Unfortunately, few literature have conducted a comprehensive review on this problem. We give a review mainly from the perspective of stochastic and dynamic, and further classify them into several small categories according to the solution methods and application scenarios respectively. In this survey, we ignore the complex mathematic models and algorithms, aiming to give an intuitive understanding on structure, common methods and strategies for beginner in this field.

show abstract

Section: The Main Methods Used To Solving Svrpmentioning

confidence: 99%

The Stochastic and Dynamic Vehicle Routing Problem: A Literature Review

Zhang

Guo³

2021

Proceedings of 2021 Chinese Intelligent Automation Conference

View full text Add to dashboard Cite

show abstract

“…They also focused on the environmental factors and sustainability of the approach and presented a case study to draw insights into the last-mile delivery. (Fukasawa et al, 2006;Baldacci et al, 2012;Pan et al, 2017) and meta-heuristic algorithms (Dharmapriya et al, 2010;Azi et al, 2012;Goel et al, 2019) for the problems of such class. However, as the AHD problem can be classified in the category of vehicle routing problems with time windows, it is proven to be NP-hard (Lenstra and Kan, 1981).…”

Section: Literature Reviewmentioning

confidence: 99%

“…In this paper, we have considered three levels for each parameter. The pilot-experiment data and the range of test parameters were collected from the vastly available research discussions on ACO (Goel et al, 2019;Alobaedy et al, 2017;Wong, 2008) for the shortest path problems.…”

Section: Parameter Settingmentioning

confidence: 99%

Attended home delivery under uncertain travel and response time: a case of Indian public distribution system

Chakraborty

Bagga

Sarmah

2022

View full text Add to dashboard Cite

PurposeBeing the final end of the logistic distribution, attended home delivery (AHD) plays an important role in the distribution network. AHD typically refers to the service provided by the distribution service provider to the recipient's doorstep. Researchers have always identified AHD as a bottleneck for last-mile delivery. This paper addresses a real-life stochastic multi-objective AHD problem in the context of the Indian public distribution system (PDS).Design/methodology/approachTwo multi-objective models are proposed. Initially, the problem is formulated in a deterministic environment, and later on, it is extended to a multi-objective AHD model with stochastic travel and response time. This stochastic AHD model is used to extensively analyze the impact of stochastic travel time and customer response time on the total expected cost and time-window violation. Due to the NP-hard nature of the problem, an ant colony optimization (ACO) algorithm, tuned via response surface methodology (RSM), is proposed to solve the problem.FindingsExperimental results show that a change in travel time and response time does not significantly alter the service level of an AHD problem. However, it is strongly correlated with the planning horizon and an increase in the planning horizon reduces the time-window violation drastically. It is also observed that a relatively longer planning horizon has a lower expected cost per delivery associated.Research limitations/implicationsThe paper does not consider the uncertainty of supply from the warehouse. Also, stochastic delivery failure probabilities and randomness in customer behavior have not been taken into consideration in this study.Practical implicationsIn this paper, the role of uncertainty in an AHD problem is extensively studied through a case of the Indian PDS. The paper analyzes the role of uncertain travel time and response time over different planning horizons in an AHD system. Further, the impact of the delivery planning horizon, travel time and response time on the overall cost and service level of an AHD system is also investigated.Social implicationsThis paper investigates a unique and practical AHD problem in the context of Indian PDS. In the present context of AHD, this study is highly relevant for real-world applications and can help build a more efficient delivery system. The findings of this study will be of particular interest to the policy-makers to build a more robust PDS in India.Originality/valueThe most challenging part of an AHD problem is the requirement of the presence of customers during the time of delivery, due to which the probability of failed delivery drastically increases if the delivery deviates from the customer's preferred time slot. The paper modelled an AHD system to incorporate uncertainties to attain higher overall performance and explore the role of uncertainty in travel and response time with respect to the planning horizon in an AHD, which has not been considered by any other literature.

show abstract

“…Recourse methods are used in Errico et al (2016), Li et al (2010), Novoa et al (2006), and Zhang et al (2013). Goel et al (2019) propose a modified ant colony system to solve a vehicle routing problem with time windows having stochastic customer demands and stochastic service times.…”

Section: Literature Reviewmentioning

confidence: 99%

On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency

2021

View full text Add to dashboard Cite

Most state-of-the-art algorithms for the Vehicle Routing Problem, such as Branch-and-Price algorithms or meta heuristics, rely on a fast feasibility test for a given route. We devise the first approach to approximately check feasibility in the Stochastic Vehicle Routing Problem with time windows, where travel times are correlated and depend on the time of the day. Assuming jointly normally distributed travel times, we use a chance constraint approach to model feasibility, where two different application scenarios are considered, depending on whether missing a customer makes the rest of the route infeasible or not. The former case may arise, e.g., in drayage applications or in the pickup-and-delivery VRP. In addition, we present an adaptive sampling algorithm that is tailored for our setting and is much faster than standard sampling techniques. We use a case study for both scenarios, based on instances with realistic travel times, to illustrate that taking correlations and time dependencies into account significantly improves the quality of the solutions, i.e., the precision of the feasibility decision. In particular, the nonconsideration of correlations often leads to solutions containing infeasible routes.

show abstract

Vehicle routing problem with time windows having stochastic customers demands and stochastic service times: Modelling and solution

Cited by 32 publications

References 27 publications

The Stochastic and Dynamic Vehicle Routing Problem: A Literature Review

The Stochastic and Dynamic Vehicle Routing Problem: A Literature Review

Attended home delivery under uncertain travel and response time: a case of Indian public distribution system

On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency

Contact Info

Product

Resources

About