Evolutionary Computation for Dynamic Capacitated Arc Routing Problem

摘要: In this chapter, a new dynamic capacitated arc routing problem (CARP) is defined and investigated. Compared with the static CARP other investigated by existing researches, more general closer to reality, thus worthwhile be solved. Due stochastic factors included in CARP, objective not obtain optimal solution specific environment, but find robust that shows good performance all possible environments. For robustness measure based on repair operator defined. The corresponding designed according real-world considerations. Then, benchmark instances of are generated extending from counterparts facilitate evaluating potential approaches. After that, preliminary analysis for fitness landscape conducted experimental studies.