A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
Citations
800 citations
Cites background or methods from "A hybrid genetic algorithm with ada..."
...In our classification, only Cordeau and Maischberger (2012) and Vidal et al. (2013) propose a “general” algorithm that can solve multiple variants of the VRP....
[...]
...…in Cordeau and Maischberger (2012) is applicable to the classical VRP, PVRP, MDVRP and the site-dependent VRP; the genetic search algorithm in Vidal et al. (2013) can solve large scale VRPTW and extensions such as the periodic VRPTW, the multiple depot VRPTW and VRPTW with vehicle-site…...
[...]
...Time windows are defined as hard (or strict) when it is not allowed to deliver outside of the time interval (Agra et al., 2013; Vidal et al., 2013)....
[...]
...…(2013); Hu et al. (2013); Belfiore and Yoshizaki (2013); Rancourt et al. (2013); Stenger et al. (2013); Fleming et al. (2013); Tas et al. (2013); Vidal et al. (2013); Dabia et al. (2013) 18 2012 Moon et al. (2012); Pillac et al. (2012); Jin et al. (2012); Kuo et al. (2012); Zhang et al.…...
[...]
741 citations
415 citations
399 citations
Cites background or methods from "A hybrid genetic algorithm with ada..."
...According to the categorization introduced by Vidal et al. (2013a), the E-FSMFTW consists of several EVAL attributes, i.e., capacity, distance, and state of charge, as well as a single ASSIGN attribute: the vehicle type....
[...]
...However, as shown in Vidal et al. (2013b), there exists a large number of objective values and constraints that can be evaluated in O(1)....
[...]
...For the concatenation of the capacity and distance attributes – and the time attribute to some extent, – the definitions also presented in Vidal et al. (2013b) are used....
[...]
...Recently, Vidal et al. (2013b) presented a hybrid evolutionary algorithm using population management mechanisms and a generalized solution representation with modular evaluation which is able to solve a large class of VRPs, including the FSMFTW....
[...]
...As the number of neighbours is large and computationally expensive, a pruning approach as described in Vidal et al. (2013b) is used to reduce the number of neighbours considered....
[...]
372 citations
References
3,211 citations
"A hybrid genetic algorithm with ada..." refers background in this paper
...…Gendreau 2005b,a, Gendreau and Tarantilis 2010, for extensive reviews), and have been mostly evaluated and compared on standard benchmark instances introduced by Solomon (1987) and Gehring and Homberger (1999) relative to their computational efficiently and the quality of the solutions obtained....
[...]
...Each other vertex vi ∈ V\{v0}, for i ∈ {1, . . . , n}, stands for a customer to be serviced, characterized by a non-negative demand qi, a service duration τi, as well as an interval of allowable visit times [ei, li], called time window....
[...]
1,790 citations
1,282 citations
"A hybrid genetic algorithm with ada..." refers background or methods in this paper
...…recombinations (Alvarenga et al. 2007, Hashimoto et al. 2008, Labadi et al. 2008, Repoussis et al. 2009, Nagata et al. 2010); • Ruin and recreate (Pisinger and Ropke 2007, Prescott-Gagnon et al. 2009, Repoussis et al. 2009); • Ejection chains (Lim and Zhang 2007, Nagata and Bräysy 2009,…...
[...]
...Each customer vi is characterized by a frequency fi, representing the total number of services requested on the planning horizon, and a list Li of allowable visit combinations, called patterns....
[...]
...The Iterated Local Search (ILS) of Ibaraki et al. (2008), the Adaptive Large Neighbourhood Search (ALNS) of Pisinger and Ropke (2007), and the Unified Tabu Search (UTS) of Cordeau et al. (1997, 2001, 2004) are also worth mentioning....
[...]
...…compares the average and best results, as well as the average run time of HGSADC with state-of-the-art methods for each problem: • PisR: ALNS of Pisinger and Ropke (2007) • LZ: Two-phase ejections chains and iterated local search of Lim and Zhang (2007) • PDR: Branch-and-price based LNS of…...
[...]
1,103 citations
"A hybrid genetic algorithm with ada..." refers background or methods in this paper
...As illustrated by numerous reviews (Bräysy and Gendreau 2005b,a, Francis et al. 2008, Gendreau et al. 2008, Gendreau and Tarantilis 2010, for the most recent), almost every prominent meta-heuristic paradigm, including evolutionary methods, ant colony optimization, tabu search, simulated annealing,…...
[...]
...Heuristic and meta-heuristic approaches have thus been the methodology of choice (see Bräysy and Gendreau 2005b,a, Gendreau and Tarantilis 2010, for extensive reviews), and have been mostly evaluated and compared on standard benchmark instances introduced by Solomon (1987) and Gehring and…...
[...]
1,055 citations