| ²é¿´: 921 | »Ø¸´: 2 | |||
bear1984ľ³æ (ÖøÃûдÊÖ)
|
[ÇóÖú]
°ïæ¿´¿´Õâ¸öÒâ¼ûÊÇʲôÒâ˼£¿ÐèÒªÒýÓÃËùÁеÄÎÄÕÂÂð£¿
|
|
Ò»¸öºÜÒ»°ãµÄSCI£¬¾ÍÒ»¸öÉó¸åÈË£¬Éó¸åÒâ¼ûСÐÞ£¬±à¼¸øµÄ´óÐÞ£¬ÆäÖÐ×îºóÁ½ÌõÒâ¼û£¬Éó¸åÈËÁÐÁËN¶àÎÄÏ×£º For further discussions on these issues, see the following papers: [C] J. -Y. Lin and Y. -P. Chen, Analysis on the Collaboration Between Global Search and Local Search in Memetic Computation, IEEE Trans. on Evolutionary Computation, vol. 15, no. 5, pp. 608-623, October 2011. [D] H. Ishibuchi, Y. Hitotsuyanagi, Y. Wakamatsu, and Y. Nojima, How to choose solutions for local search in multiobjective combinatorial memetic algorithms, Proc. of 11th International Conference on Parallel Problem Solving from Nature (PPSN 2010), pp. 516-525. [E] H. Ishibuchi, T. Yoshida, and T. Murata, Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling, IEEE Trans. on Evolutionary Computation, vol. 7, no. 2, pp. 204-223, April 2003. Hybrid MOEA: Studies on the hybridization of MOEA with local search dates back to the 1990s. The following early studies are well-known and frequently cited: * H-MOEA with Pareto Dominance Relation-Based Local Search (as in this paper) [F] J. D. Knowles and D. W. Corne, M-PAES: A memetic algorithm for multiobjective optimization, Proc. of 2000 Congress on Evolutionary Computation (CEC 2000), pp. 325 - 332. * H-MOEA with Scalarizing Function-Based Local Search [G] H. Ishibuchi and T. Murata, Multi-objective genetic local search algorithm, Proc. of 1996 IEEE International Conference on Evolutionary Computation (ICEC 1996), pp. 119-124. [H] H. Ishibuchi and T. Murata, A multi-objective genetic local search algorithm and its application to flowshop scheduling, IEEE Trans. on Systems, Man, and Cybernetics - Part C: Applications and Reviews, vol. 28, no. 3, pp. 392-403, August 1998. [I] A. Jaszkiewicz, Genetic local search for multi-objective combinatorial optimization, European Journal of Operational Research, vol. 137, no. 1, pp. 50-71, February 2002. [J] A. Jaszkiewicz, On the performance of multiple-objective genetic local search on the 0/1 knapsack problem-A comparative experiment, IEEE Trans. on Evolutionary Computation, vol. 6, no. 4, pp. 402-412, August 2002. ÁÐÁ˺öàÏà¹ØµÄÎÄÏ×£¬É¶Òâ˼°¡£¿ÐèÒª°ÑÕâЩÒýÓõ½ÎÒµÄÎÄÕÂÀïÂ𣿠|
» ²ÂÄãϲ»¶
304Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
²ÄÁϹ¤³Ìר˶µ÷¼Á
ÒѾÓÐ6È˻ظ´
Ò»Ö¾Ô¸Ìì´ó²ÄÁÏÓ뻯¹¤£¨085600£©×Ü·Ö338
ÒѾÓÐ4È˻ظ´
085700×ÊÔ´Óë»·¾³308Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
Çó²ÄÁϵ÷¼Á
ÒѾÓÐ8È˻ظ´
294Çóµ÷¼Á²ÄÁÏÓ뻯¹¤×¨Ë¶
ÒѾÓÐ5È˻ظ´
Ò»Ö¾Ô¸»ªÖпƼ¼´óѧ£¬080502£¬354·ÖÇóµ÷¼Á
ÒѾÓÐ4È˻ظ´
Ò»Ö¾Ô¸¼ªÁÖ´óѧ²ÄÁÏѧ˶321Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
085410È˹¤ÖÇÄÜר˶317Çóµ÷¼Á£¨0854¶¼¿ÉÒÔ£©
ÒѾÓÐ3È˻ظ´
330Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
» ±¾Ö÷ÌâÏà¹Ø¼ÛÖµÌùÍÆ¼ö£¬¶ÔÄúͬÑùÓаïÖú:
ͶÁËһƪСÎÄÕ£¬Éó¸åÒâ¼ûÓÐÒ»Ìõ£¬´ó¼Ò°ïæ¿´¿´Ê²Ã´Òâ˼°¡
ÒѾÓÐ7È˻ظ´
Çë°ïæ¿´¿´ÕâÌõÉó¸åÒâ¼ûÊÇʲôÒâ˼
ÒѾÓÐ4È˻ظ´
°ïæ¿´¿´Õâ¸öÉó¸åÒâ¼ûÊÇʲôÒâ˼
ÒѾÓÐ4È˻ظ´
Òâ¼û·µ»Ø£¬Âé·³´ó¼Ò°ïæ¿´¿´ÕâÊÇʲôÒâ˼£¬»¹ÓÐÏ£ÍûÂð
ÒѾÓÐ9È˻ظ´
´ó¼Ò°ïæ¿´¿´Éó¸åÒâ¼ûÖÐÕâ¾ä»°ÊÇʲôÒâ˼£¿
ÒѾÓÐ2È˻ظ´
´ó¼Ò°ïæ¿´¿´Éó¸åÒâ¼ûÖÐÕâ¾ä»°ÊÇʲôÒâ˼£¿
ÒѾÓÐ8È˻ظ´
°ïæ¿´¿´Õâ¸öÒâ¼ûÊÇʲôÒâ˼°¡
ÒѾÓÐ8È˻ظ´
ÆÀÉóÈ˵ÄÒ»ÌõÒâ¼û¿´²»¶®£¬Çë´ó¼Ò°ïæ¿´¿´ÊÇʲôÒâ˼°¡
ÒѾÓÐ5È˻ظ´
TalantaÎÄÕ±»¾Ü£¬µ«Çë¸÷λ°ïÎÒ¿´¿´ÕâÑùµÄÉó¸åÒâ¼ûÊÇʲôÒâ˼
ÒѾÓÐ15È˻ظ´
¼±£¬°ïæ¿´¿´Õâ¸öÉó¸åÈ˵ÄÕæÊµÒâ˼ÊÇʲô
ÒѾÓÐ6È˻ظ´
ÀÏÍâµÄÒâ¼û£¬´ó¼Ò°ïæ¿´¿´£¡Ê²Ã´Òâ˼°¡£¬ÎÒ²»ÖªµÀÔõô¸Ä°¡£¿
ÒѾÓÐ3È˻ظ´
ÎÄÕÂproof£¬Çë´ó¼Ò°ïæ¿´¿´ÕâÊÇʲôÒâ˼
ÒѾÓÐ5È˻ظ´
seapass
ÖÁ×ðľ³æ (Ö°Òµ×÷¼Ò)
³¬¸ç
- SEPI: 18
- Ó¦Öú: 772 (²©ºó)
- ¹ó±ö: 3.074
- ½ð±Ò: 16568.4
- É¢½ð: 5496
- ºì»¨: 82
- ɳ·¢: 10
- Ìû×Ó: 3728
- ÔÚÏß: 930.8Сʱ
- ³æºÅ: 441856
- ×¢²á: 2007-10-27
- ÐÔ±ð: GG
- רҵ: º£Ñó»·¾³¿ÆÑ§

2Â¥2011-11-01 14:53:33
lgsppq
ľ³æ (ÕýʽдÊÖ)
- Ó¦Öú: 23 (СѧÉú)
- ½ð±Ò: 1862
- É¢½ð: 218
- ºì»¨: 5
- Ìû×Ó: 354
- ÔÚÏß: 399.7Сʱ
- ³æºÅ: 563436
- ×¢²á: 2008-05-25
- רҵ: ¼ÆËã»úÍøÂç
3Â¥2011-11-01 15:22:51













»Ø¸´´ËÂ¥