<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN"
        "https://jats.nlm.nih.gov/publishing/1.4/JATS-journalpublishing1-4.dtd">
<article  article-type="research-article"        dtd-version="1.4">
            <front>

                <journal-meta>
                                                                <journal-id>cujse</journal-id>
            <journal-title-group>
                                                                                    <journal-title>Cankaya University Journal of Science and Engineering</journal-title>
            </journal-title-group>
                                        <issn pub-type="epub">2564-7954</issn>
                                                                                            <publisher>
                    <publisher-name>Cankaya University</publisher-name>
                </publisher>
                    </journal-meta>
                <article-meta>
                                        <article-id/>
                                                                <article-categories>
                                            <subj-group  xml:lang="en">
                                                            <subject>Engineering</subject>
                                                    </subj-group>
                                            <subj-group  xml:lang="tr">
                                                            <subject>Mühendislik</subject>
                                                    </subj-group>
                                    </article-categories>
                                                                                                                                                        <title-group>
                                                                                                                        <trans-title-group xml:lang="tr">
                                    <trans-title>Using Segment-based Genetic Algorithm with Local Search to Find Approximate Solution for Multi-Stage Supply Chain Network Design Problem</trans-title>
                                </trans-title-group>
                                                                                                                                                                                                <article-title>Using Segment-based Genetic Algorithm with Local Search to Find Approximate Solution for Multi-Stage Supply Chain Network Design Problem</article-title>
                                                                                                    </title-group>
            
                                                    <contrib-group content-type="authors">
                                                                        <contrib contrib-type="author">
                                                                <name>
                                    <surname>Rafsanjani</surname>
                                    <given-names>Marjan Kuchaki</given-names>
                                </name>
                                                            </contrib>
                                                    <contrib contrib-type="author">
                                                                <name>
                                    <surname>Eskandari</surname>
                                    <given-names>Sadegh</given-names>
                                </name>
                                                            </contrib>
                                                                                </contrib-group>
                        
                                        <pub-date pub-type="pub" iso-8601-date="20131101">
                    <day>11</day>
                    <month>01</month>
                    <year>2013</year>
                </pub-date>
                                        <volume>10</volume>
                                        <issue>2</issue>
                                                
                        <history>
                                    <date date-type="received" iso-8601-date="20170415">
                        <day>04</day>
                        <month>15</month>
                        <year>2017</year>
                    </date>
                                            </history>
                                        <permissions>
                    <copyright-statement>Copyright © 2009, Cankaya University Journal of Science and Engineering</copyright-statement>
                    <copyright-year>2009</copyright-year>
                    <copyright-holder>Cankaya University Journal of Science and Engineering</copyright-holder>
                </permissions>
            
                                                                                                <trans-abstract xml:lang="tr">
                            <p>Designing an optimal supply chain network (SCN) is an NP-hard and highly nonlinear problem;&amp;nbsp;therefore, this problem may not be solved efficiently using conventional optimization methods. In this article,&amp;nbsp;we propose a genetic algorithm (GA) approach with segment-based operators combined with a local search&amp;nbsp;technique (SHGA) to solve the multistage-based SCN design problems. To evaluate the performance of the&amp;nbsp;proposed algorithm, we applied SHGA and other competing algorithms to SCNs with different features and&amp;nbsp;different parameters. The results obtained show that the proposed algorithm outperforms the other competing&amp;nbsp;algorithms.</p></trans-abstract>
                                                                                                                                    <abstract><p>Designing an optimal supply chain network (SCN) is an NP-hard and highly nonlinear problem;therefore, this problem may not be solved efficiently using conventional optimization methods. In this article,we propose a genetic algorithm (GA) approach with segment-based operators combined with a local searchtechnique (SHGA) to solve the multistage-based SCN design problems. To evaluate the performance of theproposed algorithm, we applied SHGA and other competing algorithms to SCNs with different features anddifferent parameters. The results obtained show that the proposed algorithm outperforms the other competingalgorithms.</p></abstract>
                                                            
            
                                                                                        <kwd-group>
                                                    <kwd>Supply Chain Network</kwd>
                                                    <kwd>  Genetic Algorithm</kwd>
                                                    <kwd>  Segment-based Operators</kwd>
                                                    <kwd>  Local Search</kwd>
                                            </kwd-group>
                            
                                                <kwd-group xml:lang="tr">
                                                    <kwd>Supply Chain Network</kwd>
                                                    <kwd>  Genetic Algorithm</kwd>
                                                    <kwd>  Segment-based Operators</kwd>
                                                    <kwd>  Local Search</kwd>
                                            </kwd-group>
                                                                                                                                        </article-meta>
    </front>
    <back>
                            <ref-list>
                                    <ref id="ref1">
                        <label>1</label>
                        <mixed-citation publication-type="journal">F. Altiparmak, M. Gen, L. Lin, I. Karaoglan, A steady-state genetic algorithm for multi-product supply chain network design, Computers &amp; Industrial Engineering, 56, (2009), 521–537.</mixed-citation>
                    </ref>
                                    <ref id="ref2">
                        <label>2</label>
                        <mixed-citation publication-type="journal">A. Costa, G. Celano, S. Fichera, E.Trovato, A new efficient encoding/decoding procedure for the design of a supply chain network with genetic algorithms, Computers &amp; Industrial Engineering, 59(4), (2010), 986–999.</mixed-citation>
                    </ref>
                                    <ref id="ref3">
                        <label>3</label>
                        <mixed-citation publication-type="journal">M. Gen, R. Cheng, Genetic algorithms and engineering optimization. New York: John Wiley and Sons, (2000).</mixed-citation>
                    </ref>
                                    <ref id="ref4">
                        <label>4</label>
                        <mixed-citation publication-type="journal">M .Gen, F. Altiparmak,L. Lin, A genetic algorithm for two-stage transportation problem using priority-based encoding. OR Spectrum, 28, (2006), 337–354.</mixed-citation>
                    </ref>
                                    <ref id="ref5">
                        <label>5</label>
                        <mixed-citation publication-type="journal">M. Hajiaghaei-Keshteli, The allocation of customers to potential distribution centers in supply chain networks: GA and AIA approaches, Applied Soft Computing, 11(2), (2010), 2069–2078.</mixed-citation>
                    </ref>
                                    <ref id="ref6">
                        <label>6</label>
                        <mixed-citation publication-type="journal">J.H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, (1975).</mixed-citation>
                    </ref>
                                    <ref id="ref7">
                        <label>7</label>
                        <mixed-citation publication-type="journal">M. Kaya, The effects of a new selection operator on the performance of a genetic algorithm, Applied Mathematics and Computation, 217(19), (2011), 7669–6778.</mixed-citation>
                    </ref>
                                    <ref id="ref8">
                        <label>8</label>
                        <mixed-citation publication-type="journal">M. Kaya, The effects of two new crossover operators on genetic algorithm performance, Applied Soft Computing 11(1), (2011), 881–890.</mixed-citation>
                    </ref>
                                    <ref id="ref9">
                        <label>9</label>
                        <mixed-citation publication-type="journal">Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Program. Spring-Verlag, (1994).</mixed-citation>
                    </ref>
                                    <ref id="ref10">
                        <label>10</label>
                        <mixed-citation publication-type="journal">B. L. Miller, D. E. Goldberg, Genetic Algorithms, Tournament Selection, and the Effects of Noise, Complex Systems, 9, (1995), 193–212.</mixed-citation>
                    </ref>
                                    <ref id="ref11">
                        <label>11</label>
                        <mixed-citation publication-type="journal">M. S. Pishvaee, M .Rabbani, A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment. Advances in Engineering Software, 42(3), (2010), 57–63.</mixed-citation>
                    </ref>
                                    <ref id="ref12">
                        <label>12</label>
                        <mixed-citation publication-type="journal">S. N. Sivanandam, S. N. Deepa, Introduction to Genetic Algorithms, New York: Springer Berlin
Heidelberg, (2008).</mixed-citation>
                    </ref>
                                    <ref id="ref13">
                        <label>13</label>
                        <mixed-citation publication-type="journal">A. Syarif, Y. Yun, M. Gen. Study on multi-stage logistics chain network: A spanning tree-based genetic algorithm approach. Computers &amp; Industrial Engineering, 43(1-2), (2002), 299–314.</mixed-citation>
                    </ref>
                                    <ref id="ref14">
                        <label>14</label>
                        <mixed-citation publication-type="journal">L. C. Wang, T. L. Chen, Y.Y. Chen, H. Y. Miao, S. C. Lin, S. T. Chen, Genetic algorithm approach for multi–objective optimization of closed–loop supply chain network, Proceedings of the Institute of Industrial Engineers Asian Conference 2013, (2013), 149–156.</mixed-citation>
                    </ref>
                                    <ref id="ref15">
                        <label>15</label>
                        <mixed-citation publication-type="journal">M. J. Yao, H. W. Hsu, A new spanning tree–based genetic algorithm for the design of multi–stage supply chain networks with nonlinear transportation costs, Optimization and Engineering, 10(2), (2009), 219–237.</mixed-citation>
                    </ref>
                                    <ref id="ref16">
                        <label>16</label>
                        <mixed-citation publication-type="journal">W. C. Yeh, A hybrid heuristic algorithm for the multistage supply chain network problem, Int J AdvManufTechnol, 26(5–6), (2005), 675–685.</mixed-citation>
                    </ref>
                                    <ref id="ref17">
                        <label>17</label>
                        <mixed-citation publication-type="journal">Y. Yun, C. Moon, D. Kim, Hybrid genetic algorithm with adaptive local search scheme for solving multistage-based supply chain problems, Computers &amp; Industrial Engineering, 56(3), (2009), 821–838.</mixed-citation>
                    </ref>
                            </ref-list>
                    </back>
    </article>
