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

DOI10.1080/00207721.2011.618646MaRDI QIDQ5497420zbMATH OpenOpenAlexFDO

Authors Xianshun Chen, Liang Feng, Y. S. Ong

Publication date 4 February 2015

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

zbMATH Keywords

gene-meme co-evolutionmemeplexesrobust solution search schemeself-adaptationself-adaptive individual learningvehicle routing problems with stochastic demands

Mathematics Subject Classification ID

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

Recommendations

• Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• scientific article; zbMATH DE number 5685007
• Advanced particle swarm optimization for the vehicle routing problem with stochastic demands

Cites work

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

Cited in

(7)

• 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
• The piecewise optimisation method for approximating uncertain optimal control problems under optimistic value criterion
• Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands

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

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