ISSN: 2979-9236|DOI: 10.58190/imiens|Open Access|Peer-Reviewed
Intelligent Methods In Engineering Sciences
Vol. 4 • Issue 12 Published Articles

Volume 4, Issue 1 (2025)

Published: April 29, 2025

This issue of Intelligent Methods in Engineering Sciences (Vol. 4, No. 1, 2025) presents innovative studies on heuristic approaches in project scheduling and supervised machine learning techniques for internet traffic classification. The selected articles reflect current advancements in intelligent engineering solutions and practical applications.

Table of Contents (2 Articles)

Full Text & Open Access
Internet Traffic Classification through Supervised Learning: Exploring Machine Learning Techniques
Research Articleslock_openOpen Access
pp. 8-14

Internet Traffic Classification through Supervised Learning: Exploring Machine Learning Techniques

Poonam B. LOHIYA G. R. BAMNOTE

The increasing complexity and volume of internet traffic have led researchers to explore machine learning as an effective approach for traffic classification. By integrating intelligence into network processes, machine learning enhances network management and optimization. This study investigates four supervised learning techniques—Support Vector Machine (SVM), Random Forest (RF), K-Nearest Neighbors (KNN), and Decision Tree (DT)—to forecast network traffic categorization. Through a comparative analysis, we evaluate the performance of these algorithms in terms of accuracy, precision, recall, and computational efficiency using a standardized dataset. The results demonstrate that while each algorithm has its strengths and weaknesses, our findings indicate that Random Forest outperforms the other algorithms in most metrics, providing valuable insights for future applications in network management. This study provides valuable insights into the applicability of these algorithms for real-time internet traffic management.

visibility1,326file_download619
Implementation of a Heuristic Algorithm for the Solution of Discrete Time Cost Trade-off Problem
Research Articleslock_openOpen Access
pp. 1-7

Implementation of a Heuristic Algorithm for the Solution of Discrete Time Cost Trade-off Problem

Ayşe Nur ŞengülNezir DoğanÖnder Halis Bettemir

Time cost trade-off problem aims to minimize the total project cost by crashing the critical activities. This problem is solved by mathematical programming and meta-heuristic algorithms. However, construction sector has minimum priority on the theoretical knowledge to implement robust optimization algorithms. For this reason aforementioned optimization algorithms can be hardly implemented for the private construction companies. The nature of the time cost trade-off algorithm is not challenging and can be solved heuristically. In this study, a spreadsheet application is developed by utilizing in-app excel functions to identify the critical activities of the project and the paths of the project. The construction schedule is entered to the spreadsheet application as acticity on arrow diagram and the logical relationships between the activities are defined. Forward and backward pass computations are given as formulations which includes the actual activity durations. The developed application calculates the crashing costs of the critical activities and highlights the activities with the cheapest crashing costs. Prepaperd spreadsheet application implements a heuristic solution algorithm which is based on minimum cost slope of the construction activities. The user can easily execute the proposed or user selected crashing alternative and the schedule is updated according to the selection. The application is tested on 6 activity project and the optimum solution is obtained by crashing the activities sequentially. The proposed technique can be utilized to reduce the total project cost of the construction sector.

visibility998file_download489