A Genetic Algorithm for the Economic Lot Scheduling Problem Under Extended Basic Period Approach and Power-Of Policy
| dc.contributor.author | Bulut O. | |
| dc.contributor.author | Tasgetiren M.F. | |
| dc.contributor.author | Fadiloğlu, Murat | |
| dc.date.accessioned | 2023-06-16T14:58:04Z | |
| dc.date.available | 2023-06-16T14:58:04Z | |
| dc.date.issued | 2012 | |
| dc.description | IEEE Computational Intelligence Society;International Neural Network Society;National Science Foundation of China | en_US |
| dc.description | 7th International Conference on Intelligent Computing, ICIC 2011 -- 11 August 2011 through 14 August 2011 -- Zhengzhou -- 88035 | en_US |
| dc.description.abstract | In this study, we propose a genetic algorithm (GA) for the economic lot scheduling problem (ELSP) under extended basic period (EBP) approach and power-of-two (PoT) policy. The proposed GA employs a multi-chromosome solution representation to encode PoT multipliers and the production positions separately. Both feasible and infeasible solutions are maintained in the population through the use of some sophisticated constraint handling methods. Furthermore, a variable neighborhood search (VNS) algorithm is also fused into GA to further enhance the solution quality. The experimental results show that the proposed GA is very competitive to the best performing algorithms from the existing literature under the EBP and PoT policy. © 2012 Springer-Verlag. | en_US |
| dc.identifier.doi | 10.1007/978-3-642-25944-9_8 | |
| dc.identifier.isbn | 978-3-642-25943-2 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.scopus | 2-s2.0-84855665274 | |
| dc.identifier.uri | https://doi.org/10.1007/978-3-642-25944-9_8 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14365/3413 | |
| dc.language.iso | en | en_US |
| dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Economic lot scheduling problem | en_US |
| dc.subject | extended basic period | en_US |
| dc.subject | genetic algorithm | en_US |
| dc.subject | power-of-two policy | en_US |
| dc.subject | variable neighborhood search | en_US |
| dc.subject | Constraint handling | en_US |
| dc.subject | Economic lot scheduling problems | en_US |
| dc.subject | extended basic period | en_US |
| dc.subject | Power-of-two | en_US |
| dc.subject | Power-of-two policies | en_US |
| dc.subject | Solution quality | en_US |
| dc.subject | Solution representation | en_US |
| dc.subject | Variable neighborhood search | en_US |
| dc.subject | Computation theory | en_US |
| dc.subject | Intelligent computing | en_US |
| dc.subject | Operations research | en_US |
| dc.subject | Genetic algorithms | en_US |
| dc.title | A Genetic Algorithm for the Economic Lot Scheduling Problem Under Extended Basic Period Approach and Power-Of Policy | en_US |
| dc.type | Conference Object | en_US |
| dspace.entity.type | Publication | |
| gdc.author.scopusid | 35168573500 | |
| gdc.author.scopusid | 6602212401 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | metadata only access | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.departmenttemp | Bulut, O., Industrial Engineering Department, Yasar University, Izmir, Turkey; Tasgetiren, M.F., Industrial Engineering Department, Yasar University, Izmir, Turkey; Fadiloglu, M.M., Industrial and Systems Engineering Department, Izmir Economy University, Izmir, Turkey | en_US |
| gdc.description.endpage | 65 | en_US |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q3 | |
| gdc.description.startpage | 57 | en_US |
| gdc.description.volume | 6839 LNAI | en_US |
| gdc.description.wosquality | N/A | |
| gdc.identifier.openalex | W2153824826 | |
| gdc.identifier.wos | WOS:000306498200008 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 0.0 | |
| gdc.oaire.influence | 2.4895952E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.popularity | 5.260503E-10 | |
| gdc.oaire.publicfunded | false | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 1.9632 | |
| gdc.openalex.normalizedpercentile | 0.88 | |
| gdc.opencitations.count | 0 | |
| gdc.plumx.mendeley | 8 | |
| gdc.plumx.scopuscites | 1 | |
| gdc.scopus.citedcount | 1 | |
| gdc.virtual.author | Fadiloğlu, Murat | |
| gdc.wos.citedcount | 0 | |
| relation.isAuthorOfPublication | d2d28fb5-9f33-4f50-9fa4-cc867a9b1adc | |
| relation.isAuthorOfPublication.latestForDiscovery | d2d28fb5-9f33-4f50-9fa4-cc867a9b1adc | |
| relation.isOrgUnitOfPublication | bdb88a44-c66f-45fd-b2ec-de89cb1c93a0 | |
| relation.isOrgUnitOfPublication | 26a7372c-1a5e-42d9-90b6-a3f7d14cad44 | |
| relation.isOrgUnitOfPublication | e9e77e3e-bc94-40a7-9b24-b807b2cd0319 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | bdb88a44-c66f-45fd-b2ec-de89cb1c93a0 |
Files
Original bundle
1 - 1 of 1
