Citation: | LIU Peng, XIONG Guang-ming, LI Yong, JIANG Yan, GONG Jian-wei. Multi-objective route planning approach for timely searching tasks of a supervised robot[J].JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2014, 23(4): 481-489. |
[1] |
Cummings M L, How J P. The impact of human-automation collaboration in decentralized multiple unmanned vehicle control[J]. Proceedings of the IEEE, 2012, 100(3): 660-671.
|
[2] |
Krishnan P S, Johnny Koh Siaw Paw, Tiong Sieh Kiong. Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm[C]// 4th International Conference on Autonomous Robots and Agents, Piscataway, NJ, USA, 2009:267-272.
|
[3] |
Tang Jian, Shi Wenzhong, Meng Lingkui. Time-dependent dynamic vehicle routing based on genetic algorithm [J]. Wuhan Daxue Xuebao, 2008, 33(8): 875-879. (in Chinese)
|
[4] |
Altiparmak F, Gen M, Lin L, et al. A genetic algorithm approach for multi-objective optimization of supply chain networks [J]. Computers & Industrial Engineering, 2006, 51(1): 196-215.
|
[5] |
Zhao Xin, Gilles G, Rémy D. A genetic approach to solving the vehicle routing problem with time-dependent travel times[C]// Mediterranean Conference on Control and Automation - Conference Proceedings. Piscataway, NJ, United States, 2008: 413-418.
|
[6] |
Miller J, Sunil K, Menard T. Intelligent transportation systems traveling salesman problem (ITS-TSP)-a specialized TSP with dynamic edge weights and intermediate cities[C]//13th International IEEE Conference on Intelligent Transportation Systems, Piscataway, NJ, USA, 2010: 992-997.
|
[7] |
Abdullah K, David W C, Alice E S. Multi-objective optimization using genetic algorithms: a tutorial [J]. Reliability Engineering & System Safety, 2006, 91(9): 992-1007.
|
[8] |
Yadlapalli S, Malik W A, Darbha S, et al. A Lagrangian-based algorithm for a Multiple Depot, Multiple Traveling Salesmen Problem [J]. Nonlinear Analysis: Real World Applications, 2009, 10(4): 1990-1999.
|
[9] |
Oscar C, Leonardo T, Melin P. Multiple objective genetic algorithms for path-planning optimization in autonomous mobile robots [J]. Soft Computing, 2007, 11(3):269-279.
|
[10] |
Zitzler E, Thiele L. Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach[J]. IEEE Transactions on Evolutionary Computation, 1999, 3(4):257-271.
|
[11] |
Shi Liangshuan, Li Zengyan. An improved pareto genetic algorithm for multi-objective TSP[C]// Fifth International Conference on Natural Computation, Piscataway, NJ, USA, 2009: 585-588.
|
[12] |
Faigl J. On the performance of self-organizing maps for the non-Euclidean Traveling Salesman Problem in the polygonal domain [J]. Information Sciences, 2011, 181(19): 4214-4229.
|
[13] |
Schaffer J D. Multiple objective optimization with vector evaluated genetic algorithms[C]// Genetic algorithms and their applications. Proceedings of the first international conference on genetic algorithms, Mahwah, NJ, USA, 1985: 93-100.
|
[14] |
Murata T, Ishibuchi H, Tanaka H. Multi-objective genetic algorithm and its applications to flowshop scheduling [J]. Computers and Industrial Engineering, 1996, 30(4): 957-968.
|