Optimal Earthmoving Fleet Size for Minimising Emissions and Cost
نویسندگان
چکیده مقاله:
Traditionally, the earthmoving operations have been developed based on the minimum cost per production criterion. Nowadays, due to the negative impacts of the emissions on the environment, there is an increasing public awareness to reduce the emissions from the earthmoving operations. Different management strategies can be employed to reduce emissions, amongst other things, which can also result in a reduction in the operational costs. This paper aims to examine the cost and emissions related to the earthmoving equipment from an operational standpoint. The queue theory is used in order to demonstrate that the optimum cost per production fleet size and the optimum emissions per production coincide. The linear and non-linear server utilization functions are employed to present a general optimization proof independent from any specific case study. The findings of this research work provide a better understanding of the relationship between the emissions and cost and how the under-trucking and over-trucking conditions affect the productivity and environmental affairs in the earthmoving operations.
منابع مشابه
Optimal Fleet Selection for Earthmoving Operations
Earthmoving operations often involve a large number of specially designed equipment with significant purchasing/leasing prices, high operating and maintenance costs. Hence, choosing the right fleet is a major concern from the construction planners’ point of view. This paper presents a methodology that combines discrete-event simulation and optimization to solve the optimal fleet selection probl...
متن کاملDynamically optimal trajectories for earthmoving excavators
16 17 18 19 20 21 22 23 Article history: Accepted 10 December 2012 Available online xxxx
متن کاملEmission and Cost Configurations in Earthmoving Operations
A. S. Kaboli · D. G. Carmichael · Emission and Cost Configurations in Earthmoving Operations · pp 393-402 Introduction Earthmoving operations typically involve a fleet of trucks cycling between an excavator/loader and dump points. The analysis to obtain the optimum fleet size based on minimum cost per production (unit costs) is well-established, whereas little attention has been paid to the min...
متن کاملThree New Heuristic Algorithms For The Fleet Size And Mix Green Vehicle Routing Problem
In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capac...
متن کاملCost-Minimising Strategies for Data Labelling: Optimal Stopping and Active Learning
Supervised learning deals with the inference of a distribution over an output or label space Y conditioned on points in an observation space X , given a training dataset D of pairs in X ×Y. However, in a lot of applications of interest, acquisition of large amounts of observations is easy, while the process of generating labels is time-consuming or costly. One way to deal with this problem is a...
متن کاملHomogeneous Optimal Fleet
The structure of chains in the optimal chain decomposition of a periodic schedule S is investigated. A finite oriented graph termed the Linis Graph (LG) is defined which serves as the key for this investigation. The edges of the LG are trip-types of S and the vertices of the LG represent terminals. It is proved that there is an Euler cycle for a connected LG satisfying natural precedence relati...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 11 شماره 4
صفحات 949- 965
تاریخ انتشار 2020-10-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023