Mazhar Ansari Ardeh
ABSTRACT
Uncertain Capacitated Arc Routing Problem (UCARP) is an NP-hard optimisation problem with many applications in logistics domains. Genetic Programming (GP) is capable of evolving routing policies to handle the uncertain environment of UCARP. There are many different but related UCARP domains in the real world to be solved (e.g. winter gritting and waste collection for different cities). Instead of training a routing policy for each of them, we can use the multi-task learning paradigm to improve the training effectiveness by sharing the common knowledge among the related UCARP domains. Previous studies showed that GP population for solving UCARP loses diversity during its evolution, which decreases the effectiveness of knowledge sharing. To address this issue, in this work we propose a novel multi-task GP approach that takes the uniqueness of transferable knowledge, as well as its quality, into consideration. Additionally, the transferred knowledge is utilised in a manner that improves diversity. We investigated the performance of the proposed method with several experimental studies and demonstrated that the designed knowledge transfer mechanism can significantly improve the performance of GP for solving UCARP.
- B. Al-Helali, Q. Chen, B. Xue, and M. Zhang. Multi-tree genetic programming for feature construction-based domain adaptation in symbolic regression with incomplete data. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 913--921, USA, 2020. ACM.Google Scholar
- B. Al-Helali, Q. Chen, B. Xue, and M. Zhang. A new imputation method based on genetic programming and weighted knn for symbolic regression with incomplete data. Soft Computing, 25(8):5993--6012, 2021.Google ScholarCross Ref
- R. K. Arakaki and F. L. Usberti. An efficiency-based path-scanning heuristic for the capacitated arc routing problem. Computers and Operations Research, 103:288--295, 2019.Google ScholarCross Ref
- M. A. Ardeh, Y. Mei, and M. Zhang. Genetic programming hyper-heuristic with knowledge transfer for uncertain capacitated arc routing problem. In Proceedings of the Genetic and Evolutionary Computation Conference Companion, pages 334--335. ACM, 2019.Google ScholarDigital Library
- M. A. Ardeh, Y. Mei, and M. Zhang. A novel genetic programming algorithm with knowledge transfer for uncertain capacitated arc routing problem. In Proceedings of the Pacific Rim International Conference on Artificial Intelligence, pages 196--200. Springer, 2019.Google Scholar
- M. A. Ardeh, Y. Mei, and M. Zhang. Transfer learning in genetic programming hyper-heuristic for solving uncertain capacitated arc routing problem. In Proceedings of IEEE Congress on Evolutionary Computation, pages 49--56, 2019.Google ScholarDigital Library
- M. A. Ardeh, Y. Mei, and M. Zhang. Genetic programming hyper-heuristics with probabilistic prototype tree knowledge transfer for uncertain capacitated arc routing problems. In Proceedings of IEEE Congress on Evolutionary Computation, pages 1--8, 2020.Google ScholarDigital Library
- M. A. Ardeh, Y. Mei, and M. Zhang. A GPHH with surrogate-assisted knowledge transfer for uncertain capacitated arc routing problem. In Proceedings of IEEE Symposium Series on Computational Intelligence, pages 2786--2793, 2021.Google Scholar
- K. K. Bali, Y. S. Ong, A. Gupta, and P. S. Tan. Multifactorial evolutionary algorithm with online transfer parameter estimation: MFEA-II. IEEE Transactions on Evolutionary Computation, 24(1):69--83, 2020.Google ScholarDigital Library
- T. C. Belding. The distributed genetic algorithm revisited. In Proceedings of the International Conference on Genetic Algorithms, pages 114--121. Morgan Kaufmann, 1995.Google ScholarDigital Library
- Y. Bi, B. Xue, and M. Zhang. Learning and sharing: A multitask genetic programming approach to image feature learning. arXiv, 2020. arXive ID: 2012.09444.Google Scholar
- E. K. Burke, S. Gustafson, and G. Kendall. Diversity in genetic programming: An analysis of measures and correlation with fitness. IEEE Transactions on Evolutionary Computation, 8(1):47--62, 2004.Google ScholarDigital Library
- E. K. Burke, M. R. Hyde, G. Kendall, and J. Woodward. Automatic heuristic generation with genetic programming: Evolving a jack-of-all-trades or a master of one. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 1559--1565. ACM, 2007.Google ScholarDigital Library
- B. Da, Y. S. Ong, L. Feng, A. K. Qin, A. Gupta, Z. Zhu, C. Ting, K. Tang, and X. Yao. Evolutionary multitasking for single-objective continuous optimization: Benchmark problems, performance metric, and baseline results. arXiv, 2017. arXiv ID: 1706.03470.Google Scholar
- A. De Lorenzo, A. Bartoli, M. Castelli, E. Medvet, and B. Xue. Genetic programming in the twenty-first century: a bibliometric and content-based analysis from both sides of the fence. Genetic Programming and Evolvable Machines, pages 181--204, 2019.Google ScholarDigital Library
- M. Ester, H. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, pages 226--231. AAAI, 1996.Google ScholarDigital Library
- L. Feng, Y. Huang, L. Zhou, J. Zhong, A. Gupta, K. Tang, and K. C. Tan. Explicit evolutionary multitasking for combinatorial optimization: A case study on capacitated vehicle routing problem. IEEE Transactions on Cybernetics, 2020. Google ScholarCross Ref
- L. Feng, L. Zhou, A. Gupta, J. Zhong, Z. Zhu, K. C. Tan, and K. Qin. Solving generalized vehicle routing problem with occasional drivers via evolutionary multitasking. IEEE Transactions on Cybernetics, 2019. Google ScholarCross Ref
- L. Feng, L. Zhou, J. Zhong, A. Gupta, Y. S. Ong, K. C. Tan, and A. K. Qin. Evolutionary Multitasking via Explicit Autoencoding. IEEE Transactions on Cybernetics, 49(9):3457--3470, 2019.Google ScholarCross Ref
- L. Feng, W. Zhou, W. Liu, Y. S. Ong, and K. C. Tan. Solving dynamic multiobjective problem via autoencoding evolutionary search. IEEE Transactions on Cybernetics, 2020. Google ScholarCross Ref
- B. L. Golden and R. T. Wong. Capacitated arc routing problems. Networks, 11(3):305--315.Google ScholarCross Ref
- A. Gupta, Y. S. Ong, and L. Feng. Multifactorial evolution: Toward evolutionary multitasking. IEEE Transactions on Evolutionary Computation, 20(3):343--357, 2016.Google ScholarDigital Library
- A. Gupta, Y. S. Ong, and L. Feng. Insights on transfer optimization: Because experience is the best teacher. IEEE Transactions on Emerging Topics in Computational Intelligence, 2(1):51 -- 64, 2018.Google ScholarCross Ref
- T. Hildebrandt and J. Branke. On using surrogates with genetic programming. Evolutionary Computation, 23(3):343--367, 2015.Google ScholarDigital Library
- J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, USA, 1992.Google ScholarDigital Library
- G. Li, Q. Lin, and W. Gao. Multifactorial optimization via explicit multipopulation evolutionary framework. Information Sciences, 512, 2020.Google Scholar
- J. Lin, H. Liu, K. C. Tan, and F. Gu. An effective knowledge transfer approach for multiobjective multitasking optimization. IEEE Transactions on Cybernetics, 2020. Google ScholarCross Ref
- J. Lin, H. Liu, B. Xue, M. Zhang, and F. Gu. Multi-objective multi-tasking optimization based on incremental learning. IEEE Transactions on Evolutionary Computation, 2019. Google ScholarCross Ref
- Y. Liu and Y. Mei. Automated heuristic design using genetic programming hyperheuristic for uncertain capacitated arc routing problem. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 290--297. ACM, 2017.Google ScholarDigital Library
- Y. Liu, Y. Mei, M. Zhang, and Z. Zhang. A predictive-reactive approach with genetic programming and cooperative coevolution for the uncertain capacitated arc routing problem. Evolutionary Computation, 28(2):289--316, 2019.Google ScholarDigital Library
- J. MacLachlan, Y. Mei, J. Branke, and M. Zhang. Genetic programming hyperheuristics with vehicle collaboration for uncertain capacitated arc routing problems. Evolutionary Computation, 2019. Google ScholarDigital Library
- Y. Mei, K. Tang, and X. Yao. Capacitated arc routing problem in uncertain environments. In Proceedings of IEEE Congress on Evolutionary Computation, pages 1--8, 2010.Google ScholarCross Ref
- Y. Mei and M. Zhang. Genetic programming hyper-heuristic for multi-vehicle uncertain capacitated arc routing problem. In Proceedings of the Genetic and Evolutionary Computation Conference Companion, pages 141--142. ACM, 2018.Google ScholarDigital Library
- P. Nemenyi. Distribution-free multiple comparisons. PhD thesis, Princeton University, 1963.Google Scholar
- Y. S. Ong and A. Gupta. Evolutionary multitasking: A computer science view of cognitive multitasking. Cognitive Computation, 8(2):125--142, 2016.Google ScholarCross Ref
- M. Pelikan, M. W. Hauschild, and F. G. Lobo. Estimation of distribution algorithms. In Springer Handbook of Computational Intelligence, pages 899--928. Springer, 2015.Google Scholar
- A. Petrowski. A clearing procedure as a niching method for genetic algorithms. In Proceedings of International Conference on Evolutionary Computation, pages 798--803. IEEE, 1996.Google ScholarCross Ref
- J. Wang, K. Tang, J. A. Lozano, and X. Yao. Estimation of the distribution algorithm with a stochastic local search for uncertain capacitated arc routing problems. IEEE Transactions on Evolutionary Computation, 20(1):96--109, 2016.Google ScholarDigital Library
- J. Wang, K. Tang, and X. Yao. A memetic algorithm for uncertain capacitated arc routing problems. In IEEE Workshop on Memetic Computing, pages 72--79, 2013.Google ScholarCross Ref
- S. Wang, Y. Mei, and M. Zhang. Novel ensemble genetic programming hyperheuristics for uncertain capacitated arc routing problem. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 1093--1101. ACM, 2019.Google ScholarDigital Library
- S. Wang, Y. Mei, and M. Zhang. Towards interpretable routing policy: A two stage multi-objective genetic programming approach with feature selection for uncertain capacitated arc routing problem. In IEEE Symposium Series on Computational Intelligence, pages 2399--2406, 2020.Google ScholarCross Ref
- D. Whitley, S. Rana, and R. Heckendorn. The island model genetic algorithm: On separability, population size and convergence. Journal of Computing and Information Technology, 7, 1998.Google Scholar
- S. Wøhlk. A Decade of Capacitated Arc Routing, pages 29--48. Springer US, 2008.Google Scholar
- Y. Yuan, Y. S. Ong, A. Gupta, P. S. Tan, and H. Xu. Evolutionary multitasking in permutation-based combinatorial optimization problems: Realization with TSP, QAP, LOP, and JSP. In Proceedings of IEEE Region 10 Annual International Conference, pages 3157--3164, 2017.Google Scholar
- F. Zhang, Y. Mei, S. Nguyen, K. C. Tan, and M. Zhang. Multitask genetic programming-based generative hyper-heuristics: A case study in dynamic scheduling. IEEE Transactions on Cybernetics, 2021 Google ScholarCross Ref
- F. Zhang, Y. Mei, S. Nguyen, and M. Zhang. Evolving scheduling heuristics via genetic programming with feature selection in dynamic flexible job-shop scheduling. IEEE Transactions on Cybernetics, 51(4):1797--1811, 2020.Google ScholarCross Ref
- F. Zhang, Y. Mei, S. Nguyen, and M. Zhang. Collaborative multi-fidelity based surrogate models for genetic programming in dynamic flexible job shop scheduling. IEEE Transactions on Cybernetics, 2021. Google ScholarCross Ref
- F. Zhang, Y. Mei, S. Nguyen, and M. Zhang. Correlation coefficient based recombinative guidance for genetic programming hyper-heuristics in dynamic flexible job shop scheduling. IEEE Transactions on Evolutionary Computation, 2021. Google ScholarDigital Library
- F. Zhang, Y. Mei, S. Nguyen, M. Zhang, and K. C. Tan. Surrogate-assisted evolutionary multitask genetic programming for dynamic flexible job shop scheduling. IEEE Transactions on Evolutionary Computation, 2021. Google ScholarDigital Library
- X. Zheng, A. K. Qin, M. Gong, and D. Zhou. Self-regulated evolutionary multitask optimization. IEEE Transactions on Evolutionary Computation, 24(1):16--28, 2020.Google ScholarDigital Library
- J. Zhong, L. Feng, W. Cai, and Y. S. Ong. Multifactorial genetic programming for symbolic regression problems. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2018. Google ScholarCross Ref
Index Terms
- A novel multi-task genetic programming approach to uncertain capacitated Arc routing problem
Index terms have been assigned to the content through auto-classification.
Recommendations
Two-stage multi-objective genetic programming with archive for uncertain capacitated arc routing problem
GECCO '21: Proceedings of the Genetic and Evolutionary Computation ConferenceGenetic Programming Hyper-Heuristic (GPHH) is a promising technique to automatically evolve effective routing policies to handle the uncertain environment in the Uncertain Capacitated Arc Routing Problem (UCARP). Previous studies mainly focus on the ...
Genetic programming hyper-heuristic with knowledge transfer for uncertain capacitated arc routing problem
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionThe Uncertain Capacitated Arc Routing Problem (UCARP) is an important combinatorial optimisation problem. Genetic Programming (GP) has shown effectiveness in automatically evolving routing policies to handle the uncertain environment in UCARP. However, ...
Automated heuristic design using genetic programming hyper-heuristic for uncertain capacitated arc routing problem
GECCO '17: Proceedings of the Genetic and Evolutionary Computation ConferenceUncertain Capacitated Arc Routing Problem (UCARP) is a variant of the well-known CARP. It considers a variety of stochastic factors to reflect the reality where the exact information such as the actual task demand and accessibilities of edges are ...
Comments