2 results
Search Results
Now showing 1 - 2 of 2
Article Citation - WoS: 8Estimation of Polypropylene Concentration of Modified Bitumen Images by Using K-Nn and Svm Classifiers(Asce-amer Soc Civil Engineers, 2015) Tapkin, Serkan; Sengoz, Burak; Sengul, Gokhan; Topal, Ali; Ozcelik, ErolThe goal of this study is to design an expert system that automatically classifies the microscopic images of polypropylene fiber (PPF) modified bitumen including seven different contents of fibers. Optical microscopy was used to capture the images from thin films of polypropylene fiber modified bitumen samples at a magnification scale of 100 x. A total of 313 images were pre-processed, and features were extracted and selected by the exhaustive search method. The k-nearest neighbor (k-NN) and multiclass support vector machine (SVM) classifiers were applied to quantify the representation capacity. The k-NN and multiclass SVM classifiers reached an accuracy rate of 87% and 86%, respectively. The results suggest that the proposed expert system can successfully estimate the concentration of PPF in bitumen images with good generalization characteristics. (C) 2014 American Society of Civil Engineers.Article Citation - WoS: 24Activity Uncrashing Heuristic With Noncritical Activity Rescheduling Method for the Discrete Time-Cost Trade-Off Problem(Asce-amer Soc Civil Engineers, 2020) Sonmez, Rifat; Aminbakhsh, Saman; Atan, TankutDespite intensive research efforts that have been devoted to discrete time-cost optimization of construction projects, the current methods have very limited capabilities for solving the problem for real-life-sized projects. This study presents a new activity uncrashing heuristic with noncritical activity rescheduling method to narrow the gap between the research and practice for time-cost optimization. The uncrashing heuristic searches for new solutions by uncrashing the critical activities with the highest cost-slope. This novel feature of the proposed heuristic enables identification and elimination of the dominated solutions during the search procedure. Hence, the heuristic can determine new high-quality solutions based on the nondominated solutions. Furthermore, the proposed noncritical activity rescheduling method of the heuristic decreases the amount of scheduling calculations, and high-quality solutions are achieved within a short CPU time. Results of the computational experiments reveal that the new heuristic outperforms state-of-the-art methods significantly for large-scale single-objective cost minimization and Pareto front optimization problems. Hence, the primary contribution of the paper is a new heuristic method that can successfully achieve high-quality solutions for large-scale discrete time-cost optimization problems.
