scientific article; zbMATH DE number 1749224

zbMath1076.90549MaRDI QIDQ4532227

Gilbert Laporte, Frédéric Semet

Publication date: 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (40)

A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain ⋮ The multi-depot vehicle routing problem with inter-depot routes ⋮ A hybrid algorithm for a class of vehicle routing problems ⋮ Managing platelet supply through improved routing of blood collection vehicles ⋮ A unified exact method for solving different classes of vehicle routing problems ⋮ A general heuristic for vehicle routing problems ⋮ Designing delivery districts for the vehicle routing problem with stochastic demands ⋮ An efficient variable neighborhood search heuristic for very large scale vehicle routing problems ⋮ Active-guided evolution strategies for large-scale capacitated vehicle routing problems ⋮ DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic ⋮ A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes ⋮ The close-open mixed vehicle routing problem ⋮ Integer linear programming models for a cement delivery problem ⋮ Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem ⋮ The vehicle routing problem with coupled time windows ⋮ A general vehicle routing problem ⋮ A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm ⋮ A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem ⋮ An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts ⋮ A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads ⋮ Vehicle selection for a multi-compartment vehicle routing problem ⋮ Combinatorial optimization and green logistics ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows ⋮ Exact algorithms for routing problems under vehicle capacity constraints ⋮ Sequential search and its application to vehicle-routing problems ⋮ On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm ⋮ Combinatorial optimization and green logistics ⋮ A guided local search procedure for the multi-compartment capacitated arc routing problem ⋮ A cooperative parallel meta-heuristic for the vehicle routing problem with time windows ⋮ An exact solution framework for a broad class of vehicle routing problems ⋮ Enhanced savings calculation and its applications for solving capacitated vehicle routing problem ⋮ Approximation algorithms for the load-balanced capacitated vehicle routing problem ⋮ The school bus routing problem: a review ⋮ Heuristic algorithms for the multi-depot ring-star problem ⋮ A tabu search heuristic for the truck and trailer routing problem ⋮ A new ILP-based refinement heuristic for vehicle routing problems ⋮ The mobile production vehicle routing problem: using 3D printing in last mile distribution ⋮ A location-or-routing problem with partial and decaying coverage ⋮ A matheuristic for the truck and trailer routing problem ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

This page was built for publication: