Particle swarm optimization for tackling continuous review inventory models

dc.contributor.authorSkouri, K.en
dc.contributor.authorParsopoulos, K. E.en
dc.contributor.authorVrahatis, M. N.en
dc.date.accessioned2015-11-24T17:27:30Z
dc.date.available2015-11-24T17:27:30Z
dc.identifier.issn0302-9743-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/13393
dc.rightsDefault Licence-
dc.titleParticle swarm optimization for tackling continuous review inventory modelsen
heal.abstractWe propose an alternative algorithm for solving continuous review inventory model problems for deteriorating items over a finite horizon. Our interest focuses on the case of time dependent demand and backlogging rates, limited or infinite warehouse capacity and taking into account the time value of money. The algorithm is based on Particle Swarm Optimization and it is capable of computing the number of replenishment cycles as well as the corresponding shortage and replenishment instances concurrently, thereby alleviating the heavy computational burden posed by the analytical solution of the problem through the Kuhn Tucker approach. The proposed technique does not require any gradient information but cost function values solely, while a penalty function is employed to address the cases of limited warehouse capacity. Experiments are conducted on models proposed in the relative literature, justifying the usefulness of the algorithmen
heal.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.journalNameLecture Notes in Computer Science (LNCS)en
heal.journalTypepeer reviewed-
heal.publicationDate2008-
heal.publisherSpringer-Verlagen
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικώνel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Files

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.74 KB
Format:
Item-specific license agreed upon to submission
Description: