The real-time time-dependent vehicle routing problem

By Huey-Kuo Chen, Che-Fu Hsueh, Mei-Shiang Chang. 2006

187 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A survey on dynamic and stochastic vehicle routing problems (2016, methodology): “VRPs applying stochastic and time-dependent travel time are presented, for example, in Fu (2002), Chen, Hsueh, and Chang (2006), Woensel et al. (2008), Nahum and Hadas (2009), Lecluyse, Van Woensel, and Peremans (2009) and Ta¸s et al. (2014).”
A Survey on the Vehicle Routing Problem and Its Variants (2012, background): “The authors [37] propose a real-time time-dependent vehicle routing problem with time windows.”
Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem (2010, background): “During opening hours, the travel speeds are always lower and variable. ll rights reserved. mon in the literature (Beasley, 1981; Chen et al., 2006; Fleischmann, Gietz, & Gnutzmann, 2004; Hill & Benton, 1992; Ichoua et al., 2003; Kuo, Wang, & Chuang, 2009; Malandraki & Dial, 1996; Malandrki &…”
Dynamic vehicle routing problems: Three decades and counting (2016, background): “Chen et al. (2006) considered a DVRP with hard time windows, in which a set of customer orders arrives randomly over time to be picked up within their time windows.”
Combinatorial optimization and Green Logistics (2010, background): “These ideas have been treated in Haghani and Jung (2005) and Chen et al. (2005). More recently, Eglese et al.”
A review of dynamic vehicle routing problems (2013, background): “[133] instances for static routing [8,9,28,29,52].”