Search results

The purpose of this study is to formulate a new class of vehicle routing problem with an objective to minimise the total cost of raw material collection and derive a new approach to solve optimization problems. This study can help to select the optimum number of suppliers based on cost.

To model the raw material vehicle routing problem, a mixed integer linear programming (MILP) problem is formulated. An interesting phenomenon added to the proposed problem is that there is no compulsion to visit all suppliers. To guarantee the demand of semiconductor industry, all visited suppliers should reach a given raw material capacity requirement. To solve the proposed model, the authors developed a novel hybrid approach that is a combination of block and edge recombination approaches. To avoid bias, the authors compare the results of the proposed methodology with other known approaches, such as genetic algorithms (GAs) and ant colony optimisation (ACO).

The findings indicate that the proposed model can be useful in industries, where multiple suppliers are used. The proposed hybrid approach provides a better sequence of suppliers compared to other heuristic techniques.

The data used in the proposed model is generated based on previous literature. The problem derives from the assumption that semiconductor industries use a variety of raw materials.

This study provides a new model and approach that can help practitioners and policymakers select suppliers based on their logistics costs.

This study provides two important contributions in the context of the supply chain. First, it provides a new variant of the vehicle routing problem in consideration of raw material collection; and second, it provides a new approach to solving optimisation problems.

This study presents a systematic literature review (SLR) of the interdisciplinary literature on drones in last-mile delivery (LMD) to extrapolate pertinent insights from and into the logistics management field.

Rooting their analytical categories in the LMD literature, the authors performed a deductive, theory refinement SLR on 307 interdisciplinary journal articles published during 2015–2022 to integrate this emergent phenomenon into the field.

The authors derived the potentials, challenges and solutions of drone deliveries in relation to 12 LMD criteria dispersed across four stakeholder groups: senders, receivers, regulators and societies. Relationships between these criteria were also identified.

This review contributes to logistics management by offering a current, nuanced and multifaceted discussion of drones' potential to improve the LMD process together with the challenges and solutions involved.

The authors provide logistics managers with a holistic roadmap to help them make informed decisions about adopting drones in their delivery systems. Regulators and society members also gain insights into the prospects, requirements and repercussions of drone deliveries.

This is one of the first SLRs on drone applications in LMD from a logistics management perspective.

The paper aims to provide an efficient dispatching schedule for ready-mix concrete (RMC) trucks and create a balance between batch plants and construction sites.

The paper focused on developing a new metaheuristic swarm intelligence algorithm using Java code. The paper used statistical criterion: mean, standard deviation, running time to verify the effectiveness of the proposed optimization method and compared its derivatives with other algorithms, such as genetic algorithm (GA), Tabu search (TS), bee colony optimization (BCO), ant lion optimizer (ALO), grey wolf optimizer (GWO), dragonfly algorithm (DA) and particle swarm optimization (PSO).

The paper proved that integrating GWO and DA yields better results than independent algorithms and some selected algorithms in the literature. It also suggests that multi-independent batch plants could effectively cooperate in a system to deliver RMC to various construction sites.

The paper provides a compelling new hybrid swarm intelligence algorithm and a model allowing multi-independent batch plants to work in a system to deliver RMC. It fulfills an identified need to study how batch plant managers can expand their dispatching network, increase their competitiveness and improve their supply chain operations.

The fluctuations that occurred between the power requirements have shown a higher range of voltage regulations and frequency. The fluctuations are caused because of substantial changes in the energy dissipation. The operational efficiency has been reduced when the power grid is enabled with the help of electric vehicles (EVs) that were created by the power resources. The model showed an active load matching for regulating the power and there occurred a harmonic motion in energy. The main purpose of the proposed research is to handle the energy sources for stabilization which has increased the reliability and improved the power efficiency. This study or paper aims to elaborate the security and privacy challenges present in the vehicle 2 grid (V2G) network and their impact with grid resilience.

The smart framework is proposed which works based on Internet of Things and edge computations that managed to perform an effective V2G operation. Thus, an optimum model for scheduling the charge is designed on each EV to maximize the number of users and selecting the best EV using the proposed ant colony optimization (ACO). At the first, the constructive phase of ACO where the ants in the colony generate the feasible solutions. The constructive phase with local search generates an ACO algorithm that uses the heterogeneous colony of ants and finds effectively the best-known solutions widely to overcome the problem.

The results obtained by the existing in-circuit serial programming-plug-in electric vehicles model in terms of power usage ranged from 0.94 to 0.96 kWh which was lower when compared to the proposed ACO that showed power usage of 0.995 to 0.939 kWh, respectively, with time. The results showed that the energy aware routed with ACO provided feasible routing solutions for the source node that provided the sensor network at its lifetime and security at the time of authentication.

The proposed ACO is aware of energy routing protocol that has been analyzed and compared with the energy utilization with respect to the sensor area network which uses power resources effectively.

Although extensive research has been conducted on precast production, irregular component loading constraints have received little attention, resulting in limitations for transportation cost optimization. Traditional irregular component loading methods are based on past performance, which frequently wastes vehicle space. Additionally, real-time road conditions, precast component assembly times, and delivery vehicle waiting times due to equipment constraints at the construction site affect transportation time and overall transportation costs. Therefore, this paper aims to provide an optimization model for Just-In-Time (JIT) delivery of precast components considering 3D loading constraints, real-time road conditions and assembly time.

In order to propose a JIT (just-in-time) delivery optimization model, the effects of the sizes of irregular precast components, the assembly time, and the loading methods are considered in the 3D loading constraint model. In addition, for JIT delivery, incorporating real-time road conditions in the transportation process is essential to mitigate delays in the delivery of precast components. The 3D precast component loading problem is solved by using a hybrid genetic algorithm which mixes the genetic algorithm and the simulated annealing algorithm.

A real case study was used to validate the JIT delivery optimization model. The results indicated this study contributes to the optimization of strategies for loading irregular precast components and the reduction of transportation costs by 5.38%.

This study establishes a JIT delivery optimization model with the aim of reducing transportation costs by considering 3D loading constraints, real-time road conditions and assembly time. The irregular precast component is simplified into 3D bounding box and loaded with three-space division heuristic packing algorithm. In addition, the hybrid algorithm mixing the genetic algorithm and the simulated annealing algorithm is to solve the 3D container loading problem, which provides both global search capability and the ability to perform local searching. The JIT delivery optimization model can provide decision-makers with a more comprehensive and economical strategy for loading and transporting irregular precast components.

Ready-mix concrete delivery problem (RMCDP), a specific version of the vehicle routing problem (VRP), is a relevant supply-chain engineering task for construction management with various formulations and solving methods. This problem can range from a simple scenario involving one source, one material and one destination to a more challenging and complex case involving multiple sources, multiple materials and multiple destinations. This paper presents an Internet of Things (IoT)-supported active building information modeling (BIM) system for optimized multi-project ready-mix concrete (RMC) delivery.

The presented system is BIM-based, IoT supported, dynamic and automatic input/output exchange to provide an optimal delivery program for multi-project ready-mix-concrete problem. The input parameters are extracted as real-time map-supported IoT data and transferred to the system via an application programming interface (API) into a mixed-integer linear programming (MILP) optimization model developed to perform the optimization. The obtained optimization results are further integrated into BIM by conventional project management tools. To demonstrate the features of the suggested system, an RMCDP example was applied to solve that included four building sites, seven eligible concrete plants and three necessary RMC mixtures.

The system provides the optimum delivery schedule for multiple RMCs to multiple construction sites, as well as the optimum RMC quantities to be delivered, the quantities from each concrete plant that must be supplied, the best delivery routes, the optimum execution times for each construction site, and the total minimal costs, while also assuring the dynamic transfer of the optimized results back into the portfolio of multiple BIM projects. The system can generate as many solutions as needed by updating the real-time input parameters in terms of change of the routes, unit prices and availability of concrete plants.

The suggested system allows dynamic adjustments during the optimization process, andis adaptable to changes in input data also considering the real-time input data. The system is based on spreadsheets, which are widely used and common tool that most stakeholders already utilize daily, while also providing the possibility to apply a more specialized tool. Based on this, the RMCDP can be solved using both conventional and advanced optimization software, enabling the system to handle even large-scale tasks as necessary.

This paper aims to develop a multi-objective problem for scheduling the operations of trucks entering and exiting cross-docks where the number of unloaded or loaded products by trucks is fuzzy logistic. The first objective function minimizes the maximum time to receive the products. The second objective function minimizes the emission cost of trucks. Finally, the third objective function minimizes the number of trucks assigned to the entrance and exit doors.

Two steps are implemented to validate and modify the proposed model. In the first step, two random numerical examples in small dimensions were solved by GAMS software with min-max objective function as well as genetic algorithms (GA) and particle swarm optimization. In the second step, due to the increasing dimensions of the problem and computational complexity, the problem in question is part of the NP-Hard problem, and therefore multi-objective meta-heuristic algorithms are used along with validation and parameter adjustment.

Therefore, non-dominated sorting genetic algorithm (NSGA-II) and non-dominated ranking genetic algorithm (NRGA) are used to solve 30 random problems in high dimensions. Then, the algorithms were ranked using the TOPSIS method for each problem according to the results obtained from the evaluation criteria. The analysis of the results confirms the applicability of the proposed model and solution methods.

This paper proposes mathematical model of truck scheduling for a real problem, including cross-docks that play an essential role in supply chains, as they could reduce order delivery time, inventory holding costs and shipping costs. To solve the proposed multi-objective mathematical model, as the problem is NP-hard, multi-objective meta-heuristic algorithms are used along with validation and parameter adjustment. Therefore, NSGA-II and NRGA are used to solve 30 random problems in high dimensions.

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.

This paper investigates a problem in a reverse logistics (RLs) network to decide whether to dispose of unsold goods in primary stores or re-commercialize them in outlet centers. By deducting the costs associated with each policy from its revenue, this study aims to maximize the profit from managing unsold goods.

A new mixed-integer linear programming model has been developed to address the problem, which considers the selling prices of products in primary and secondary stores and the costs of transportation, cross-docking and returning unwanted items. As a result of uncertain nature of the cost and time parameters, gray numbers are used to deal with it. In addition, an innovative uncertain solution approach for gray programming problems is presented that considers objective function satisfaction level as an indicator of optimism.

According to the results, higher costs, including transportation, cross-docking and return costs, make sending goods to outlet centers unprofitable and more goods are disposed of in primary stores. Prices in primary and secondary stores heavily influence the number of discarded goods. Higher prices in primary stores result in more disposed of goods, while higher prices in secondary stores result in fewer. As a result of the proposed method, the objective function satisfaction level can be viewed as a measure of optimism.

An integral contribution of this study is developing a new mixed-integer linear programming model for selecting the appropriate goods for re-commercialization and choosing the best outlet center based on the products' price and total profit. Another novelty of the proposed model is considering the matching percentage of boxes with secondary stores’ desired product lists and the probability of returning goods due to non-compliance with delivery dates. Moreover, a new uncertain solution approach is developed to solve mathematical programming problems with gray parameters.

This paper aims to introduce a novel structure for the physical internet (PI)–enabled sustainable supplier selection and inventory management problem under uncertain environments.

To address hybrid uncertainty both in the objective function and constraints, a novel interactive hybrid multi-objective optimization solution approach combining Me-based fuzzy possibilistic programming and interval programming approaches is tailored.

Various numerical experiments are introduced to validate the feasibility of the established model and the proposed solution method.

Due to its interconnectedness, the PI has the opportunity to support firms in addressing sustainability challenges and reducing initial impact. The sustainable supplier selection and inventory management have become critical operational challenges in PI-enabled supply chain problems. This is the first attempt on this issue, which uses the presented novel interactive possibilistic programming method.