Satisficing measure approach for vehicle routing problem with time windows under uncertainty

DOI10.1016/J.EJOR.2015.07.041MaRDI QIDQ320689zbMATH OpenOpenAlexFDO

Authors V. A. Nguyen, J. Jiang, Kien Ming Ng, K. M. Teo

Publication date 7 October 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2015.07.041

zbMATH Keywords

heuristicroutingstochastic demandsatisficing measureuncertain travel time

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)

Recommendations

• The Vehicle Routing Problem with Stochastic Travel Times
• The capacitated vehicle routing problem with stochastic demands and time windows
• Vehicle routing with probabilistic capacity constraints
• Vehicle routing problem with fuzzy time windows
• Vehicle routing problem with uncertain travelling time and a heuristic algorithm

Cites work

• scientific article; zbMATH DE number 1195627 (Why is no real title available?)
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• A survey on metaheuristics for stochastic combinatorial optimization
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Convex Approximations of Chance Constrained Programs
• Designing delivery districts for the vehicle routing problem with stochastic demands
• Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm
• Lectures on Stochastic Programming
• Models and exact solutions for a class of stochastic location-routing problems
• On relations between chance constrained and penalty function problems under discrete distributions
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
• Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints
• Satisficing Measures for Analysis of Risky Positions
• Stochastic vehicle routing
• Stochastic vehicle routing with modified savings algorithm
• The Vehicle Routing Problem with Stochastic Travel Times
• The capacitated vehicle routing problem with stochastic demands and time windows
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• The robust vehicle routing problem with time windows
• Travel time reliability in vehicle routing and scheduling with time windows
• Vehicle routing problem with time windows and a limited number of vehicles.
• Vehicle routing with dynamic travel times: a queueing approach
• Vehicle routing with soft time windows and Erlang travel times

Cited in

(7)

• Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
• The secure time-dependent vehicle routing problem with uncertain demands
• An improved edge recombination algorithm for scheduling problems of drone package delivery
• A novel multi-objective green vehicle routing and scheduling model with stochastic demand, supply, and variable travel times
• Satisficing credibility for heterogeneous risks
• A stochastic single vehicle routing problem with a predefined sequence of customers and collection of two similar materials

This page was built for publication: Satisficing measure approach for vehicle routing problem with time windows under uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320689)