Optimization of earth recycling and dump truck dispatching

NCUIR > Engineering College > Department of Civil Engineering > journal & Dissertation > Item 987654321/99669

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/99669

Title:	Optimization of earth recycling and dump truck dispatching
Authors:	顏上堯;Chu, James C.;Yan, Shangyao;Chen, Kuan-Lin
Contributors:	工學院土木工程學系
Keywords:	Algorithms;Construction industry;Dump truck dispatching;Dump trucks;Earth;Earth recycling;Heuristic algorithm;Mathematical models;Multiple commodity network flow problem;Network flow problem;Networks;Optimization;Optimization algorithms;Recycling;Schedules;Studies;Time–space network;Transportation
Date:	2012-02-01
Issue Date:	2026-04-21 13:26:42 (UTC+8)
Publisher:	Elsevier Ltd.;New York: Elsevier Ltd
Abstract:	摘要： ► A model to simultaneously plan earth recycling and truck dispatching is developed. ► Actual operating conditions are successfully considered. ► A heuristic algorithm using problem decomposition and relaxation is proposed to efficiently solve the model. ► The error gap between the exact method and the heuristic method is only 0.5% in the case study. ► Recycling earth materials increases profitability for contractors and reduces environmental impact. Earth is one of the major materials used in the construction industry. Recycling earth reduces the cost of waste disposal and generates revenue for contractors. More importantly, utilizing reusable materials minimizes construction waste and reduces the environmental impact. One of the key requirements to ensure the effectiveness of earth recycling is a well-designed schedule for the movement of the dump trucks that transport earth materials to their destinations in a timely fashion. Therefore, in this study a mathematical model is developed to plan earth recycling and dump truck dispatching simultaneously from a system optimization perspective. The time–space network technique is adopted to formulate the dump truck and earth material flows in the dimensions of time and space. The model is formulated as a special multiple commodity network flow problem, which is characterized as NP-hard. To solve the real-world large-scale problems in a reasonable time, a heuristic algorithm using problem decomposition and relaxation is proposed. To suitably evaluate the model and algorithm, a case study is performed using actual parameters obtained from a large construction project in Taiwan and statistical data gleaned from government reports. The test results show that the problem can be efficiently solved and the error gap is within 0.5%. The scenario analysis indicates that the proposed framework could also be used for different problem scales. The model, coupled with the solution algorithm, has potential to serve as a planning tool for construction contractors to design optimal schedules for recycling earth materials and dispatching trucks. 出版者： New York: Elsevier Ltd 出版日期： 2012-02-01 出處： Computers & Industrial Engineering, 2012-02, Vol.62 (1), p.108-118 資源來源： Elsevier ScienceDirect Journals Complete 版權： 2011 Elsevier Ltd 版權： Copyright Pergamon Press Inc. Feb 2012 識別號： ISSN: 0360-8352 識別號： EISSN: 1879-0550 識別號： DOI: 10.1016/j.cie.2011.08.022 識別號： CODEN: CINDDL
Appears in Collections:	[Department of Civil Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	17	View/Open

社群 sharing

Loading...