Please use this identifier to cite or link to this item:
http://idr.nitk.ac.in/jspui/handle/123456789/12576
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kumar, P. | |
dc.contributor.author | Herbert, M. | |
dc.contributor.author | Rao, S. | |
dc.date.accessioned | 2020-03-31T08:41:51Z | - |
dc.date.available | 2020-03-31T08:41:51Z | - |
dc.date.issued | 2017 | |
dc.identifier.citation | Advances in Operations Research, 2017, Vol.2017, , pp.- | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/12576 | - |
dc.description.abstract | This research study focuses on the optimization of multi-item multi-period procurement lot sizing problem for inventory management. Mathematical model is developed which considers different practical constraints like storage space and budget. The aim is to find optimum order quantities of the product so that total cost of inventory is minimized. The NP-hard mathematical model is solved by adopting a novel ant colony optimization approach. Due to lack of benchmark method specified in the literature to assess the performance of the above approach, another metaheuristic based program of genetic algorithm is also employed to solve the problem. The parameters of genetic algorithm model are calibrated using Taguchi method of experiments. The performance of both algorithms is compared using ANOVA analysis with the real time data collected from a valve manufacturing company. It is verified that two methods have not shown any significant difference as far as objective function value is considered. But genetic algorithm is far better than the ACO method when compared on the basis of CPU execution time. 2017 Prasanna Kumar et al. | en_US |
dc.title | Population Based Metaheuristic Algorithm Approach for Analysis of Multi-Item Multi-Period Procurement Lot Sizing Problem | en_US |
dc.type | Article | en_US |
Appears in Collections: | 1. Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.