Algoritmi genetici pentru rezolvarea problemelor prin - Sorin ...

More documents

Recommendations

Info

StringCoveringDlg.cpp 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 } }; }; { }; selected_patterns = tmp; tmp.push_back(what_to_insert); UpdateDialogFromValues(); void CStringCoveringDlg::OnRemoveSelected() { // TODO: Add your control notification handler code here vector tmp; } char s[2000]; for (int i = 0; i < m_selected_patterns.GetCount(); i++) { if (0 == m_selected_patterns.GetSel(i)) // if not selected... we keep it { m_patterns.GetText(i, s); const string what_to_insert(s); }; }; tmp.push_back(what_to_insert); selected_patterns = tmp; UpdateDialogFromValues(); void CStringCoveringDlg::OnClearPatterns() { // TODO: Add your control notification handler code here selected_patterns.clear(); } UpdateDialogFromValues(); void CStringCoveringDlg::OnGenerateTargetSet() { // TODO: Add your control notification handler code here if (false == UpdateValuesFromDialog1()) { AfxMessageBox("Invalid parameters!", MB_OK | MB_ICONSTOP); } else { Population population(NULL, target_set_size, Genome::GENOME_ZERO); const int patterns_no = selected_patterns.size(); assert (0 < patterns_no); for (int i = 0; i < target_set_size; i++) { const int what_pattern = rand() % patterns_no; assert ((0
StringCoveringDlg.cpp 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 } }; void CStringCoveringDlg::OnDblclkPatterns() { // TODO: Add your control notification handler code here OnSelectPatterns(); } void CStringCoveringDlg::OnDblclkSelectedPatterns() { // TODO: Add your control notification handler code here OnRemoveSelected(); } void CStringCoveringDlg::OnKillfocusTsize() { // TODO: Add your control notification handler code here UpdateValuesFromDialog(); UpdateValuesFromDialog1(); } void CStringCoveringDlg::OnKillfocusPopulationSize() { // TODO: Add your control notification handler code here UpdateValuesFromDialog(); UpdateValuesFromDialog1(); } void CStringCoveringDlg::OnKillfocusGenomesNo() { // TODO: Add your control notification handler code here UpdateValuesFromDialog(); UpdateValuesFromDialog1(); } void CStringCoveringDlg::OnKillfocusMutationRate() { // TODO: Add your control notification handler code here UpdateValuesFromDialog(); UpdateValuesFromDialog1(); } void CStringCoveringDlg::OnKillfocusCrossoverRate() { // TODO: Add your control notification handler code here UpdateValuesFromDialog(); UpdateValuesFromDialog1(); } void CStringCoveringDlg::OnKillfocusNoOfGenerations() { // TODO: Add your control notification handler code here UpdateValuesFromDialog(); UpdateValuesFromDialog1(); } void CStringCoveringDlg::OnOK() { // TODO: Add extra validation here } m_evolution.ReleaseDC(pDC); pDC = NULL; delete targetSet; targetSet = NULL; CDialog::OnOK(); void CStringCoveringDlg::UpdateEvolutionPanel() { assert ((0
Page 1 and 2:
UNIVERSITATEA POLITEHNICA BUCURESTI
Page 3 and 4:
1. Introducere Ideea de baza prezen
Page 5 and 6:
3. Algoritmii genetici 3.1. Introdu
Page 7 and 8:
selectie se da o importanta mai mar
Page 9 and 10:
inar) Un mecanism de codificare a s
Page 11 and 12:
a’ = 11000 10101 01101 … 00110
Page 13 and 14:
4. Problema acoperirii sirurilor In
Page 15 and 16:
[galbena, verde]), distanta(x1, x2,
Page 17 and 18:
din acelasi termen in forma complet
Page 19 and 20:
FIGURA 2 - Sirurile de biti corespu
Page 21 and 22: Multimea D se creeaza asociind fiec
Page 23 and 24: Xover Urmasi Formule 1000111110000
Page 25 and 26: Dovedindu-se ca este asigurata comp
Page 27 and 28: FIGURA 5 - Reprezentarea grafica a
Page 29 and 30: Elementele pkj sunt normalizate rel
Page 31 and 32: doar relativ la valoarea medie a fi
Page 33 and 34: Bibliografie Hugues Juille, Jordan
Page 35 and 36: A. Imagini ale aplicatiei 34
Page 37 and 38: Algoritmi genetici pentru rezolvare
Page 39 and 40: De ce algoritmii evolutivi clasici
Page 41 and 42: Functia de fitness • Fiecare spec
Page 43 and 44: Acoperirea sirurilor • Gasirea un
Page 45 and 46: Algoritmul de baza gen = 0 for each
Page 47 and 48: C. Listingul codului sursa 46
Page 49 and 50: GA.cpp 1 2 3 4 5 6 7 8 9 10 11 12 1
Page 51 and 52: Population.h 1 2 3 4 5 6 7 8 9 10 1
Page 53 and 54: Population.cpp 84 85 86 87 88 89 90
Page 55 and 56: Genome.h 1 2 3 4 5 6 7 8 9 10 11 12
Page 57 and 58: Genome.cpp 84 85 86 87 88 89 90 91
Page 59 and 60: Genome.cpp 250 251 252 253 254 255
Page 61 and 62: StringCovering.h 1 2 3 4 5 6 7 8 9
Page 63 and 64: StringCoveringDlg.h 1 2 3 4 5 6 7 8
Page 65 and 66: StringCoveringDlg.cpp 1 2 3 4 5 6 7
Page 67 and 68: StringCoveringDlg.cpp 167 168 169 1
Page 71: StringCoveringDlg.cpp 499 500 501 5
Page 77 and 78: MyStatic.h 1 2 3 4 5 6 7 8 9 10 11
show all

Algoritmi genetici pentru rezolvarea problemelor prin - Sorin ...

Create successful ePaper yourself

Delete template?

Save as template?