Aminbakhsh, Saman

Profile Picture
Profile URL
https://hdl.handle.net/20.500.14411/6691
Name Variants
Saman, Aminbakhsh
S., Aminbakhsh
A., Saman
Saman Aminbakhsh
S.,Aminbakhsh
Aminbakhsh,Saman
A.,Saman
Aminbakhsh, Saman
Aminbakhsh,S.
Job Title
Doktor Öğretim Üyesi
Email Address
saman.aminbakhsh@atilim.edu.tr
Main Affiliation
Civil Engineering
Status
Website
ORCID ID
0000-0002-4389-1910
Scopus Author ID
55768552300
Turkish CoHE Profile ID
8D50169F8600DF9B
Google Scholar ID
JRu69LMAAAAJ
WoS Researcher ID
LIF-9792-2024

Sustainable Development Goals

NO POVERTY1
NO POVERTY
0
Research Products
ZERO HUNGER2
ZERO HUNGER
0
Research Products
GOOD HEALTH AND WELL-BEING3
GOOD HEALTH AND WELL-BEING
0
Research Products
QUALITY EDUCATION4
QUALITY EDUCATION
0
Research Products
GENDER EQUALITY5
GENDER EQUALITY
0
Research Products
CLEAN WATER AND SANITATION6
CLEAN WATER AND SANITATION
0
Research Products
AFFORDABLE AND CLEAN ENERGY7
AFFORDABLE AND CLEAN ENERGY
1
Research Products
DECENT WORK AND ECONOMIC GROWTH8
DECENT WORK AND ECONOMIC GROWTH
0
Research Products
INDUSTRY, INNOVATION AND INFRASTRUCTURE9
INDUSTRY, INNOVATION AND INFRASTRUCTURE
1
Research Products
REDUCED INEQUALITIES10
REDUCED INEQUALITIES
0
Research Products
SUSTAINABLE CITIES AND COMMUNITIES11
SUSTAINABLE CITIES AND COMMUNITIES
0
Research Products
RESPONSIBLE CONSUMPTION AND PRODUCTION12
RESPONSIBLE CONSUMPTION AND PRODUCTION
0
Research Products
CLIMATE ACTION13
CLIMATE ACTION
0
Research Products
LIFE BELOW WATER14
LIFE BELOW WATER
1
Research Products
LIFE ON LAND15
LIFE ON LAND
0
Research Products
PEACE, JUSTICE AND STRONG INSTITUTIONS16
PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
PARTNERSHIPS FOR THE GOALS17
PARTNERSHIPS FOR THE GOALS
0
Research Products
Documents

15

Citations

632

h-index

8

Go to Scopus profile
Documents

16

Citations

532

Go to WoS profile
Scholarly Output

16

Articles

12

Views / Downloads

130/1606

Supervised MSc Theses

2

Supervised PhD Theses

0

WoS Citation Count

118

Scopus Citation Count

109

Patents

0

Projects

0

WoS Citations per Publication

7.38

Scopus Citations per Publication

6.81

Open Access Source

5

Supervised Theses

2

JournalCount
Journal of Construction Engineering, Management & Innovation2
Structures2
European Journal of Operational Research1
Journal of Building Engineering1
Journal of Construction Engineering and Management1
Current Page: 1 / 3

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

20201
Reset filters

Settings

Author: Atan, TankutSubject: Algorithms

Scholarly Output Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Article
    Citation - WoS: 24
    Activity 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, Tankut
    Despite 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.