A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem
In this article, we proposed a self-adaptive memeplex robust search (SAMRS) for finding robust and reliable solutions that are less sensitive to stochastic behaviours of customer demands and have low probability of route failures, respectively, in vehicle routing problem with stochastic demands (VRP...
Main Authors: | Chen, Xianshun, Feng, Liang, Ong, Yew Soon |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/101715 http://hdl.handle.net/10220/17038 |
Similar Items
-
A conceptual modeling of meme complexes in stochastic search
by: Chen, Xianshun, et al.
Published: (2013) -
A study on memetic computation, with applications to capacitated vehicle routing problems
by: Chen, Xianshun
Published: (2014) -
Stochastic vehicle routing on SUMO
by: Sun, Ayong
Published: (2015) -
Tabu search for vehicle routing problem with stochastic demands /
by: Irhamah, 1978-, author, et al.
Published: (2007) -
Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search
by: Ismail, Zuhaimy, et al.
Published: (2008)