Search results

1 – 2 of 2
Per page
102050
Citations:
Loading...
Access Restricted. View access options
Article
Publication date: 5 March 2018

Hajar Eskandar, Elham Heydari, Mahdi Hasanipanah, Mehrshad Jalil Masir and Ali Mahmodi Derakhsh

Blasting is an economical method for rock breakage in open-pit mines. Backbreak is an undesirable phenomenon induced by blasting operations and has several unsuitable effects such…

175

Abstract

Purpose

Blasting is an economical method for rock breakage in open-pit mines. Backbreak is an undesirable phenomenon induced by blasting operations and has several unsuitable effects such as equipment instability and decreased performance of the blasting. Therefore, accurate estimation of backbreak is required for minimizing the environmental problems. The primary purpose of this paper is to propose a novel predictive model for estimating the backbreak at Shur River Dam region, Iran, using particle swarm optimization (PSO).

Design/methodology/approach

For this work, a total of 84 blasting events were considered and five effective factors on backbreak including spacing, burden, stemming, rock mass rating and specific charge were measured. To evaluate the accuracy of the proposed PSO model, multiple regression (MR) model was also developed, and the results of two predictive models were compared with actual field data.

Findings

Based on two statistical metrics [i.e. coefficient of determination (R2) and root mean square error (RMSE)], it was found that the proposed PSO model (with R2 = 0.960 and RMSE = 0.08) can predict backbreak better than MR (with R2 = 0.873 and RMSE = 0.14).

Originality/value

The analysis indicated that the specific charge is the most effective parameter on backbreak among all independent parameters used in this study.

Details

Engineering Computations, vol. 35 no. 1
Type: Research Article
ISSN: 0264-4401

Keywords

Access Restricted. View access options
Article
Publication date: 13 June 2024

Seyed Mohammad Hadi Baghdadi, Ehsan Dehghani, Mohammad Hossein Dehghani Sadrabadi, Mahdi Heydari and Maryam Nili

Spurred by the high turnover in the pharmaceutical industry, locating pharmacies inside urban areas along with the high product perishability in this industry, the pharmaceutical…

124

Abstract

Purpose

Spurred by the high turnover in the pharmaceutical industry, locating pharmacies inside urban areas along with the high product perishability in this industry, the pharmaceutical supply chain management has recently gained increasing attention. Accordingly, this paper unveils an inventory-routing problem for designing a pharmaceutical supply chain with perishable products and time-dependent travel time in an uncertain environment.

Design/methodology/approach

In this study, mathematical programming is employed to formulate a multi-graph network affected by the traffic volume in order to adapt to real-world situations. Likewise, by transforming the travel speed function to the travel time function using a step-by-step algorithm, the first-in-first-out property is warranted. Moreover, the Box–Jenkins forecasting method is employed to diminish the demand uncertainty.

Findings

An appealing result is that the delivery horizon constraint in the under-study multi-graph network may eventuate in selecting a longer path. Our analysis also indicates that the customers located in the busy places in the city are not predominantly visited in the initial and last delivery horizon, which are the rush times. Moreover, it is concluded that integrating disruption management, routing planning and inventory management in the studied network leads to a reduction of costs in the long term.

Originality/value

Applying the time-dependent travel time with a heterogeneous fleet of vehicles on the multi-graph network, considering perishability in the products for reducing inventory costs, considering multiple trips of transfer fleet, considering disruption impacts on supply chain components and utilizing the Box–Jenkins method to reduce uncertainty are the contributions of the present study.

Details

Kybernetes, vol. ahead-of-print no. ahead-of-print
Type: Research Article
ISSN: 0368-492X

Keywords

1 – 2 of 2
Per page
102050