scientific article; zbMATH DE number 1082107
From MaRDI portal
Publication:4365134
zbMath0899.90083MaRDI QIDQ4365134
Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin
Publication date: 5 November 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
heuristicsneural networkssimulated annealingtabu searchvehicle routinggenetic algorithmstime windows
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
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, Heuristic and exact algorithms for a min-max selective vehicle routing problem, A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm, Vehicle routing problem for multiple product types, compartments, and trips with soft time windows, Ant colony optimization for the two-dimensional loading vehicle routing problem, Honey bees mating optimization algorithm for large scale vehicle routing problems, Solving the aerial fleet refueling problem using group theoretic tabu search, 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, Constraint satisfaction problems: Algorithms and applications, Hybridization of very large neighborhood search for ready-mixed concrete delivery problems, The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations, Metaheuristics in combinatorial optimization
