A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem

DOI10.1080/00207721.2011.618646zbMath1307.93371OpenAlexW2080727266MaRDI QIDQ5497420

Xianshun Chen, Liang Feng, Yew-Soon Ong

Publication date: 4 February 2015

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207721.2011.618646

zbMATH Keywords

self-adaptationgene-meme co-evolutionmemeplexesrobust solution search schemeself-adaptive individual learningvehicle routing problems with stochastic demands

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Stochastic programming (90C15) Traffic problems in operations research (90B20) Stochastic systems in control theory (general) (93E03)

Related Items (5)

The piecewise optimisation method for approximating uncertain optimal control problems under optimistic value criterion ⋮ A recursive genetic framework for evolutionary decision-making in problems with high dynamism ⋮ An efficient optimum Latin hypercube sampling technique based on sequencing optimisation using simulated annealing ⋮ Global path planning of mobile robots using a memetic algorithm ⋮ A strategic conflict avoidance approach based on cooperative coevolutionary with the dynamic grouping strategy

Cites Work

• Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
• Multi-objective memetic algorithms
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
• Models and exact solutions for a class of stochastic location-routing problems
• Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• Stochastic Vehicle Routing Problem with Restocking
• Robust exponential stability criteria of uncertain stochastic systems with time-varying delays
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• The Stochastic Vehicle Routing Problem for Minimum Unmet Demand
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Robust state estimation for stochastic genetic regulatory networks
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
• Simulation optimization and correlation with multi stage Monte Carlo optimization

This page was built for publication: A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem