Vehicle dispatching with time-dependent travel times
By S. Ichoua, Michel Gendreau, Jean-Yves Potvin. European Journal of Operational Research, 2003
694 citations recorded by the source corpus.
Subfields: Automotive Engineering, Building and Construction, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/f2a9e5b50f1d53b1e513fcfab0ed21547aff898b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Automotive Engineering
- Thibaut Vidal
- Michel Gendreau
- Teodor Gabriel Crainic
- Christian Prins
- Gilbert Laporte
- Tom Van Woensel
- Piotr Matl
- Ola Jabali
In Building and Construction
- Thibaut Vidal
- Teodor Gabriel Crainic
- Piotr Matl
- Christian Prins
- Yiyo Kuo
- Gilbert Laporte
- Tom Van Woensel
- N. Dellaert
In Industrial and Manufacturing Engineering
- Thibaut Vidal
- Michel Gendreau
- Teodor Gabriel Crainic
- Christian Prins
- Gilbert Laporte
- Piotr Matl
- Tom Van Woensel
- Kris Braekers
Citations in the corpus
- Vehicle routing under time-dependent travel times: The impact of congestion avoidance (2012, background): “The only papers we are aware of are: Malandraki and Daskin (1992), Ichoua et al. (2003), Fleischmann et al. (2004), Haghani and Jung (2005), Donati et al. (2008), Van Woensel et al. (2008), and Hashimoto et al. (2008).”
- Dynamic vehicle routing problems: Three decades and counting (2016, background): “[80] presented a model based on timedependent travel speeds which satisfy the “first-in–first-out” property (this means that speeds are such that one cannot arrive earlier by departing later).”
- The vehicle routing problem: State of the art classification and review (2016, background): “The time-dependent travel times are generally modelled following the example of Ichoua et al. (2003), where the workday is partitioned into several periods and a constant travel speed is assigned to each time interval, resulting in speed being a step function of the departure time for all the arcs.”
- Heuristics for multi-attribute vehicle routing problems: A survey and synthesis (2013, methodology): “2011b), and approximate evaluations of neighbours can be performed to reduce complexity (Ichoua et al. 2003).”
- Vehicle routing problems for city logistics (2017, background): “[56], Donati et al.”
- Analysis of Travel Times and CO2 Emissions in Time‐Dependent Vehicle Routing (2012, methodology): “In this article, we adopt travel time functions similar to the ones used by Ichoua et al. (2003), and thus adhere to the FIFO assumption.”
- A concise guide to existing and emerging vehicle routing problem variants (2019, background): “As illustrated in the survey of Koç et al. (2016), research on heterogeneous VRPs is extensive but usually focused on a single period in the presence of a fixed set of customer requests.”
- The time-dependent vehicle routing problem with soft time windows and stochastic travel times (2014, positive): “For the VRPTW with time-dependent travel times, the FIFO property is satisfied by Ichoua et al. (2003) by means of modeling travel times as continuous piecewise linear functions.”
- A review of dynamic vehicle routing problems (2013, methodology): “Hvattum et al. [70] developed the Dynamic Sample Scenario Hedge Heuristic (DSHH), an approach similar to the consensus algorithm for D-VRP.”
- A unified solution framework for multi-attribute vehicle routing problems (2014, methodology): “The benchmark instances of Solomon and Desrosiers (1988) are used, along with the three travel time scenarios of Ichoua et al. (2003).”
- Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem (2010, methodology): “This kind of simulation problem was also adopted in Ichoua et al. (2003).”
- Time dependent vehicle routing problem with a multi ant colony system (2008, background): “Nevertheless in [3] the First In, First Out (FIFO) principle is introduced: if two vehicles leave from the same location for the same destination traveling on the same path, the one that leaves first will always arrive first, no matter how speed changes on the arcs during the travel.”