Proposal of mutation-based bees algorithm (MBA) to solve traveling salesman & jobs scheduling problems
هذا البحث يقدم خوارزمية مطورة و معتمدة على التحشد و هي خوارزمية النحل و معامل الطفرة. خوارزمية النحل المعتمدة على الطفرة هي خوارزمية مفيدة جدا لحل بعض مشاكل من نوع NP-complete. هذا البحث يحوي النسخة الأساسية من خوارزمية النحل المعتمدة على الطفرة لحل مشكلتين من نوع NP-complete كإجراء لغرض اختبار الخو...
Saved in:
| Published in | Engineering and Technology Journal Vol. 28; no. 19; pp. 5833 - 5843 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Baghdad, Iraq
University of Technology
01.09.2010
Unviversity of Technology- Iraq |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1681-6900 2412-0758 2412-0758 |
| DOI | 10.30684/etj.28.19.3 |
Cover
| Abstract | هذا البحث يقدم خوارزمية مطورة و معتمدة على التحشد و هي خوارزمية النحل و معامل الطفرة. خوارزمية النحل المعتمدة على الطفرة هي خوارزمية مفيدة جدا لحل بعض مشاكل من نوع NP-complete. هذا البحث يحوي النسخة الأساسية من خوارزمية النحل المعتمدة على الطفرة لحل مشكلتين من نوع NP-complete كإجراء لغرض اختبار الخوارزمية المقترحة. و هاتان المشكلتان هما مشكلة البائع المتجول و مشكلة جدولة الوظائف. نتائج التجارب أثبتت أن النموذج المقترح مناسب جدا لحل مشاكل من نوع NP-complete و قد أعطت نتائج جيدة بالمقارنة مع خوارزمية النحل التقليدية.
This paper presents an improved swarm-based algorithm which is based on Bees Algorithm and Mutation Operator. Mutation-based Bees Algorithm (MBA) is very useful to solve some NP-complete problems. This paper contains the basic version of MBA with solving two NP-complete problems as examples and experiments for testing the suggested approach. These two problems are Traveling Salesman Problem and Job Scheduling Problem. The experimental results show that the suggested approach is very suitable for solving NP-complete problems and gives good results compare with traditional Bees algorithm. |
|---|---|
| AbstractList | هذا البحث يقدم خوارزمية مطورة و معتمدة على التحشد و هي خوارزمية النحل و معامل الطفرة. خوارزمية النحل المعتمدة على الطفرة هي خوارزمية مفيدة جدا لحل بعض مشاكل من نوع NP-complete. هذا البحث يحوي النسخة الأساسية من خوارزمية النحل المعتمدة على الطفرة لحل مشكلتين من نوع NP-complete كإجراء لغرض اختبار الخوارزمية المقترحة. و هاتان المشكلتان هما مشكلة البائع المتجول و مشكلة جدولة الوظائف. نتائج التجارب أثبتت أن النموذج المقترح مناسب جدا لحل مشاكل من نوع NP-complete و قد أعطت نتائج جيدة بالمقارنة مع خوارزمية النحل التقليدية.
This paper presents an improved swarm-based algorithm which is based on Bees Algorithm and Mutation Operator. Mutation-based Bees Algorithm (MBA) is very useful to solve some NP-complete problems. This paper contains the basic version of MBA with solving two NP-complete problems as examples and experiments for testing the suggested approach. These two problems are Traveling Salesman Problem and Job Scheduling Problem. The experimental results show that the suggested approach is very suitable for solving NP-complete problems and gives good results compare with traditional Bees algorithm. This paper presents an improved swarm-based algorithm which is based on BeesAlgorithm and Mutation Operator. Mutation-based Bees Algorithm (MBA) is veryuseful to solve some NP-complete problems. This paper contains the basic version ofMBA with solving two NP-complete problems as examples and experiments fortesting the suggested approach. These two problems are Traveling Salesman Problemand Job Scheduling Problem. The experimental results show that the suggestedapproach is very suitable for solving NP-complete problems and gives good resultscompare with traditional Bees algorithm. |
| Author | Chaweshly, Saran Akram |
| Author_xml | – sequence: 1 fullname: Chaweshly, Saran Akram |
| BookMark | eNo9kEFv1DAQRi1UJJbSG1cknxAcsozt2LGPpQJaqRUc4GyN7ck2Kydexdmi_nuiXdTLjDTzvnf43rKLqUzE2HsBWwXGtl9o2W-l3Qq3Va_YRrZCNtBpe8E2wljRGAfwhl3VugcA6ZywoDas_zWXQ6mYeen5eFxwGcrUBKyUeCCqHPOuzMPyOPJPD1-vP_Ol8FryE_FlxifKw7Tja5rqiBP_yPclVF7jI6Xj6XWYS8g01nfsdY-50tX_fcn-fP_2--a2uf_54-7m-r6JEoxqVNKdEabXIQghUEeX1mF17EQUQUcVY3IkNLYJQkuWZKRk--SgVzbKpC7Z3dmbCu79YR5GnJ99wcGfDmXeeZyXIWbypKlbg0lraFedtkpYHTowGJx1yayu5uw6Tgd8_os5vwgF-FPnfu3cS-uF82rlP5x5Whnq8YWWRkIH6h-bNIEB |
| CitedBy_id | crossref_primary_10_1002_masy_202000299 |
| ContentType | Journal Article |
| DBID | ADJCN AHFXO ADTOC UNPAY DOA |
| DOI | 10.30684/etj.28.19.3 |
| DatabaseName | الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete Unpaywall for CDI: Periodical Content Unpaywall DOAJ Open Access Full Text |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Open Access Full Text url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| DocumentTitleAlternate | إقتراح خوارزمية النحل المعتمدة على الطفرة لحل مشكلتي البائع المتجول و جدولة الوظائف |
| EISSN | 2412-0758 |
| EndPage | 5843 |
| ExternalDocumentID | oai_doaj_org_article_e5e7d90d55044d0583185b706ab989d6 10.30684/etj.28.19.3 262070 |
| GroupedDBID | ADJCN AHFXO ALMA_UNASSIGNED_HOLDINGS GROUPED_DOAJ ADTOC UNPAY |
| ID | FETCH-LOGICAL-c2063-3d57616f5bb111a5c9da5c85c71c1b5c3ccd9e15a4d0b4e8e2ced8fd90f38c2d3 |
| IEDL.DBID | UNPAY |
| ISSN | 1681-6900 2412-0758 |
| IngestDate | Fri Oct 03 12:16:46 EDT 2025 Tue Aug 19 21:00:18 EDT 2025 Tue Nov 26 16:45:00 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 19 |
| LCCallNum_Ident | QH |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2063-3d57616f5bb111a5c9da5c85c71c1b5c3ccd9e15a4d0b4e8e2ced8fd90f38c2d3 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://etj.uotechnology.edu.iq/article_40307_a6bc31ee6cf025c1783cb1088a599624.pdf |
| PageCount | 11 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_e5e7d90d55044d0583185b706ab989d6 unpaywall_primary_10_30684_etj_28_19_3 emarefa_primary_262070 |
| PublicationCentury | 2000 |
| PublicationDate | 2010-09-01 |
| PublicationDateYYYYMMDD | 2010-09-01 |
| PublicationDate_xml | – month: 09 year: 2010 text: 2010-09-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Baghdad, Iraq |
| PublicationPlace_xml | – name: Baghdad, Iraq |
| PublicationTitle | Engineering and Technology Journal |
| PublicationYear | 2010 |
| Publisher | University of Technology Unviversity of Technology- Iraq |
| Publisher_xml | – name: University of Technology – name: Unviversity of Technology- Iraq |
| SSID | ssj0002991803 |
| Score | 1.7392762 |
| Snippet | هذا البحث يقدم خوارزمية مطورة و معتمدة على التحشد و هي خوارزمية النحل و معامل الطفرة. خوارزمية النحل المعتمدة على الطفرة هي خوارزمية مفيدة جدا لحل بعض مشاكل من... This paper presents an improved swarm-based algorithm which is based on BeesAlgorithm and Mutation Operator. Mutation-based Bees Algorithm (MBA) is veryuseful... |
| SourceID | doaj unpaywall emarefa |
| SourceType | Open Website Open Access Repository Publisher |
| StartPage | 5833 |
| SubjectTerms | Algorithm Bees Computer algorithms Production scheduling salesman problem Traveling-salesman problem الخوارزميات النحل |
| SummonAdditionalLinks | – databaseName: DOAJ Open Access Full Text dbid: DOA link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NS8QwEA3iRS-iqLh-kYOIHrombdMkx11RRFgRdhe8lXxMFVnbxe4q_nsnbVn25sVLDklbwnttZobOzCPkAmSmeeFVlALDIZEOPykpI6sKK0ShQWWhOHn0lD1M08cX8bIm9RVywtr2wC1wNyBAes08etJp6plQodzXSpYZq5X2TbNtpvRaMBXOYDxkuWpkkXmmeIQhIGuz3tFDVukNLN77sepz3U-6Xv1NQa5Bo4QGamtZzs3Pt5nN1kzN_S7Z6XxEOmj3tkc2oNwn_jnoGdQ4XxV0tGz_oEdDNEKeDgFqOpi9Vhjpv33Qq9FwcE0XFR1Xsy-gk6AwFKrO6RitQf1hSvpY2ZqOkS-_bBaeW1mZ-oBM7-8mtw9RJ5EQuRidiyjxGC_wrBDW4qFlhNMeByWc5I5b4RLnvAYuDEJnU1AQO_CqQECLRLnYJ4dks6xKOCLUxj7lzjjDpcWrwVrmmfZ4D8KbuLRHhgGofN52wchDX-pmAtnKO7byv9jqkcMO5tVzQkd8yXrkcoX6agkDlIavHPnKY5VznSfH_7GNE7LdZgGEXLFTsrn4XMIZOhcLe968R79oQ8qR priority: 102 providerName: Directory of Open Access Journals |
| Title | Proposal of mutation-based bees algorithm (MBA) to solve traveling salesman & jobs scheduling problems |
| URI | https://search.emarefa.net/detail/BIM-262070 https://etj.uotechnology.edu.iq/article_40307_a6bc31ee6cf025c1783cb1088a599624.pdf https://doaj.org/article/e5e7d90d55044d0583185b706ab989d6 |
| UnpaywallVersion | publishedVersion |
| Volume | 28 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Open Access Full Text customDbUrl: eissn: 2412-0758 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0002991803 issn: 1681-6900 databaseCode: DOA dateStart: 20050101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9NAEF6V9AAXHoKK8Kj2gCo42HjtfR4TRFVVShWRRiona59tIY1DbIPg1zNrOxHixIGLD_uyvTPrb2Y8D4TeeMEVCU4m1GdwKYSFIyVEYmQwjAXlJY_BybMLfrak51fs6gB92sXC-OZL2lbN3qzcmSxuv70f9rGkkSlLzY0tiPfcBsBsS4QsrCFwYHTMNpLTdOPCPXTIGcjnI3S4vJhPPkfNi0uSgDoYDS-AXNHtksneGx4kZ0m7u-cyJSothhz-XaCuBrAC4Lrfrjf65w-9Wv0BQaePUL17-N7z5GvaNia1v_7K6_h_3-4xejhIrHjST36CDvz6KQrzWF2hhvYq4Fnb_89PpgCJDk-9r_FkdV1tb5ubO_x2Np28w02FF9Xqu8eXsd5RjIHHC8Cm-k6v8Qk-r0yNF8A_ru265n2Zm_oZWp5-vPxwlgwlGxKbg7CTFA70F8IDMwY-oppZ5eAimRXEEsNsYa1TnjBNXWaolz633sngVBYKaXNXHKHRulr75wib3FFitdVEGBjtjclcphzMyUDGsnSMppFA5abPylHGPNldQ7W9Lncb6pkXsLgDPYzCIkzGYHEjMq6NksrxMToayLtfJ2boF9kYneypve8ChanjkxLoWOayJKosXvzrwJfoQe95EP3TXqFRs239axBoGnPcGQKOBz79DbCD84o |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9NAEF6V9ACXAoKK8NIeUAUHG6-9z2OCqKpKqSLSSOVk7bMU0jiNbRD8emZtJ0KcOHDZw7683pn1N7OeB0JvvOCKBCcT6jMoCmHhSAmRGBkMY0F5yaNz8uyCny3p-RW7OkCfdr4wvvmatlWzv1burixu7t4P-1jSyJSl5sYWxHtuA2C2JUIW1hA4MDpGG8lpunHhHjrkDOTzETpcXswnn6PmxSVJQB2MFy-AXNHsksneGh4kZ0m7p-cyJSothhj-naOuBrAC4Lrfrjf65w-9Wv0BQacPUb1bfG958i1tG5PaX3_Fdfy_b_cIHQ0SK570gx-jA79-gsI8Zleoob4KeNb2__OTKUCiw1PvazxZXVfbm-bLLX47m07e4abCi2r13ePLmO8o-sDjBWBTfavX-ASfV6bGC-Af13ZN8z7NTf0ULU8_Xn44S4aUDYnNQdhJCgf6C-GBGQMfUc2sclBIZgWxxDBbWOuUJ0xTlxnqpc-tdzI4lYVC2twVx2i0rtb-GcImd5RYbTURBnp7YzKXKQdjMpCxLB2jaSRQuemjcpQxTnZXUW2vy92GeuYFTO5AD6MwCZPRWdyIjGujpHJ8jI4H8u7niRH6RTZGJ3tq75tAYer4pAQ6lrksiSqL5__a8QV60FseRPu0l2jUbFv_CgSaxrweOPQ3AMfylQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Proposal+of+mutation-based+bees+algorithm+%28MBA%29+to+solve+traveling+salesman+%26+jobs+scheduling+problems&rft.jtitle=Engineering+and+Technology+Journal&rft.au=Chaweshly%2C+Saran+Akram&rft.date=2010-09-01&rft.pub=University+of+Technology&rft.issn=1681-6900&rft.eissn=2412-0758&rft.volume=28&rft.issue=19&rft.spage=5833&rft.epage=5843&rft_id=info:doi/10.30684%2Fetj.28.19.3&rft.externalDBID=ADJCN&rft.externalDocID=262070 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1681-6900&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1681-6900&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1681-6900&client=summon |