Search results

The cross-docking strategy has a significant influence on supply chain and logistics efficiency. This paper aims to investigate the most suitable and efficient way to schedule the transfer of logistics activities and present a meta-heuristic method of the truck scheduling problem in cross-docking logistics. A truck scheduling problem with products time window is investigated with objectives of minimizing the total product transshipment time and earliness and tardiness cost of outbound trucks.

This research proposed a meta-heuristic method for the truck scheduling problem with products time window. To solve the problem, a lower bound of the problem is built through a novel two-stage Lagrangian relaxation problem and on account of the NP-hard nature of the truck scheduling problem, the novel red deer algorithm with the mechanism of the heuristic oscillating local search algorithm, as well as adaptive memory programming was proposed to overcome the inferior capability of the original red deer algorithm in the aspect of local search and run time.

Theory analysis and simulation experiments on an industrial case of a cross-docking center with a product’s time window are conducted in this paper. Satisfactory results show that the performance of the red deer algorithm is enhanced due to the mechanism of heuristic oscillating local search algorithm and adaptive memory programming and the proposed method efficiently solves the real-world size case of truck scheduling problems in cross-docking with product time window.

The consideration of products time window has very realistic significance in different logistics applications such as cold-chain logistics and pharmaceutical supply chain. Furthermore, the novel adaptive memory red deer algorithm could be modified and applied to other complex optimization scheduling problems such as scheduling problems considering energy-efficiency or other logistics strategies.

For the first time in the truck scheduling problem with the cross-docking strategy, the product’s time window is considered. Furthermore, a mathematical model with objectives of minimizing the total product transshipment time and earliness and tardiness cost of outbound trucks is developed. To solve the proposed problem, a novel adaptive memory red deer algorithm with the mechanism of heuristic oscillating local search algorithm was proposed to overcome the inferior capability of genetic algorithm in the aspect of local search and run time.

The purpose of this paper is to evaluate the health‐states of unit under test (UUT) in aerospace systems by means of unreliable test outcomes, and the evaluation results can provide a guide for engineers to carry out proper maintenance prior to total failure.

In this paper, the authors formulate the health‐state evaluation (HSE) problem with unreliable test outcomes based on Bayes rule, and develop the Lagrangian relaxation and adaptive genetic algorithm (LRAGA) to solve it. The solution scheme can be viewed as a two‐level coordinated solution framework for the HSE problem. At the top level, the Lagrange multipliers are updated by using AGA. At the bottom level, each of the sub‐problems is solved by using AGA.

The experimental results show that the HSE model appears promising and the LRAGA can obtain the higher quality solution and converge to it at a faster rate than conventional methods (i.e. Lagrangian relaxation (LR), genetic algorithm (GA), simulated annealing (SA) and Lagrangian relaxation and genetic algorithm (LRGA).

The proposed method for the HSE problem of large‐scale systems which include thousands of faults and tests needs to be verified further.

The HSE results for aerospace systems can help engineers to carry out a schedule for prompt maintenance prior to UUTs' failure, to avoid the consequences of total failure. It is important to improve aerospace systems' safety, reliability, maintainability, affordability, and reduce life cycle cost.

This paper constructs the HSE model with unreliable test outcomes based on the Bayes rule and proposes a method based on LRAGA to solve the HSE problem.

Integrating project scheduling and material ordering problems is vital in realistically estimating project cost and duration. Also, the quality level of materials is important as one of the key project success factors.

In this paper, a three-objective mathematical model is presented for green project scheduling with materials ordering problems considering rental resources. The first objective is to minimize the total cost of the project site and logistics. The second objective is to minimize the environmental impacts of producing materials and the third objective is to maximize the total quality of materials. Since costs trigger several challenges in projects, cost constraints are considered in this model for the first time and also the cost of delay in supplying of materials by the suppliers has been deducted from the project costs. Subsequently, the model was implemented in a real case and solved by the Lagrangian Relaxation algorithm as an exact method on GAMS software for model validation.

Based on sensitivity analysis of some parameters, the findings indicate that the cost constraint and lead time have considerable effects on the project duration. Also, integrating project scheduling and material ordering improves the robustness of the project schedule.

The primary contributions of the present research can be stated as follows: considering the cost constraints in the project scheduling with material ordering problem, incorporating the rental resources and taking the quality levels of materials as well as the environmental impacts into account.

Effective inventory management is very critical to market success. The purpose of this paper is to formulate an integrated model for the location of warehouse, the allocation of retailers to the opened warehouses, and finding the perfect policy for inventory control to managing order quantity and safety stock level. The goal is to select the optimum numbers, locations, capacities of the opening warehouses and inventory policy so that all stochastic customer demands can be satisfied.

It is assumed that the location of plant has already been determined and the paper answers the following questions: what are the location decisions over the planning horizon? How retailers are allocated to the warehouses? What are the optimum capacities for the opened warehouses? What is the best inventory policy for this supply chain? What are the total minimum costs?

The model was developed as a non‐linear mixed integer programming and solved using Lagrange relaxation and sub‐gradient search for the location/allocation module and a procedure for the capacity planning module. The results for the randomly selected problems show that the average duality gap ranges are between 0.51 and 1.58 percent. Also, from the CPU time point of view, the performance of the proposed algorithm was very good.

The paper addresses an integrated location, allocation, and inventory decisions in the design of a supply chain distribution network. In addition sensitivity analyses are conducted to evaluate the effects of the multi‐capacity levels on some performance measures.

This study aims to design a reliable multi-level, multi-product and multi-period location-inventory-routing three-echelon supply chain network, which considers disruption risks and uncertainty in the inventory system.

A robust optimization approach is used to deal with the effects of uncertainty, and a mixed-integer nonlinear programming multi-objective model is proposed. The first objective function seeks to minimize inventory costs, such as ordering costs, holding costs and carrying costs. It also helps to choose one of the two modes of bearing the expenses of shortage or using the excess capacity to produce at the expense of each. The second objective function seeks to minimize the risk of disruption in distribution centers and suppliers, thereby increasing supply chain reliability. As the proposed model is an non-deterministic polynomial-time-hard model, the Lagrangian relaxation algorithm is used to solve it.

The proposed model is applied to a real supply chain in the aftermarket automotive service industry. The results of the model and the current status of the company under study are compared, and suggestions are made to improve the supply chain performance. Using the proposed model, companies are expected to manage the risk of supply chain disruptions and pay the lowest possible costs in the event of a shortage. They can also use reverse logistics to minimize environmental damage and use recycled goods.

In this paper, the problem definition is based on a real case; it is about the deficiencies in the after-sale services in the automobile industry. It considers the disruption risk at the first level of the supply chain, selects the supplier considering the parameters of price and disruption risk and examines surplus capacity over distributors’ nominal capacity.

To improve accuracy and efficiency of multi‐fault recognition and localization for large‐scale system such as satellite.

First, fault propagations of a system are modeled by a digraph, which composes of nodes and arcs. Each arc is associated with information about propagation probability and propagation strength. Then, based on consistency‐based theory and semantic theory of abstractions, hierarchical diagnosis model of a system is built. Finally, according to a two‐way hierarchical diagnosis strategy, two incorporated algorithms are adopted which are the Lagrangian relaxation algorithm and the “method of propagation strength”.

Hierarchical model can greatly improve efficiency of diagnosis compared with un‐hierarchical one. The combined qualitative and quantitative knowledge can improve fault resolution.

The propagation probability and propagation strength must been known.

The method shows its superiority when it is applied to complex system such as spacecraft.

A novel hierarchical framework for large‐scale system multi‐fault diagnosis, which include some new ideas and algorithm is put forward.

The purpose of the paper is to solve hydrothermal scheduling (HTS) problem for energy-efficient management by allocating the optimal real power outputs for thermal and hydroelectric generators.

HTS can be formulated as a complex and non-linear optimization problem which minimizes the total fuel cost and emissions of thermal generators subject to various physical and operational constraints. As the artificial bee colony algorithm has proven its ability to solve various engineering optimization problems, it has been used as a main optimization tool to solve the fixed-head HTS problem.

A meta-heuristic search technique-based algorithm has been implemented for hydrothermal energy management, and the simulation results show that this approach can provide trade-off between conflict objectives and keep a rapid convergence speed.

The proposed methodology is implemented on the standard test system, and the numerical results comparison indicates a considerable saving in total fuel cost and reduction in emission.

In this paper, multi-period location–inventory–routing problem (LIRP) considering different vehicles with various capacities has been investigated for the supply chain of red meat. The purpose of this paper is to reduce variable and fixed costs of transportation and production, holding costs of red meat, costs of meeting livestock needs and refrigerator rents.

The considered supply chain network includes five echelons. Demand considered for each customer is approximated as deterministic using historical data. The modeling is performed on a real case. The presented model is a linear mixed-integer programming model. The considered model is solved using general algebraic modeling system (GAMS) software for data set of the real case.

A real-world case is solved using the proposed method. The obtained results have shown a reduction of 4.20 per cent in final price of red meat. Also, it was observed that if the time periods changed from month to week, the final cost of meat per kilogram would increase by 43.26 per cent.

This paper presents a five-echelon LIRP for the meat supply chain in which vehicles are considered heterogeneous. To evaluate the capability of the presented model, a real case is solved in Iran and its results are compared with the real conditions of a firm, and the rate of improvement is presented. Finally, the impact of the changed time period on the results of the solution is examined.

This study focuses on a specific method of meat production that involves carcass purchase and meat production by packing facilities with a novel two-stage model that simultaneously considers location-routing and inventory-production operating decisions. The considered problem aims to reduce variable and fixed transportation and production costs, inventory holding cost and the cost of opening cold storage facilities.

The proposed model encompasses a two-stage model consisting of a single-echelon and a three-echelon many-to-many network with deterministic demand. The proposed model is a mixed-integer linear programming (MILP) model which was tested with the general algebraic modelling system (GAMS) software for a real-world case study in Iran. A sensitivity analysis was performed to examine the effect of retailers' holding capacity and supply capacity at carcass suppliers.

In this research, the number of products transferred at each level, the number of products held, the quantity of red meat produced, the required cold storage facilities and the required vehicles were optimally specified. The outcomes indicated a two percent (2%) decrease in cost per kg of red meat. Eventually, the outcomes of the first and second sensitivity analysis indicated that reduced retailers' holding capacity and supply capacity at carcass suppliers leads to higher total costs.

This research proposes a novel multi-period location-inventory-routing problem for the red meat supply chain in an emerging economy with a heterogeneous vehicle fleet and logistics decisions. The proposed model is presented in two stages and four-echelon including carcass suppliers, packing facilities, cold storage facilities and retailers.

The purpose of this study is to develop an integrated model for the stochastic multiproject scheduling and material ordering problems, where some of the prominent features of offshore projects and their environmental-degrading effects have been embraced as well. The durations of activities are uncertain in this model. The developed formulation is tri-objective that seeks to minimize the expected time, total cost and CO₂ emission of all projects.

A new version of the multiobjective multiagent optimization (MOMAO) algorithm has been proposed to solve the amalgamated model. To empower the MOMAO, various procedures of this algorithm have been modified based on the multiattribute utility theory (MAUT) technique. Along with the MOMAO, this study has employed four other meta-heuristic methodologies to solve the model as well.

The outputs of the MOMAO have been put to test against four other optimizers in terms of convergence, diversity, uniformity and computation times. The results of the Mean Ideal Distance (MID) metric have revealed that the MOMAO has strongly prevailed its rival optimizers. In terms of diversity of the acquired solutions, the MOMAO has ranked the first among all employed optimizers since this algorithm has offered the best solutions in 56.66 and 63.33% of the test problems regarding the diversification metric and hyper-volume metrics. Regarding the uniformity of results, which is measured through the spacing metric (SP), the MOMAO has presented the best SP values in more than 96% of the test problems. The MOMAO has needed more computation times in comparison to its rivals.

A real case study comprising two concurrent offshore projects has been offered. The proposed formulation and the MOMAO have been implemented for this case study, and their effectiveness has been appraised.

Very few studies have focused on presenting an integrated formulation for the stochastic multiproject scheduling and material ordering problems. The model embraces some of the characteristics of the offshore projects which have not been adequately studied in the literature. Limited capacities of the offshore platforms and cargo vessels have been embedded in the proposed model. The offshore platforms have spatial limitations in storing the required materials. The vessels are also capacitated and they also have limited shipment capacities. Some of the required materials need to be transported from the base to the offshore platform via a fleet of cargo vessels. The workforces and equipment can become idle on the offshore platform due to material shortage. Various offshore-related costs have been integrated as a minimization objective function in the model. The cargo vessels release CO₂ detrimental emissions to the environment which are sought to be minimized in the developed formulation. To the best of the authors' knowledge, the MOMAO has not been sufficiently employed as a solution methodology for the stochastic multiproject scheduling and material ordering problems.