Vehicle routing with arrival time diversification

Abstract

General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

A concise guide to existing and emerging vehicle routing problem variants

“…Zajac (2016) considers geographic dissimilarity explicitly by minimizing the intersection of the geographic units visited in different solutions. Michallet et al (2014), Hoogeboom and Dullaert (2019) and Soriano et al (2019) enforce temporal inconsistency by using time-window penalties when the arrival times of consecutive visits at the same customer do not differ by more than a given constant.…”

Mathematical models for the periodic vehicle routing problem with time windows and time spread constraints

“…They formulated the problem as an integer multi-commodity network flow problem. To the best of our knowledge, there are two studies [1,2] that consider similar PVRP to our PVRP-TWTS. In the first study of Michallet et al [1], the PVRP with arrival time dissimilarity was modeled by differing the arrival time at each customer by at least a given time spread constant over the planning periods.…”

“…They developed an iterated local search for the problem, where the infeasible solutions that violate the arrival time dissimilarity and the time window limitations are penalized with a time-dependent penalty function. Later, Hoogeboom and Dullaert [2] also studied a similar problem to the one of [1], where a specific time spread constant is defined for each customer. In [2], a rolling horizon approach is employed instead of using the periodic setting of [1].…”

“…Later, Hoogeboom and Dullaert [2] also studied a similar problem to the one of [1], where a specific time spread constant is defined for each customer. In [2], a rolling horizon approach is employed instead of using the periodic setting of [1]. According to their rolling horizon approach, arrival time slots from the previous periods are deleted from the solution region in each period, then, a VRP with multiple time windows is solved for each period.…”

“…The customers of these CIT corporations also involve supermarkets and various shopping stores in addition to the banks. Since these CIT companies transport valuable products, they must arrange their daily visits using different routes due to security reasons [1,2]. In this study, we consider the PVRP-TWTS with heterogeneous vehicles and customers with periodspecific demands, which is a novel extension of the problem.…”