Search results

A circular economy (CE) is an economic system that tries to eliminate waste and continually use resources. Due to growing environmental concerns, supply chain (SC) design should be based on the CE considerations. In addition, responding and satisfying customers are the challenges managers constantly encounter. This study aims to improve the design of an agile closed-loop supply chain (CLSC) from the CE point of view.

In this research, a new multi-stage, multi-product and multi-period design of a CLSC network under uncertainty is proposed that aligns with the goals of CE and SC participants. Recycling of goods is an important part of the CLSC. Therefore, a multi-objective mixed-integer linear programming model (MILP) is proposed to formulate the problem. Besides, a robust counterpart of multi-objective MILP is offered based on robust optimization to cope with the uncertainty of parameters. Finally, the proposed model is solved using the e-constraint method.

The proposed model aims to provide the strategic choice of economic order to the suppliers and third-party logistic companies. The present study, which is carried out using a numerical example and sensitivity analysis, provides a robust model and solution methodology that are effective and applicable in CE-related problems.

This study shows how all upstream and downstream units of the SC network must work integrated to meet customer needs considering the CE context.

The main goal of the CE is to optimize resources, reduce the use of raw materials, and revitalize waste by recycling. In this study, a comprehensive model that can consider both SC design and CE necessities is developed that considers all SC participants.

To maximize the network total profit by calculating the difference between costs and revenue (first objective function). To maximize the positive impact on the environment by integrating GSCM factors in RL (second objective function). To calculate the efficiency of disassembly centers by SDEA method, which are selected as suppliers and maximize the total efficiency (third objective function). To evaluate the resources and total efficiency of the proposed model to facilitate the allocation resource process, to increase resource efficiency and to improve the efficiency of disassembly centers by Inverse DEA.

The design of a closed-loop logistics network for after-sales service for mobile phones and digital cameras has been developed by the mixed-integer linear programming method (MILP). Development of MILP method has been performed by simultaneously considering three main objectives including: total network profit, green supply chain factors (environmental sustainability) and maximizing the efficiency of disassembly centers. The proposed model of study is a six-level, multi-objective, single-period and multi-product that focuses on electrical waste. The efficiency of product return centers is calculated by SDEA method and the most efficient centers are selected.

The results of using the model in a case mining showed that, due to the use of green factors in network design, environmental pollution and undesirable disposal of some electronic waste were reduced. Also, with the reduction of waste disposal, valuable materials entered the market cycle and the network profit increased.

(1) Design a closed-loop reverse logistics network for after-sales services; (2) Introduce a multi-objective multi-echelon mixed integer linear programming model; (3) Sensitivity analysis use Inverse-DEA method to increase the efficiency of inefficient units; (4) Use the GSC factors and DEA method in reverse logistics network.

In repetitive projects, repetition offers more possibilities for activity scheduling at the sub-activity level. However, existing resource-constrained repetitive scheduling problem (RCRSP) models assume that there is only one sequence in performing the sub-activities of each activity, resulting in an inefficient resource allocation. This paper proposes a novel repetitive scheduling model for solving RCRSP with soft logic.

In this paper, a constraint programming model is developed to solve the RCRSP using soft logic, aiming at the possible relationship between parallel execution, orderly execution or partial parallel and partial orderly execution of different sub activities of the same activity in repetitive projects. The proposed model integrated crew assignment strategies and allowed continuous or fragmented execution.

When solving RCRSP, it is necessary to take soft logic into account. If managers only consider the fixed logic between sub-activities, they are likely to develop a delayed schedule. The practicality and effectiveness of the model were verified by a housing project based on eight different scenarios. The results showed that the constraint programming model outperformed its equivalent mathematical model in terms of solving speed and solution quality.

Available studies assume a fixed logic between sub-activities of the same activity in repetitive projects. However, there is no fixed construction sequence between sub-activities for some projects, e.g. hotel renovation projects. Therefore, this paper considers the soft logic relationship between sub-activities and investigates how to make the objective optimal without violating the resource availability constraint.

Due to its longer length compared to other construction materials and distinctive stacking patterns, obtaining construction steel bars in congested construction sites with limited storage capacity becomes challenging. Lack of storage space in crowded places prompts the need for building steel bar storage choice optimization. Therefore, this study aims to optimize the construction steel bar procurement plan by providing when and how much rebar to order and how to stack different sizes of rebar considering limited storage capacity.

A novel approach has been presented in this paper by integrating 4D building information modelling (BIM) and mixed-integer linear programming (MILP). This technique uses BIM to retrieve material quantities, including rebar, during the design phase. Following that, activities are scheduled depending on the duration determined by crew productivity data and material quantity. Then, based on the prior price, the price of each unit of rebar is projected for the duration of construction using the exponential smoothing method. After that, the MILP approach is used to generate an optimal steel bar procurement plan for limited storage space following the scheduled rebar-related operations.

The developed strategy minimizes overall procurement costs and ensures the storage of rebar as per standard guidelines. An optimal rebar procurement and storage plan to construct a six-storied RC frame has been presented in this paper as a demonstrative example to show the effectiveness of the proposed method.

This work partially satisfies a long-sought research need for establishing a comprehensive construction steel bar procurement system, making it a very useful source of information for practitioners and researchers. The proposed method can be used to minimize a key performance limitation that the conventional rebar procurement practice for crowded building sites may experience.

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.

The study aims to optimize truck routes by minimizing social and economic costs. It introduces a strategy involving diverse drones and their potential for reusing at DNs based on flight range. In HTDRP-DC, trucks can select and transport various drones to LDs to reduce deprivation time. This study estimates the nonlinear deprivation cost function using a linear two-piece-wise function, leading to MILP formulations. A heuristic-based Benders Decomposition approach is implemented to address medium and large instances. Valid inequalities and a heuristic method enhance convergence boundaries, ensuring an efficient solution methodology.

Research has yet to address critical factors in disaster logistics: minimizing the social and economic costs simultaneously and using drones in relief distribution; deprivation as a social cost measures the human suffering from a shortage of relief supplies. The proposed hybrid truck-drone routing problem minimizing deprivation cost (HTDRP-DC) involves distributing relief supplies to dispersed demand nodes with undamaged (LDs) or damaged (DNs) access roads, utilizing multiple trucks and diverse drones. A Benders Decomposition approach is enhanced by accelerating techniques.

Incorporating deprivation and economic costs results in selecting optimal routes, effectively reducing the time required to assist affected areas. Additionally, employing various drone types and their reuse in damaged nodes reduces deprivation time and associated deprivation costs. The study employs valid inequalities and the heuristic method to solve the master problem, substantially reducing computational time and iterations compared to GAMS and classical Benders Decomposition Algorithm. The proposed heuristic-based Benders Decomposition approach is applied to a disaster in Tehran, demonstrating efficient solutions for the HTDRP-DC regarding computational time and convergence rate.

Current research introduces an HTDRP-DC problem that addresses minimizing deprivation costs considering the vehicle’s arrival time as the deprivation time, offering a unique solution to optimize route selection in relief distribution. Furthermore, integrating heuristic methods and valid inequalities into the Benders Decomposition approach enhances its effectiveness in solving complex routing challenges in disaster scenarios.

This study addresses the production optimization of a cellular manufacturing system (CMS) in magnetic production enterprises. Magnetic products and raw materials are more critical to transport than general products because the attraction or repulsion between magnetic poles can easily cause traffic jams. This study needs to address a method to promote the scheduling efficiency of the problem.

To address this problem, this study formulated a mixed-integer linear programming (MILP) model to describe the problem and proposed an auction and negotiation-based approach with a local search to solve it. Auction- and negotiation-based approaches can obtain feasible and high-quality solutions. A local search operator was proposed to optimize the feasible solutions using an improved conjunctive graph model.

Verification tests were performed on a series of numerical examples. The results demonstrated that the proposed auction and negotiation-based approach with a local search operator is better than existing solution methods for the problem identified. Statistical analysis of the experiment results using the Statistical Package for the Social Sciences (SPSS) software demonstrated that the proposed approach is efficient, stable and suitable for solving large-scale numerical instances.

An improved auction and negotiation-based approach was proposed; The conjunctive graph model was also improved to describe the problem of CMS with traffic jam constraint and build the local search operator; The authors’ proposed approach can get better solution than the existing algorithms by testing benchmark instances and real-world instances from enterprises.

Throughout human history, the occurrence of disasters has been inevitable, leading to significant human, financial and emotional consequences. Therefore, it is crucial to establish a well-designed plan to efficiently manage such situations when disaster strikes. The purpose of this study is to develop a comprehensive program that encompasses multiple aspects of postdisaster relief.

A multiobjective model has been developed for postdisaster relief, with the aim of minimizing social dissatisfaction, economic costs and environmental damage. The model has been solved using exact methods for different scenarios. The objective is to achieve the most optimal outcomes in the context of postdisaster relief operations.

A real case study of an earthquake in Haiti has been conducted. The acquired results and subsequent management analysis have effectively assessed the logic of the model. As a result, the model’s performance has been validated and deemed reliable based on the findings and insights obtained.

Ultimately, the model provides the optimal quantities of each product to be shipped and determines the appropriate mode of transportation. Additionally, the application of the epsilon constraint method results in a set of Pareto optimal solutions. Through a comprehensive examination of the presented solutions, valuable insights and analyses can be obtained, contributing to a better understanding of the model’s effectiveness.

This study aims to minimize the cost and time of blood delivery in the whole blood supply chain network (BSCN) in disaster conditions. In other words, integrating all strategic, tactical and operational decisions of three levels of blood collection, processing and distribution leads to satisfying the demand at the right time.

This paper proposes an integrated BSCN in disaster conditions to consider four categories of facilities, including temporary blood collection centers, field hospitals, main blood processing centers and medical centers, to optimize demand response time appropriately. The proposed model applies the location of all permanent and emergency facilities in three levels: blood collection, processing and distribution. Other essential decisions, including multipurpose facilities, emergency transportation, inventory and allocation, were also used in the model. The LP metric method is applied to solve the proposed bi-objective mathematical model for the BSCN.

The findings show that this model clarifies its efficiency in the total cost and blood delivery time reduction, which results in a low carbon transmission of the blood supply chain.

The researchers proposed an integrated BSCN in disaster conditions to minimize the cost and time of blood delivery. They considered multipurpose capabilities for facilities (e.g. field hospitals are responsible for the three purposes of blood collection, processing and distribution), and so locating permanent and emergency facilities at three levels of blood collection, processing and distribution, support facilities, emergency transportation and traffic on the route with pollution were used to present a new model.

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.