Solving the least-cost route cut and fill sequencing problem using particle swarm
Author's Department
Construction Engineering Department
Find in your Library
https://doi.org/10.1061/(ASCE)CO.1943-7862.0000512
Document Type
Research Article
Publication Title
Journal of Construction Engineering and Management
Publication Date
12-1-2012
doi
10.1061/(ASCE)CO.1943-7862.0000512
First Page
931
Last Page
942
Recommended Citation
APA Citation
Nassar, K.
&
Hosny, O.
(2012). Solving the least-cost route cut and fill sequencing problem using particle swarm. Journal of Construction Engineering and Management, 138(8), 931–942.
10.1061/(ASCE)CO.1943-7862.0000512
https://fount.aucegypt.edu/faculty_journal_articles/2081
MLA Citation
Nassar, Khaled, et al.
"Solving the least-cost route cut and fill sequencing problem using particle swarm." Journal of Construction Engineering and Management, vol. 138,no. 8, 2012, pp. 931–942.
https://fount.aucegypt.edu/faculty_journal_articles/2081