21,810 research outputs found

    An evolutionary approach for multi-objective optimization of the integrated location-inventory distribution network problem in vendor-managed inventory

    Get PDF
    [[abstract]]Vendor-managed inventory (VMI) is one of the emerging solutions for improving the supply chain efficiency. It gives the supplier the responsibility to monitor and decide the inventory replenishments of their customers. In this paper, an integrated location-inventory distribution network problem which integrates the effects of facility location, distribution, and inventory issues is formulated under the VMI setup. We presented a Multi-Objective Location-Inventory Problem (MOLIP) model and investigated the possibility of a multi-objective evolutionary algorithm based on the Non-dominated Sorting Genetic Algorithm (NSGA2) for solving MOLIP. To assess the performance of our approach, we conduct computational experiments with certain criteria. The potential of the proposed approach is demonstrated by comparing to a well-known multi-objective evolutionary algorithm. Computational results have presented promise solutions for different sizes of problems and proved to be an innovative and efficient approach for many difficult-to-solve problems.[[incitationindex]]SCI[[booktype]]çŽ™æœŹ[[booktype]]電歐

    Solving closed-loop supply chain problems using game theoretic particle swarm optimisation

    Full text link
    © 2018, © 2018 Informa UK Limited, trading as Taylor & Francis Group. In this paper, we propose a closed-loop supply chain network configuration model and a solution methodology that aim to address several research gaps in the literature. The proposed solution methodology employs a novel metaheuristic algorithm, along with the popular gradient descent search method, to aid location-allocation and pricing-inventory decisions in a two-stage process. In the first stage, we use an improved version of the particle swarm optimisation (PSO) algorithm, which we call improved PSO (IPSO), to solve the location-allocation problem (LAP). The IPSO algorithm is developed by introducing mutation to avoid premature convergence and embedding an evolutionary game-based procedure known as replicator dynamics to increase the rate of convergence. The results obtained through the application of IPSO are used as input in the second stage to solve the inventory-pricing problem. In this stage, we use the gradient descent search method to determine the selling price of new products and the buy-back price of returned products, as well as inventory cycle times for both product types. Numerical evaluations undertaken using problem instances of different scales confirm that the proposed IPSO algorithm performs better than the comparable traditional PSO, simulated annealing (SA) and genetic algorithm (GA) methods

    A Multi-objective Evolutionary Optimization Approach for an Integrated Location-Inventory Distribution Network Problem under Vendor-Managed Inventory Systems

    Get PDF
    [[abstract]]In this paper, we propose an integrated model to incorporate inventory control decisions—such as economic order quantity, safety stock and inventory replenishment decisions—into typical facility location models, which are used to solve the distribution network design problem. A simultaneous model is developed considering a stochastic demand, modeling also the risk poling phenomenon. Multi-objective decision analysis is adopted to allow use of a performance measurement system that includes cost, customer service levels (fill rates), and flexibility (responsive level). This measurement system provides more comprehensive measurement of supply chain system performance than do traditional, single measure approaches. A multi-objective location-inventory model which permits a comprehensive trade-off evaluation for multi-objective optimization is initially presented. More specifically, a multiobjective evolutionary algorithm is developed to determine the optimal facility location portfolio and inventory control parameters in order to reach best compromise of these conflicting criteria. An experimental study using practical data was then illustrated for the possibility of the proposed approach. Computational results have presented promising solutions in solving a practical-size problem with 50 buyers and 15 potential DCs and proved to be an innovative and efficient approach for so called difficult-to-solve problems.[[incitationindex]]SCI[[booktype]]çŽ™æœŹ[[booktype]]電歐

    Evolutionary multiobjective optimization of the multi-location transshipment problem

    Full text link
    We consider a multi-location inventory system where inventory choices at each location are centrally coordinated. Lateral transshipments are allowed as recourse actions within the same echelon in the inventory system to reduce costs and improve service level. However, this transshipment process usually causes undesirable lead times. In this paper, we propose a multiobjective model of the multi-location transshipment problem which addresses optimizing three conflicting objectives: (1) minimizing the aggregate expected cost, (2) maximizing the expected fill rate, and (3) minimizing the expected transshipment lead times. We apply an evolutionary multiobjective optimization approach using the strength Pareto evolutionary algorithm (SPEA2), to approximate the optimal Pareto front. Simulation with a wide choice of model parameters shows the different trades-off between the conflicting objectives

    Stochastic make-to-stock inventory deployment problem: an endosymbiotic psychoclonal algorithm based approach

    Get PDF
    Integrated steel manufacturers (ISMs) have no specific product, they just produce finished product from the ore. This enhances the uncertainty prevailing in the ISM regarding the nature of the finished product and significant demand by customers. At present low cost mini-mills are giving firm competition to ISMs in terms of cost, and this has compelled the ISM industry to target customers who want exotic products and faster reliable deliveries. To meet this objective, ISMs are exploring the option of satisfying part of their demand by converting strategically placed products, this helps in increasing the variability of product produced by the ISM in a short lead time. In this paper the authors have proposed a new hybrid evolutionary algorithm named endosymbiotic-psychoclonal (ESPC) to decide what and how much to stock as a semi-product in inventory. In the proposed theory, the ability of previously proposed psychoclonal algorithms to exploit the search space has been increased by making antibodies and antigen more co-operative interacting species. The efficacy of the proposed algorithm has been tested on randomly generated datasets and the results compared with other evolutionary algorithms such as genetic algorithms (GA) and simulated annealing (SA). The comparison of ESPC with GA and SA proves the superiority of the proposed algorithm both in terms of quality of the solution obtained and convergence time required to reach the optimal/near optimal value of the solution

    An ESPC algorithm based approach to solve inventory deployment problem

    Get PDF
    Global competitiveness has enforced the hefty industries to become more customized. To compete in the market they are targeting the customers who want exotic products, and faster and reliable deliveries. Industries are exploring the option of satisfying a portion of their demand by converting strategically placed products, this helps in increasing the variability of product produced by them in short lead time. In this paper, authors have proposed a new hybrid evolutionary algorithm named Endosymbiotic-Psychoclonal (ESPC) algorithm to determine the amount and type of product to stock as a semi product in inventory. In the proposed work the ability of previously proposed Psychoclonal algorithm to exploit the search space has been increased by making antibodies and antigen more cooperative interacting species. The efficacy of the proposed algorithm has been tested on randomly generated datasets and the results obtained, are compared with other evolutionary algorithms such as Genetic Algorithm (GA) and Simulated Annealing (SA). The comparison of ESPC with GA and SA proves the superiority of the proposed algorithm both in terms of quality of the solution obtained, and convergence time required to reach the optimal /near optimal value of the solution

    A Neuroevolutionary Approach to Stochastic Inventory Control in Multi-Echelon Systems

    Get PDF
    Stochastic inventory control in multi-echelon systems poses hard problems in optimisation under uncertainty. Stochastic programming can solve small instances optimally, and approximately solve larger instances via scenario reduction techniques, but it cannot handle arbitrary nonlinear constraints or other non-standard features. Simulation optimisation is an alternative approach that has recently been applied to such problems, using policies that require only a few decision variables to be determined. However, to find optimal or near-optimal solutions we must consider exponentially large scenario trees with a corresponding number of decision variables. We propose instead a neuroevolutionary approach: using an artificial neural network to compactly represent the scenario tree, and training the network by a simulation-based evolutionary algorithm. We show experimentally that this method can quickly find high-quality plans using networks of a very simple form
    • 

    corecore