A guide to vehicle routing heuristics
From MaRDI portal
Publication:4656651
DOI10.1057/PALGRAVE/JORS/2601319zbMath1099.90506OpenAlexW4255086775MaRDI QIDQ4656651
Jean-Yves Potvin, Michel Gendreau, Gilbert Laporte, Jean-François Cordeau, Frédéric Semet
Publication date: 14 March 2005
Full work available at URL: https://doi.org/10.1057/palgrave/jors/2601319
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (74)
A survey of variants and extensions of the location-routing problem ⋮ Simulated annealing heuristic for the general share-a-ride problem ⋮ The multi-depot vehicle routing problem with inter-depot routes ⋮ Applying the attribute based hill climber heuristic to the vehicle routing problem ⋮ A hybrid algorithm for a class of vehicle routing problems ⋮ A goal programming approach to vehicle routing problems with soft time windows ⋮ A vehicle routing problem with flexible time windows ⋮ Managing platelet supply through improved routing of blood collection vehicles ⋮ An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem ⋮ An iterated tabu search for the multi-compartment vehicle routing problem ⋮ An efficient implementation of a static move descriptor-based local search heuristic ⋮ A large neighbourhood based heuristic for two-echelon routing problems ⋮ An efficient variable neighborhood search heuristic for very large scale vehicle routing problems ⋮ A multi-space sampling heuristic for the vehicle routing problem with stochastic demands ⋮ Active-guided evolution strategies for large-scale capacitated vehicle routing problems ⋮ The secure time-dependent vehicle routing problem with uncertain demands ⋮ The consistent vehicle routing problem with heterogeneous fleet ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ The close-open mixed vehicle routing problem ⋮ A tabu search algorithm to solve a green logistics bi-objective bi-level problem ⋮ A sequential GRASP for the therapist routing and scheduling problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Designing e‐commerce supply chains: a stochastic facility–location approach ⋮ A light‐touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique ⋮ The Combined Vehicle Routing and Foldable Container Scheduling Problem: A Model Formulation and Tabu Search Based Solution Approaches ⋮ The vehicle routing problem with time windows and flexible delivery locations ⋮ A survey of the standard location-routing problem ⋮ MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems ⋮ Optimised crossover genetic algorithm for capacitated vehicle routing problem ⋮ A unified matheuristic for solving multi-constrained traveling salesman problems with profits ⋮ D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. ⋮ Comparing backhauling strategies in vehicle routing using ant colony optimization ⋮ A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries ⋮ A threshold accepting approach to the Open Vehicle Routing problem ⋮ Vehicle routing with compartments: applications, modelling and heuristics ⋮ A heuristic algorithm based on multi-assignment procedures for nurse scheduling ⋮ Solution strategies for the vehicle routing problem with backhauls ⋮ Real-time split-delivery pickup and delivery time window problems with transfers ⋮ A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm ⋮ Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery ⋮ Staff assignment with lexicographically ordered acceptance levels ⋮ Applying an Intensification Strategy on Vehicle Routing Problem ⋮ EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem ⋮ Vehicle routing problem for multiple product types, compartments, and trips with soft time windows ⋮ Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles ⋮ A hybrid method based on linear programming and tabu search for routing of logging trucks ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches ⋮ Solving the truck and trailer routing problem based on a simulated annealing heuristic ⋮ Gossip algorithms for heterogeneous multi-vehicle routing problems ⋮ An adaptive large neighborhood search heuristic for the pollution-routing problem ⋮ Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints ⋮ Very large-scale vehicle routing: new test problems, algorithms, and results ⋮ Sequential search and its application to vehicle-routing problems ⋮ Solving the vehicle routing problem with adaptive memory programming methodology ⋮ A cooperative parallel meta-heuristic for the vehicle routing problem with time windows ⋮ Joint vehicle assembly‐routing problems: An integrated modeling and optimization approach ⋮ Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints ⋮ Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem ⋮ Edge assembly-based memetic algorithm for the capacitated vehicle routing problem ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows ⋮ A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows ⋮ Distribution of waiting time for dynamic pickup and delivery problems ⋮ Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths ⋮ Facility location decisions for drone delivery with riding: a literature review ⋮ MIP-based solution approaches for multi-site resource-constrained project scheduling ⋮ A simulated annealing heuristic for the capacitated green vehicle routing problem ⋮ A local search heuristic for the pre- and end-haulage of intermodal container terminals ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues ⋮ An infeasible space exploring matheuristic for the production routing problem ⋮ A tabu search heuristic for the truck and trailer routing problem ⋮ Fast local search algorithms for the handicapped persons transportation problem ⋮ A review of design and control of automated guided vehicle systems ⋮ Metaheuristics in combinatorial optimization
This page was built for publication: A guide to vehicle routing heuristics
