Publication:4365134
From MaRDI portal
zbMath0899.90083MaRDI QIDQ4365134
Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin
Publication date: 5 November 1998
heuristics; neural networks; simulated annealing; tabu search; vehicle routing; genetic algorithms; time windows
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations, Metaheuristics in combinatorial optimization, Delivery strategies for blood products supplies, A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows, A goal programming approach to vehicle routing problems with soft time windows, Ant colony optimization for the two-dimensional loading vehicle routing problem, Hybridization of very large neighborhood search for ready-mixed concrete delivery problems, Solving the aerial fleet refueling problem using group theoretic tabu search, Constraint satisfaction problems: Algorithms and applications, A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm, A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem, Creating very large scale neighborhoods out of smaller ones by compounding moves
