A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times

DOI10.1007/S11750-011-0188-6zbMath1258.90015OpenAlexW2029570945MaRDI QIDQ1935881

Gilbert Laporte, Hongtao Lei, Bo Guo

Publication date: 20 February 2013

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-011-0188-6

zbMATH Keywords

stochastic vehicle routinggeneralized variable neighborhood searchroute durationstochastic service time

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Stochastic scheduling theory in operations research (90B36)

Related Items (9)

A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times ⋮ A maritime inventory routing problem with stochastic sailing and port times ⋮ A 2-stage method for a field service routing problem with stochastic travel and service times ⋮ A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations ⋮ Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures ⋮ A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs ⋮ Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function ⋮ A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping ⋮ Self-imposed time windows in vehicle routing problems

Uses Software

• VRP

Cites Work

• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Variable neighbourhood search: methods and applications
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• On the solutions of stochastic traveling salesman problems
• Variable neighborhood search
• A variable neighbourhood search algorithm for the open vehicle routing problem
• Sequential search and its application to vehicle-routing problems
• A metaheuristic to solve a location-routing problem with nonlinear costs
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Parallel Variable Neighborhood Search
• Generalized Dynamic Programming for Stochastic Combinatorial Optimization
• A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
• Technical Note—Analysis of a Preference Order Traveling Salesman Problem
• The Vehicle Routing Problem with Stochastic Travel Times
• Variable neighborhood search for the p-median
• Using constraint-based operators to solve the vehicle routing problem with time windows

This page was built for publication: A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times