ÒÅ´«Ëã·¨¼°ÆäÔÚÍøÂç¼Æ»®ÖеÄÓ¦ÓÃ_ͨÐŹ¤³ÌרҵÂÛÎÄ
·¢²¼Ê±¼ä£º
2015-01-24
À´Ô´£º
ÈË´ó¾¼ÃÂÛ̳
ͨÐŹ¤³ÌרҵÂÛÎÄ
Ŀ ¼
Õª Òª I
Abstract II
1 Êý¾ÝÍÚ¾ò¼¼Êõ 1
1£®1 Êý¾ÝÍÚ¾òµÄÌá³ö 1
1£®2 Êý¾ÝÍÚ¾òÑо¿µÄÒâÒå 1
1£®3 Êý¾ÝÍÚ¾ò¶¨Òå 2
1£®3£®1 ¼¼ÊõÉϵĶ¨Òå 2
1£®3£®2 ÉÌÒµÉϵĶ¨Òå 2
1£®4 Êý¾ÝÍÚ¾ò³£Óü¼Êõ 3
1£®4£®1 ÒÅ´«Ëã·¨ 3
1£®4£®2 È˹¤Éñ¾ÍøÂç 3
1£®4£®3 ¾ö²ßÊ÷ 4
1£®4£®4 ½üÁÚËã·¨ 5
1£®4£®5 ¹æÔòÍƵ¼ 5
1£®5 Êý¾ÝÍÚ¾òÁ÷³Ì 5
1£®5£®1 Êý¾ÝÍÚ¾ò»·¾³ 5
1£®5£®2 Êý¾ÝÍÚ¾ò¹ý³Ì 6
1£®5£®3 Êý¾ÝÍÚ¾ò¹ý³Ì¹¤×÷Á¿ 6
1£®5£®4 Êý¾ÝÍÚ¾òÁ÷³Ì½éÉÜ 7
2 ÒÅ´«Ëã·¨ 9
2£®1 ÒÅ´«Ëã·¨µÄÓÉÀ´ 9
2£®1£®1 ÒýÑÔ 9
2£®1£®2 ÉúÎï½ø»¯ 10
2£®2 »ù±¾ÒÅ´«Ëã·¨ 11
2£®2£®1 ÒÅ´«Ëã·¨µÄ·¢Õ¹ÀúÊ· 11
2£®2£®2 ÒÅ´«Ëã·¨»ù±¾ÊõÓï 12
2£®2£®3 ÒÅ´«Ëã·¨µÄ»ù±¾Ë¼Ïë 13
2£®2£®4 ÒÅ´«Ëã·¨µÄ»ù±¾²Ù×÷ 14
2£®3 ÒÅ´«Ëã·¨µÄÌصã 16
2£®3£®1 ÒÅ´«Ëã·¨ÓëÆäËûËÑË÷·½·¨µÄ±È½Ï 16
2£®3£®2 ÒÅ´«Ëã·¨µÄÌصã 18
2£®4 ±ê×¼ÒÅ´«Ëã·¨µÄ¸Ä½ø 19
2£®4£®1 ÒÅ´«Ëã·¨ÖдæÔÚµÄÎÊÌâ 19
2£®4£®2 ¸Ä½øµÄÒÅ´«Ëã·¨·ÖÀà 19
2£®4£®3 ¸Ä½øµÄÒÅ´«Ëã·¨ 20
3 ÍøÂç¼Æ»®¼¼Êõ¼ò½é 22
3£®1 ÍøÂç¼Æ»®¼¼ÊõµÄ»ù±¾¸ÅÄî 22
3£®2 ÍøÂç¼Æ»®¼¼ÊõµÄ²úÉú 22
3£®3 ÍøÂç¼Æ»®¼¼ÊõµÄ·¢Õ¹ 23
3£®4 ÍøÂç¼Æ»®µÄÓŵã 24
3£®5 ÍøÂç¼Æ»®ÖеÄÎÊÌâ 25
4 ÒÅ´«Ëã·¨ÔÚÍøÂç¼Æ»®ÖеÄÓ¦Óà 26
4£®1 CPMÎÊÌâ¸ÅÊö 26
4£®2 Çó½âDCPMÎÊÌâµÄGAʵÏÖ 28
4£®2£®1 ÒÅ´«±àÂë 28
4£®2£®2 É趨¿ØÖƲÎÊý£¬³õʼÖÖȺ 28
4£®2£®3 ¹¹ÔìÊÊÓ¦¶Èº¯Êý 28
4£®2£®4 Ñ¡Ôñ»úÖÆ 28
4£®2£®5 ÒÅ´«Ëã×ÓÉè¼Æ 29
4£®3 ÓÃGAÇó½âDCPMÎÊÌâµÄ²½Öè 29
4£®4 ÒÅ´«Ëã·¨Çó½âDCPMÎÊÌâµÄÓ¦ÓÃʵÀý 30
5 ½áÊøÓï 32
5£®1 Ö÷ÒªµÄÑо¿¹¤×÷ 32
5£®2 ½«GAÒýÈëÍøÂç¼Æ»®ÖеÄÒâÒå 32
5£®3 ²»×ãÓëÕ¹Íû 32
Ö л 34
²Î ¿¼ ÎÄ Ï× 35
Õª Òª
ÒÅ´«Ëã·¨(Genetic Algorithm¡ªGA)ÊÇÒ»ÖÖÄ£Äâ×ÔÈ»½çÉúÎï½ø»¯µÄËÑË÷Ëã·¨£¬ÓÉÓÚËüµÄ¼òµ¥Ò×ÐС¢Â³°ôÐÔÇ¿,ÓÈÆäÊÇÆä²»ÐèҪרÃŵÄÁìÓò֪ʶ¶ø½öÓÃÊÊÓ¦¶Èº¯Êý×÷ÆÀ¼ÛÀ´Ö¸µ¼ËÑË÷¹ý³Ì£¬´Ó¶øʹËüµÄÓ¦Ó÷¶Î§¼«Îª¹ã·º£¬²¢ÇÒÒÑÔÚÖÚ¶àÁìÓòµÃµ½ÁËʵ¼ÊÓ¦Óã¬È¡µÃÁËÐí¶àÁîÈËÖõÄ¿µÄ³É¹û£¬ÒýÆðÁ˹ã´óѧÕߺ͹¤³ÌÈËÔ±µÄ¹Ø×¢¡£
GAÊÇÒ»ÖÖ¹ãΪÈËÃǹØ×¢µÄÏÖ´úÓÅ»¯¼¼Êõ£¬Ëü²»ÒÀÀµ¸ü¶àµÄÍⲿÌõ¼þºÍ֪ʶ±ãÄÜѸËٵؽøÐÐÈ«¾Ö×îÓÅËÑË÷£¬ÓÉÓÚÕâЩÓŵ㣬GA¼º¾²¢ÇÒÕýÔÚ±»Ó¦ÓÃÓÚÐí¶àÁìÓò¡£±¾ÎĽ«GAµÄÑ°Óż¼ÊõÒýÈëDCPMÎÊÌ⣬ʵÏÖµÄËã·¨ÓÃËæ»úËÑË÷²ßÂÔ´úÌæÁË´«Í³Ëã·¨ÖеĻùÓÚÁìÓò֪ʶµÄÈ·¶¨ËÑË÷×¼Ôò£¬ÌṩÁËÒ»ÖÖ¸ü¼ÓͨÓò¢ÇÒ¼òµ¥Ò×ÐеÄÇó½âDCPMÎÊÌâµÄ·½·¨¡£ÕâÖÖËã·¨ÈÝÒ×±à³ÌʵÏÖ£¬ÁíÍ⣬ÒòΪGA±¾Éí¹ÌÓеIJ¢ÐÐÐÔ£¬ÔÚ¼ÆËã»úϵͳÖпÉÒÔºÜÈÝÒ×µØÔÚ·Ö²¼Ê½»·¾³Öд¦Àí´ó¹æÄ£DCPMÎÊÌâ¡£
±¾ÎÄÔÚµÚÒ»Õ½éÉÜÁËÊý¾ÝÍÚ¾òµÄ¸ÅÄÊý¾ÝÍÚ¾òÑо¿µÄÒâÒåÒÔ¼°Êý¾ÝÍÚ¾ò³£Óü¼ÊõºÍÁ÷³Ì£»µÚ¶þÕ¶ÔÊý¾ÝÍÚ¾òÖеĵäÐÍËã·¨--ÒÅ´«Ëã·¨×öÁËÏ꾡µÄ½éÉÜ£¬°üÀ¨ÆäÓÉÀ´¡¢·¢Õ¹£¬ºÍ»ù±¾ÔÀí¡¢Éè¼Æ˼Ïë¡¢ÌصãÒÔ¼°¸Ä½øµÄÒÅ´«Ëã·¨£»µÚÈýÕ½éÉÜÁËÍøÂç¼Æ»®µÄ¸ÅÄî¼°Æä²úÉú¡¢·¢Õ¹ºÍÌص㡣±¾ÎÄÔÚµÚËÄÕÂÒÔʵÀýÀ´ËµÃ÷ÒÅ´«Ëã·¨ÔÚÍøÂç¼Æ»®ÖеÄÓ¦Óá£
¹Ø¼ü´Ê£ºÊý¾ÝÍÚ¾ò ÒÅ´«Ëã·¨ ÍøÂç¼Æ»® DCPM
Title Genetic Algorithm and its in network plan application
Abstract
GA is a searching arithmetic which animates natural biology evolution. Due to it¡¯s simple ,easy and doesn¡¯t need professional knowledge but only adaptation function to instruct searching process, it has been applied to many fields, and achieved good result ,which attracted many scholars and engineers .
GA is a modern optimized technology, which relies on more external condition and knowledge to reach overall optimized searching rapidly. Due to these advantages, GA has been applied in many fields . In the dissertation, the technique of GA is introduced into DCPM ,and the arithmetic is random searching in stead of fixed searching principle in traditional arithmetic, which offered a more general and simple DCPM solution. This methodology helps to realize program ,and because of the parallel feature, in the computer system, it¡¯s easy to solve DCPM problem in the distributing environment .
In the first part of my dissertation, there will be an introduction to data digging technology ,and as GA ,it¡¯s origin, development, basic principle, and typical arithmetic, design and features will be shown in the second part in details . In the third part you will see the explanation to net plan, including the generation, development and features. As an effective overall arithmetic and optimized searching tool, in the fourth part , you will see the examples of GA application in net plan.
Keywords:Data Mining Genetic Algorithm Network Planning DCPM