Enhanced chromosome repairing mechanism based genetic algorithm approach for the multi-period perishable production inventory-routing problem
Authors
Abstract:
One of the important aspects of distribution optimization problems is simultaneously, controlling the inventory while devising the best vehicle routing, which is a famous problem, called inventory-routing problem (IRP). When the lot-sizing decisions are jointed with IRP, the problem will get more complicated called production inventory-routing problem (PIRP). To become closer to the real life problems that includes products that have a limited life time like foods, it seems reasonable to narrow down the PIRP problem to the perishable products, which is perishable-production inventory-routing problem (P-PIRP). This paper addresses a P-PIRP in a two echelon supply chain system where the vendor must decide when and how much to produce and deliver products to the customer’s warehouse. Here, the general model of PIRP as mixed integer programming (MIP)is adopted and the perishability constraint are added in order to solve the P-PIRP problems. Due to the complexity of problem, providing solution for the medium to large instances cannot be easily achieved by business applications, and then using the meta-heuristics is unavoidable. The novelty of this research is devising an enhanced genetic algorithm (GA) using multiple repairing mechanisms, which because of its computationally cumbersomeness have absorbed less attention in the literature. The problem runs through some generated instances and shows superiority in comparison to the business application.
similar resources
Bi-objectives Approach for a Multi-period Two Echelons Perishable Product Inventory-routing Problem with Production and Lateral Transshipment
In this study, a two echelons supply chain system in which a supplier is producing perishable product and distribute it to multiple customers is considered. By allowing lateral transshipment mechanism, it is also possible to deliver products to some customers in some periods in bulk, then customers using their own vehicle to transship goods between each other seeking further reduction in the ov...
full textA realistic perish ability inventory management for location-inventory-routing problem based on Genetic Algorithm
In this paper, it was an attempt to be present a practical perishability inventory model. The proposed model adds using spoilage of products and variable prices within a time period to a recently published location-inventory-routing model in order to make it more realistic. Aforementioned model by integration of strategic, tactical and operational level decisions produces better results for sup...
full textConsidering Production Planning in the Multi-period Inventory Routing Problem with Transshipment between Retailers
Generally, the inventory routing problem occurs in a supply chain where customers consider the supplier responsible for inventory replenishment. In this situation, the supplier finds the answer to questions regarding the time and quantity of delivery to the customer as well as the sequence of customers in the routes. Considering the effect of production decisions on answering these questions, t...
full textSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
full textthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولEfficient Strategy based on Improved Biogeography-based Algorithm for Inventory Routing problem
Researchers and urban administrators have often considered the routing problem as one of the fundamental phases in developing hazard management systems. In this research, a routing problem is investigated and analyzed by proposing an enhanced metaheuristic algorithm based on biogeography. In this problem, the production planning, inventory management, and distribution planning have been conside...
full textMy Resources
Journal title
volume 10 issue special issue on production and inventory
pages 30- 56
publication date 2017-05-19
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023