The vehicle routing problem with time windows and evidential service and travel times: a recourse model

DOI10.1007/978-3-030-86772-0_28OpenAlexW3200934186MaRDI QIDQ2146039

Tekwa Tedjini, Sohaib Afifi, Frédéric Pichon, Éric Lefèvre

Publication date: 15 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86772-0_28

zbMATH Keywords

vehicle routingtime windowsmemetic algorithmbelief functionrecourse

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (2)

On modelling and solving the shortest path problem with evidential weights ⋮ Optimization problems with evidential linear objective

Cites Work

• Unnamed Item
• A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times
• Vehicle routing problem with stochastic travel times including soft time windows and service costs
• The robust vehicle routing problem with time windows
• The capacitated vehicle routing problem with evidential demands
• Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
• The robust vehicle routing problem with time windows: solution by branch and price and cut
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Formulations and exact algorithms for the vehicle routing problem with time windows
• Ensuring service levels in routing problems with time windows and stochastic travel times
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A memetic algorithm for the vehicle routing problem with time windows
• A Gentle Introduction to Memetic Algorithms

This page was built for publication: The vehicle routing problem with time windows and evidential service and travel times: a recourse model