Search results

This paper aims to propose a simulation-based performance evaluation model for the drone-based delivery of aid items to disaster-affected areas. The objective of the model is to perform analytical studies, evaluate the performance of drone delivery systems for humanitarian logistics and can support the decision-making on the operational design of the system – on where to locate drone take-off points and on assignment and scheduling of delivery tasks to drones.

This simulation model captures the dynamics and variabilities of the drone-based delivery system, including demand rates, location of demand points, time-dependent parameters and possible failures of drones’ operations. An optimization model integrated with the simulation system can update the optimality of drones’ schedules and delivery assignments.

An extensive set of experiments was performed to evaluate alternative strategies to demonstrate the effectiveness for the proposed optimization/simulation system. In the first set of experiments, the authors use the simulation-based evaluation tool for a case study for Central Florida. The goal of this set of experiments is to show how the proposed system can be used for decision-making and decision-support. The second set of experiments presents a series of numerical studies for a set of randomly generated instances.

The goal is to develop a simulation system that can allow one to evaluate performance of drone-based delivery systems, accounting for the uncertainties through simulations of real-life drone delivery flights. The proposed simulation model captures the variations in different system parameters, including interval of updating the system after receiving new information, demand parameters: the demand rate and their spatial distribution (i.e. their locations), service time parameters: travel times, setup and loading times, payload drop-off times and repair times and drone energy level: battery’s energy is impacted and requires battery change/recharging while flying.

Although disassembly balancing lines has been studied for over two decades, there is a gap in the robotic disassembly. Moreover, combination of problem with heterogeneous employee assignment is also lacking. The hazard related with the tasks performed on disassembly lines on workers can be reduced by the use of robots or collaborative robots (cobots) instead of workers. This situation causes an increase in costs. The purpose of the study is to propose a novel version of the problem and to solve this bi-objective (minimizing cost and minimizing hazard simultaneously) problem.

The epsilon constraint method was used to solve the bi-objective model. Entropy-based Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) and Preference Ranking Organization methods for Enrichment Evaluation (PROMETHEE) methods were used to support the decision-maker. In addition, a new criterion called automation rate was proposed. The effects of factors were investigated with full factor experiment design.

The effects of all factors were found statistically significant on the solution time. The combined effect of the number of tasks and number of workers was also found to be statistically significant.

In this study, for the first time in the literature, a disassembly line balancing and employee assignment model was proposed in the presence of heterogeneous workers, robots and cobots to simultaneously minimize the hazard to the worker and cost.

The article addresses the optimization of safety stock service levels for parts in a repair kit. The work was undertaken to assist a public transit entity that stores thousands of parts used to repair equipment acquired over many decades. Demand is intermittent, procurement lead times are long, and the total inventory investment is significant.

Demand exists for repair kits, and a repair cannot start until all required parts are available. The cost model includes holding cost to carry the part being modeled as well as shortage cost that consists of the holding cost to carry all other repair kit parts for the duration of the part’s lead time. The model combines deterministic and stochastic approaches by assuming a fixed ordering cycle with Poisson demand.

The results show that optimal service levels vary as a function of repair demand rate, part lead time, and cost of the part as a percentage of the total part cost for the repair kit. Optimal service levels are higher for inexpensive parts and lower for expensive parts, although the precise levels are impacted by repair demand and part lead time.

The proposed model can impact society by improving the operational performance and efficiency of public transit systems, by ensuring that home repair technicians will be prepared for repair tasks, and by reducing the environmental impact of electronic waste consistent with the right-to-repair movement.

The optimization model is unique because (1) it quantifies shortage cost as the cost of unnecessary holding other parts in the repair kit during the shortage time, and (2) it determines a unique service level for each part in a repair kit bases on its lead time, its unit cost, and the total cost of all parts in the repair kit. Results will be counter-intuitive for many inventory managers who would assume that more critical parts should have higher service levels.

This study aims to propose novel edge device-tailored federated learning algorithms of local classifiers (stochastic gradient descent, support vector machines), namely, FL-lSGD and FL-lSVM. These algorithms are designed to address the challenge of large-scale ImageNet classification.

The authors’ FL-lSGD and FL-lSVM trains in a parallel and incremental manner to build an ensemble local classifier on Raspberry Pis without requiring data exchange. The algorithms load small data blocks of the local training subset stored on the Raspberry Pi sequentially to train the local classifiers. The data block is split into k partitions using the k-means algorithm, and models are trained in parallel on each data partition to enable local data classification.

Empirical test results on the ImageNet data set show that the authors’ FL-lSGD and FL-lSVM algorithms with 4 Raspberry Pis (Quad core Cortex-A72, ARM v8, 64-bit SoC @ 1.5GHz, 4GB RAM) are faster than the state-of-the-art LIBLINEAR algorithm run on a PC (Intel(R) Core i7-4790 CPU, 3.6 GHz, 4 cores, 32GB RAM).

Efficiently addressing the challenge of large-scale ImageNet classification, the authors’ novel federated learning algorithms of local classifiers have been tailored to work on the Raspberry Pi. These algorithms can handle 1,281,167 images and 1,000 classes effectively.

In the current era of Industry 4.0, the manufacturing industries are striving toward mass production with mass customization by considering human–robot collaboration. This study aims to propose the reconfiguration of assembly systems by incorporating multiple humans with robots using a human–robot task allocation (HRTA) to enhance productivity.

A human–robot task scheduling approach has been developed by considering task suitability, resource availability and resource selection through multicriteria optimization using the Linear Regression with Optimal Point and Minimum Distance Calculation algorithm. Using line-balancing techniques, the approach estimates the optimum number of resources required for assembly tasks operating by minimum idle time.

The task allocation schedule for a case study involving a punching press was solved using human–robot collaboration, and the approach incorporated the optimum number of appropriate resources to handle different types of proportion of resources.

This proposed work integrates the task allocation by human–robot collaboration and decrease the idle time of resource by integrating optimum number of resources.

The author develops a bilateral Nash bargaining model under value uncertainty and private/asymmetric information, combining ideas from axiomatic and strategic bargaining theory. The solution to the model leads organically to a two-tier stochastic frontier (2TSF) setup with intra-error dependence. The author presents two different statistical specifications to estimate the model, one that accounts for regressor endogeneity using copulas, the other able to identify separately the bargaining power from the private information effects at the individual level. An empirical application using a matched employer–employee data set (MEEDS) from Zambia and a second using another one from Ghana showcase the applied potential of the approach.

Cloud computing (CC) refers to the usage of virtualization technology to share computing resources through the internet. Task scheduling (TS) is used to assign computational resources to requests that have a high volume of pending processing. CC relies on load balancing to ensure that resources like servers and virtual machines (VMs) running on real servers share the same amount of load. VMs are an important part of virtualization, where physical servers are transformed into VM and act as physical servers during the process. It is possible that a user’s request or data transmission in a cloud data centre may be the reason for the VM to be under or overloaded with data.

VMs are an important part of virtualization, where physical servers are transformed into VM and act as physical servers during the process. It is possible that a user’s request or data transmission in a cloud data centre may be the reason for the VM to be under or overloaded with data. With a large number of VM or jobs, this method has a long makespan and is very difficult. A new idea to cloud loads without decreasing implementation time or resource consumption is therefore encouraged. Equilibrium optimization is used to cluster the VM into underloaded and overloaded VMs initially in this research. Underloading VMs is used to improve load balance and resource utilization in the second stage. The hybrid algorithm of BAT and the artificial bee colony (ABC) helps with TS using a multi-objective-based system. The VM manager performs VM migration decisions to provide load balance among physical machines (PMs). When a PM is overburdened and another PM is underburdened, the decision to migrate VMs is made based on the appropriate conditions. Balanced load and reduced energy usage in PMs are achieved in the former case. Manta ray foraging (MRF) is used to migrate VMs, and its decisions are based on a variety of factors.

The proposed approach provides the best possible scheduling for both VMs and PMs. To complete the task, improved whale optimization algorithm for Cloud TS has 42 s of completion time, enhanced multi-verse optimizer has 48 s, hybrid electro search with a genetic algorithm has 50 s, adaptive benefit factor-based symbiotic organisms search has 38 s and, finally, the proposed model has 30 s, which shows better performance of the proposed model.

User’s request or data transmission in a cloud data centre may cause the VMs to be under or overloaded with data. To identify the load on VM, initially EQ algorithm is used for clustering process. To figure out how well the proposed method works when the system is very busy by implementing hybrid algorithm called BAT–ABC. After the TS process, VM migration is occurred at the final stage, where optimal VM is identified by using MRF algorithm. The experimental analysis is carried out by using various metrics such as execution time, transmission time, makespan for various iterations, resource utilization and load fairness. With its system load, the metric gives load fairness. How load fairness is worked out depends on how long each task takes to do. It has been added that a cloud system may be able to achieve more load fairness if tasks take less time to finish.

Pre-positioning and distributing relief items are important parts of disaster management as it simultaneously considers activities from both pre- and post-disaster stages. This study aims to address this problem with a novel mathematical model.

In this research, a bi-objective mixed-integer linear programming model is developed to tackle pre-positioning and distributing relief items, and it is formulated as an integrated location-allocation-routing problem with uncertain parameters. The humanitarian supply chain consists of relief facilities (RFs) and demand points (DPs). Perishable and imperishable relief commodities (RCs), different types of vehicles, different transportation modes, a time window for delivering perishable commodities and the occurrence of unmet demand are considered. A scenario-based game theory is applied for purchasing RCs from different suppliers and an integrated best-worst method-technique for order of preference by similarity to ideal solution technique is implemented to determine the importance of DPs. The proposed model is used to solve several random test problems for verification, and to validate the model, Iran’s flood in 2019 is investigated as a case study for which useful managerial insights are provided.

Managers can effectively adjust their preferences towards response time and total cost of the network and use sensitivity analysis results in their decisions.

The model locates RFs, allocates DPs to RFs in the pre-disaster stage, and determines the routing of RCs from RFs to DPs in the post-disaster stage with respect to minimizing total costs and response time of the humanitarian logistics network.

Following the recent rise in generative artificial intelligence (GenAI) tools, fundamental questions about their wider impacts have started to reverberate around various disciplines. This study aims to track the unfolding landscape of general issues surrounding GenAI tools and to elucidate the specific opportunities and limitations of these tools as part of the technology-assisted enhancement of mechanical engineering education and professional practices.

As part of the investigation, the authors conduct and present a brief scientometric analysis of recently published studies to unravel the emerging trend on the subject matter. Furthermore, experimentation was done with selected GenAI tools (Bard, ChatGPT, DALL.E and 3DGPT) for mechanical engineering-related tasks.

The study identified several pedagogical and professional opportunities and guidelines for deploying GenAI tools in mechanical engineering. Besides, the study highlights some pitfalls of GenAI tools for analytical reasoning tasks (e.g., subtle errors in computation involving unit conversions) and sketching/image generation tasks (e.g., poor demonstration of symmetry).

To the best of the authors’ knowledge, this study presents the first thorough assessment of the potential of GenAI from the lens of the mechanical engineering field. Combining scientometric analysis, experimentation and pedagogical insights, the study provides a unique focus on the implications of GenAI tools for material selection/discovery in product design, manufacturing troubleshooting, technical documentation and product positioning, among others.

Project managers bear the responsibility of selecting and developing resource scheduling methods that align with project requirements and organizational circumstances. This study focuses on resource-constrained project scheduling in multi-project environments. The research simplifies the problem by adopting a single-project perspective using gain coefficients.

It employs uncertainty theory and multi-objective programming to construct a model. The optimal solution is identified using Matlab, while LINGO determines satisfactory alternatives. By combining these methods and considering actual construction project situations, a compromise solution closely approximating the optimal one is derived.

The study provides fresh insights into modeling and resolving resource-constrained project scheduling issues, supported by real-world examples that effectively illustrate its practical significance.

The research highlights three main contributions: effective resource utilization, project prioritization and conflict management, and addressing uncertainty. It offers decision support for project managers to balance resource allocation, resolve conflicts, and adapt to changing project demands.