A polynomial algorithm for the earthwork allocation problem with borrow and waste site selection

Creative Commons License

Guden H., SÜRAL H.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, cilt.68, sa.9, ss.1085-1093, 2017 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 68 Sayı: 9
  • Basım Tarihi: 2017
  • Doi Numarası: 10.1057/s41274-016-0140-0
  • Dergi Adı: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
  • Sayfa Sayıları: ss.1085-1093
  • Anahtar Kelimeler: road construction, dynamic programming, location, lot sizing, logistics, LOCATION-PROBLEMS, MODELS, REFORMULATIONS
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

In road construction projects, earthwork is planned together with horizontal and vertical alignments. This study focuses on earthwork operations that basically include cutting the hills and filling the holes on the road path. The candidate borrow and waste sites can also be used to obtain or heap earth when the available cut and fill amounts are not balanced or operating these sites reduces the total earthwork cost. Total earthwork cost contains the transportation cost and the overall cost related to opening the candidate sites. The problem is to determine which borrow and waste sites to operate, and the earth flows between cut, fill, waste, and borrow sites such that the total cost is minimized. It is shown that the problem is a generalization of the well-known lot-sizing problem. A fixed charge network flow problem formulation is presented, and a polynomial time dynamic programming algorithm is developed for solving the problem.