A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows

DOI10.1016/j.endm.2016.03.043zbMath1351.90023OpenAlexW2397953062MaRDI QIDQ325476

Mohammad Hasan, M. Dambrine

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.043

zbMATH Keywords

vehicle routingbranch-and-pricehard time windowsstochastic travel times

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items

Green hybrid fleets using electric vehicles: solving the heterogeneous vehicle routing problem with multiple driving ranges and loading capacities, Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios

Uses Software

• SCIP
• VRP

Cites Work

• SCIP: solving constraint integer programs
• Travel time reliability in vehicle routing and scheduling with time windows
• Stochastic vehicle routing
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
• The Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems