Hybrid genetic algorithm for a problem lot Sizing with transport

dc.contributor.author	LAGGOUN, Assia
dc.contributor.author	Kinza Nadia, MOUSS
dc.contributor.author	DRISS, Imen
dc.date.accessioned	2019-06-09T22:27:19Z
dc.date.available	2019-06-09T22:27:19Z
dc.date.issued	2017-09-16
dc.identifier.issn	2335-1977
dc.identifier.uri	http://dspace.univ-djelfa.dz:8080/xmlui/handle/123456789/1459
dc.description.abstract	Planning production problems have been the subject of many authors. We consider a lot of problem Sizing whith two levels. This paper presents a methodology to solve a problem of supply chain of type OWMR (One whare-house Multi Retailer) whith direct delivery. We assume that the demand is deterministic. The work presented is about a lot sizing problem. The objective is to optimize the total cost of the supply chain, consisting of a production cost, storage cost and transport cost. First the problem was solved by an exact method, which has shown its limits if the number of clients and periods increase. Also we proposed the use of genetic algorithms as a heuristic to solve this problem. The results are satisfactory.	en_EN
dc.language.iso	en	en_EN
dc.publisher	LAADI, Djelfa University, Algeria	en_EN
dc.relation.ispartofseries	ICAAID, Djelfa University;
dc.subject	Lot Sizing, Supply chain, Genetic Algorithm.	en_EN
dc.title	Hybrid genetic algorithm for a problem lot Sizing with transport	en_EN
dc.type	Article	en_EN