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

5

GENDER EQUALITY
GENDER EQUALITY Logo

0

Research Products

14

LIFE BELOW WATER
LIFE BELOW WATER Logo

1

Research Products

10

REDUCED INEQUALITIES
REDUCED INEQUALITIES Logo

0

Research Products

3

GOOD HEALTH AND WELL-BEING
GOOD HEALTH AND WELL-BEING Logo

0

Research Products

2

ZERO HUNGER
ZERO HUNGER Logo

0

Research Products

9

INDUSTRY, INNOVATION AND INFRASTRUCTURE
INDUSTRY, INNOVATION AND INFRASTRUCTURE Logo

1

Research Products

16

PEACE, JUSTICE AND STRONG INSTITUTIONS
PEACE, JUSTICE AND STRONG INSTITUTIONS Logo

0

Research Products

11

SUSTAINABLE CITIES AND COMMUNITIES
SUSTAINABLE CITIES AND COMMUNITIES Logo

0

Research Products

8

DECENT WORK AND ECONOMIC GROWTH
DECENT WORK AND ECONOMIC GROWTH Logo

0

Research Products

13

CLIMATE ACTION
CLIMATE ACTION Logo

0

Research Products

4

QUALITY EDUCATION
QUALITY EDUCATION Logo

0

Research Products

6

CLEAN WATER AND SANITATION
CLEAN WATER AND SANITATION Logo

0

Research Products

1

NO POVERTY
NO POVERTY Logo

0

Research Products

15

LIFE ON LAND
LIFE ON LAND Logo

0

Research Products

17

PARTNERSHIPS FOR THE GOALS
PARTNERSHIPS FOR THE GOALS Logo

0

Research Products

7

AFFORDABLE AND CLEAN ENERGY
AFFORDABLE AND CLEAN ENERGY Logo

1

Research Products

12

RESPONSIBLE CONSUMPTION AND PRODUCTION
RESPONSIBLE CONSUMPTION AND PRODUCTION Logo

0

Research Products
Documents

15

Citations

632

h-index

8

Go to Scopus profile
Documents

16

Citations

532

Go to WoS profile
Scholarly Output

15

Articles

11

Views / Downloads

43/0

Supervised MSc Theses

2

Supervised PhD Theses

0

WoS Citation Count

115

Scopus Citation Count

102

WoS h-index

5

Scopus h-index

4

Patents

0

Projects

0

WoS Citations per Publication

7.67

Scopus Citations per Publication

6.80

Open Access Source

4

Supervised Theses

2

Google Analytics Visitor Traffic

JournalCount
Structures2
Journal of Construction Engineering, Management & Innovation2
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: Sonmez, RifatSubject: 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.