Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms - Info and Reading Options
By sayedMostafa mousavi, Alireza Toloei, mohammadhosein Toloei
"Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms" and the language of the book is per.
“Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms” Metadata:
- Title: ➤ Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms
- Author: ➤ sayedMostafa mousavi, Alireza Toloei, mohammadhosein Toloei
- Language: per
Edition Identifiers:
- Internet Archive ID: ➤ jacsm-volume-37-issue-1-pages-53-70
AI-generated Review of “Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms”:
"Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms" Description:
The Internet Archive:
<div class="padding_abstract justify ltr" style="text-align:justify;border-left:5px solid rgba(0,0,0,0.1);border-right:0px;padding:15px;color:rgb(51,51,51);font-family:'ltr-font';font-size:14px;background-color:rgb(255,255,255);">The purpose of this article is to implement different methods of meta-heuristic algorithms to solve five engineering problems. these engineering problems have been optimized using five meta-heuristic algorithms of firefly, colonial competition, frog, ants and gray wolf with the aim of reducing the costs of engineering problems. in each of the algorithms, a dynamic adaptive factor is introduced to balance the convergence rate and absolute optimal search ability by adjusting the search speed during the search process. Investigations show that in each of the algorithms techniques are used to leave the local optimum, which makes the answers converge to the absolute optimum. To evaluate the quality and accuracy of the algorithms, the sensitivity test and the comparison of the convergence numbers for the results of the implementation of each algorithm on the data have been used. The results show that the firefly algorithm in spring tension problem, frog algorithm in three-bar truss problem, the colonial competition algorithm in the speed reducer and gear design problems, and the gray wolf algorithm in the pressure tank problem provided more accurate performance in finding the absolute optimum. . In fact, these algorithms make it easy to achieve the optimal solution by generating a random population, creating a neighborhood and choosing the best neighbor, provided that the constraints of the variables of the problem are satisfied. As a result, this paper shows that any meta-heuristic algorithm can perform better in a specific engineering problem, depending on the type of problem and environmental conditions.</div><div><br /></div>
Read “Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms”:
Read “Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms” by choosing from the options below.
Available Downloads for “Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms”:
"Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms" is available for download from The Internet Archive in "texts" format, the size of the file-s is: 12.98 Mbs, and the file-s went public at Sat May 10 2025.
Legal and Safety Notes
Copyright Disclaimer and Liability Limitation:
A. Automated Content Display
The creation of this page is fully automated. All data, including text, images, and links, is displayed exactly as received from its original source, without any modification, alteration, or verification. We do not claim ownership of, nor assume any responsibility for, the accuracy or legality of this content.
B. Liability Disclaimer for External Content
The files provided below are solely the responsibility of their respective originators. We disclaim any and all liability, whether direct or indirect, for the content, accuracy, legality, or any other aspect of these files. By using this website, you acknowledge that we have no control over, nor endorse, the content hosted by external sources.
C. Inquiries and Disputes
For any inquiries, concerns, or issues related to the content displayed, including potential copyright claims, please contact the original source or provider of the files directly. We are not responsible for resolving any content-related disputes or claims of intellectual property infringement.
D. No Copyright Ownership
We do not claim ownership of any intellectual property contained in the files or data displayed on this website. All copyrights, trademarks, and other intellectual property rights remain the sole property of their respective owners. If you believe that content displayed on this website infringes upon your intellectual property rights, please contact the original content provider directly.
E. Fair Use Notice
Some content displayed on this website may fall under the "fair use" provisions of copyright law for purposes such as commentary, criticism, news reporting, research, or educational purposes. If you believe any content violates fair use guidelines, please reach out directly to the original source of the content for resolution.
Virus Scanning for Your Peace of Mind:
The files provided below have already been scanned for viruses by their original source. However, if you’d like to double-check before downloading, you can easily scan them yourself using the following steps:
How to scan a direct download link for viruses:
- 1- Copy the direct link to the file you want to download (don’t open it yet). (a free online tool) and paste the direct link into the provided field to start the scan.
- 2- Visit VirusTotal (a free online tool) and paste the direct link into the provided field to start the scan.
- 3- VirusTotal will scan the file using multiple antivirus vendors to detect any potential threats.
- 4- Once the scan confirms the file is safe, you can proceed to download it with confidence and enjoy your content.
Available Downloads
- Source: Internet Archive
- Internet Archive Link: Archive.org page
- All Files are Available: Yes
- Number of Files: 15
- Number of Available Files: 15
- Added Date: 2025-05-10 20:56:17
- Scanner: Internet Archive HTML5 Uploader 1.7.0
- PPI (Pixels Per Inch): 300
- OCR: tesseract 5.3.0-6-g76ae
- OCR Detected Language: fa
Available Files:
1- Text PDF
- File origin: original
- File Format: Text PDF
- File Size: 0.00 Mbs
- File Name: JACSM_Volume 37_Issue 1_Pages 53-70.pdf
- Direct Link: Click here
2- Item Tile
- File origin: original
- File Format: Item Tile
- File Size: 0.00 Mbs
- File Name: __ia_thumb.jpg
- Direct Link: Click here
3- Metadata
- File origin: original
- File Format: Metadata
- File Size: 0.00 Mbs
- File Name: jacsm-volume-37-issue-1-pages-53-70_files.xml
- Direct Link: Click here
4- Metadata
- File origin: original
- File Format: Metadata
- File Size: 0.00 Mbs
- File Name: jacsm-volume-37-issue-1-pages-53-70_meta.sqlite
- Direct Link: Click here
5- Metadata
- File origin: original
- File Format: Metadata
- File Size: 0.00 Mbs
- File Name: jacsm-volume-37-issue-1-pages-53-70_meta.xml
- Direct Link: Click here
6- chOCR
- File origin: derivative
- File Format: chOCR
- File Size: 0.00 Mbs
- File Name: JACSM_Volume 37_Issue 1_Pages 53-70_chocr.html.gz
- Direct Link: Click here
7- DjVuTXT
- File origin: derivative
- File Format: DjVuTXT
- File Size: 0.00 Mbs
- File Name: JACSM_Volume 37_Issue 1_Pages 53-70_djvu.txt
- Direct Link: Click here
8- Djvu XML
- File origin: derivative
- File Format: Djvu XML
- File Size: 0.00 Mbs
- File Name: JACSM_Volume 37_Issue 1_Pages 53-70_djvu.xml
- Direct Link: Click here
9- hOCR
- File origin: derivative
- File Format: hOCR
- File Size: 0.00 Mbs
- File Name: JACSM_Volume 37_Issue 1_Pages 53-70_hocr.html
- Direct Link: Click here
10- OCR Page Index
- File origin: derivative
- File Format: OCR Page Index
- File Size: 0.00 Mbs
- File Name: JACSM_Volume 37_Issue 1_Pages 53-70_hocr_pageindex.json.gz
- Direct Link: Click here
11- OCR Search Text
- File origin: derivative
- File Format: OCR Search Text
- File Size: 0.00 Mbs
- File Name: JACSM_Volume 37_Issue 1_Pages 53-70_hocr_searchtext.txt.gz
- Direct Link: Click here
12- Single Page Processed JP2 ZIP
- File origin: derivative
- File Format: Single Page Processed JP2 ZIP
- File Size: 0.01 Mbs
- File Name: JACSM_Volume 37_Issue 1_Pages 53-70_jp2.zip
- Direct Link: Click here
13- Page Numbers JSON
- File origin: derivative
- File Format: Page Numbers JSON
- File Size: 0.00 Mbs
- File Name: JACSM_Volume 37_Issue 1_Pages 53-70_page_numbers.json
- Direct Link: Click here
14- Scandata
- File origin: derivative
- File Format: Scandata
- File Size: 0.00 Mbs
- File Name: JACSM_Volume 37_Issue 1_Pages 53-70_scandata.xml
- Direct Link: Click here
15- Archive BitTorrent
- File origin: metadata
- File Format: Archive BitTorrent
- File Size: 0.00 Mbs
- File Name: jacsm-volume-37-issue-1-pages-53-70_archive.torrent
- Direct Link: Click here
Search for “Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms” in Libraries Near You:
Read or borrow “Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms” from your local library.
Buy “Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms” online:
Shop for “Optimization Of Engineering Problems With Discrete And Continuous Constraints Using Dynamic Adaptive Meta-heuristic Algorithms” on popular online marketplaces.
- Ebay: New and used books.