<?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></journal-id>
            <journal-title-group>
                                                                                    <journal-title>Akdeniz İİBF Dergisi</journal-title>
            </journal-title-group>
                            <issn pub-type="ppub">1302-9975</issn>
                                        <issn pub-type="epub">2667-7229</issn>
                                                                                            <publisher>
                    <publisher-name>Akdeniz University</publisher-name>
                </publisher>
                    </journal-meta>
                <article-meta>
                                        <article-id pub-id-type="doi">10.25294/auiibfd.559408</article-id>
                                                                <article-categories>
                                            <subj-group  xml:lang="en">
                                                            <subject>Economics</subject>
                                                    </subj-group>
                                            <subj-group  xml:lang="tr">
                                                            <subject>Ekonomi</subject>
                                                    </subj-group>
                                    </article-categories>
                                                                                                                                                        <title-group>
                                                                                                                        <trans-title-group xml:lang="tr">
                                    <trans-title>Bütünleşik Üretim ve Dağıtım Planlaması: İyileştirilmiş Bir Model ve Bütünleşik Planlamanın Değeri</trans-title>
                                </trans-title-group>
                                                                                                                                                                                                <article-title>Integrated Production and Distribution Planning: An Improved Formulation and the Value of Integrated Planning</article-title>
                                                                                                    </title-group>
            
                                                    <contrib-group content-type="authors">
                                                                        <contrib contrib-type="author">
                                                                    <contrib-id contrib-id-type="orcid">
                                        https://orcid.org/0000-0002-8509-6990</contrib-id>
                                                                <name>
                                    <surname>Solyalı</surname>
                                    <given-names>Oğuz</given-names>
                                </name>
                                                            </contrib>
                                                                                </contrib-group>
                        
                                        <pub-date pub-type="pub" iso-8601-date="20190501">
                    <day>05</day>
                    <month>01</month>
                    <year>2019</year>
                </pub-date>
                                        <volume>19</volume>
                                        <issue>1</issue>
                                        <fpage>223</fpage>
                                        <lpage>240</lpage>
                        
                        <history>
                                    <date date-type="received" iso-8601-date="20180904">
                        <day>09</day>
                        <month>04</month>
                        <year>2018</year>
                    </date>
                                                    <date date-type="accepted" iso-8601-date="20190219">
                        <day>02</day>
                        <month>19</month>
                        <year>2019</year>
                    </date>
                            </history>
                                        <permissions>
                    <copyright-statement>Copyright © 2001, Akdeniz İİBF journal</copyright-statement>
                    <copyright-year>2001</copyright-year>
                    <copyright-holder>Akdeniz İİBF journal</copyright-holder>
                </permissions>
            
                                                                                                <trans-abstract xml:lang="tr">
                            <p>Buçalışma, sonlu bir planlama ufku boyunca bir üreticinin bir ürünü üretip birçokperakendeciye türdeş bir araç filosu ile dağıttığı bir tedarik zinciriproblemini ele almaktadır. Amaç, her bir dönemde üreticideki üretimmiktarlarına, perakendecilere dağıtılacak ürün miktarlarına, kullanılacakaraçlara ve ziyaret edilecek perakendecilerin hangi araçlara atanacağına,sistem maliyetini enazlayacak şekilde karar vermektir. Bu problem içinliteratürde varolanlardan daha iyi sonuçlar veren bir karışık tam sayılıdoğrusal programlama modeli önerilmiştir. Ayrıca, üretim ve dağıtımplanlamasının bütünleşik ele alınması perakendecilerin kendi siparişleriniverdikleri ve üreticinin planlamasını bu siparişlere göre yaptığı ardışık planlamaile karşılaştırılmış ve bütünleşik planlamanın değeri değerlendirilmiştir.Sayısal deney sonuçları bütünleşik planlamanın ardışık planlamaya göre ortalama%8.9 ve en çok %28 maliyet tasarrufu sağladığını göstermektedir.&amp;nbsp;</p></trans-abstract>
                                                                                                                                    <abstract><p>This study considers a supply chain management problem in which a plant produces and distributes a product to multiple retailers using a homogeneous fleet of vehicles over a finite time horizon. The aim is to decide on the production quantities at the plant, delivery quantities to retailers, the set of vehicles to use and the assignment of retailers to vehicles in each period such that the system-wide costs are minimized. A mixed integer linear programming formulation of the problem outperforming the existing ones in the literature is proposed. This study also compares integrated production and distribution planning with the sequential planning in which retailers place their own orders and the plant makes its plan based on these orders, and assesses the value of integrated planning. The computational results indicate that average cost savings of 8.9% and maximum cost savings of 28% can be obtained with the integrated planning over the sequential planning.</p></abstract>
                                                            
            
                                                                                        <kwd-group>
                                                    <kwd>Supply Chain Management</kwd>
                                                    <kwd>  Production Planning</kwd>
                                                    <kwd>  Distribution Planning</kwd>
                                                    <kwd>  Mixed Integer Linear Programming</kwd>
                                            </kwd-group>
                            
                                                <kwd-group xml:lang="tr">
                                                    <kwd>Tedarik Zinciri Yönetimi</kwd>
                                                    <kwd>  Üretim Planlama</kwd>
                                                    <kwd>  Dağıtım Planlama</kwd>
                                                    <kwd>  Karışık Tam Sayılı Doğrusal Programlama</kwd>
                                            </kwd-group>
                                                                                                                                        </article-meta>
    </front>
    <back>
                            <ref-list>
                                    <ref id="ref1">
                        <label>1</label>
                        <mixed-citation publication-type="journal">Absi, N., Archetti, C., Dauzere-Peres, S., Feillet, D. (2015). “A two-phase iterative heuristic approach for the production routing problem”. Transportation Science, 49: 784–795.</mixed-citation>
                    </ref>
                                    <ref id="ref2">
                        <label>2</label>
                        <mixed-citation publication-type="journal">Absi, N., Archetti, C., Dauzere-Peres, S., Feillet, D., Speranza, M.G. (2018). “Comparing sequential and integrated approaches for the production routing problem”. European Journal of Operational Research, 269: 633–646.</mixed-citation>
                    </ref>
                                    <ref id="ref3">
                        <label>3</label>
                        <mixed-citation publication-type="journal">Adulyasak, Y., Cordeau, J.-F., Jans, R. (2014). “Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems”. INFORMS Journal on Computing, 26: 103–120.</mixed-citation>
                    </ref>
                                    <ref id="ref4">
                        <label>4</label>
                        <mixed-citation publication-type="journal">Adulyasak, Y., Cordeau, J.-F., Jans, R. (2015a). “The production routing problem: a review of formulations and solution algorithms”. Computers &amp; Operations Research, 55: 141–152.</mixed-citation>
                    </ref>
                                    <ref id="ref5">
                        <label>5</label>
                        <mixed-citation publication-type="journal">Adulyasak, Y., Cordeau, J.-F., Jans, R. (2015b). “Benders decomposition for production routing under demand uncertainty”. Operations Research, 63: 851–867.</mixed-citation>
                    </ref>
                                    <ref id="ref6">
                        <label>6</label>
                        <mixed-citation publication-type="journal">Archetti, C., Bertazzi, L., Paletta, G., Speranza, M.G. (2011). “Analysis of maximum level policy in a production-distribution system”. Computers &amp; Operations Research, 38: 1731–1746.</mixed-citation>
                    </ref>
                                    <ref id="ref7">
                        <label>7</label>
                        <mixed-citation publication-type="journal">Barany, I., Van Roy T.J., Wolsey, L.A. (1984). “Uncapacitated lot sizing: the convex hull of solutions”. Mathematical Programming Studies, 22: 32–43.</mixed-citation>
                    </ref>
                                    <ref id="ref8">
                        <label>8</label>
                        <mixed-citation publication-type="journal">Campbell, A.M., Savelsbergh, M.W.P. (2004). “A decomposition approach for the inventory-routing problem”. Transportation Science, 38: 488–502.</mixed-citation>
                    </ref>
                                    <ref id="ref9">
                        <label>9</label>
                        <mixed-citation publication-type="journal">Chan, L.M.A., Muriel, A., Shen, Z.J.M., Simchi-Levi, D., Teo, C.P. (2002). “Effective zero-inventory ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures”. Management Science, 48: 1446–1460.</mixed-citation>
                    </ref>
                                    <ref id="ref10">
                        <label>10</label>
                        <mixed-citation publication-type="journal">Chandra, P., Fisher, M.L., (1994). “Coordination of production and distribution planning”. European Journal of Operational Research, 72: 503–517.</mixed-citation>
                    </ref>
                                    <ref id="ref11">
                        <label>11</label>
                        <mixed-citation publication-type="journal">Chitsaz, M., Cordeau, J.-F., Jans, R. (2019). “A unified decomposition matheuristic for assembly, production, and inventory routing”. INFORMS Journal on Computing, 31: 134–152.</mixed-citation>
                    </ref>
                                    <ref id="ref12">
                        <label>12</label>
                        <mixed-citation publication-type="journal">Cunha, J.O., Melo, R.A. (2016). “On reformulations for one-warehouse multi-retailer problem”. Annals of Operations Research, 238: 99–122.</mixed-citation>
                    </ref>
                                    <ref id="ref13">
                        <label>13</label>
                        <mixed-citation publication-type="journal">Federgruen, A., Tzur, M. (1999). “Time-partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot-sizing problems”. Naval Research Logistics, 46: 463–486.</mixed-citation>
                    </ref>
                                    <ref id="ref14">
                        <label>14</label>
                        <mixed-citation publication-type="journal">Fumero, F., Vercellis C. (1999). “Synchronized development of production, inventory, and distribution schedules”. Transportation Science, 33: 330–340.</mixed-citation>
                    </ref>
                                    <ref id="ref15">
                        <label>15</label>
                        <mixed-citation publication-type="journal">Jin, Y., Muriel, A. (2009). “Single-warehouse multi-retailer inventory systems with full truckload shipments”. Naval Research Logistics, 56: 450–464.</mixed-citation>
                    </ref>
                                    <ref id="ref16">
                        <label>16</label>
                        <mixed-citation publication-type="journal">Kang, J.H., Kim, Y.D. (2010). “Coordination of inventory and transportation managements in a two-level supply chain”. International Journal of Production Economics, 123: 137–145.</mixed-citation>
                    </ref>
                                    <ref id="ref17">
                        <label>17</label>
                        <mixed-citation publication-type="journal">Levi, R., Roundy, R., Shmoys, D.B., Sviridenko, M. (2008). “A constant approximation algorithm for the one-warehouse multiretailer problem”. Management Science, 54: 763–776.</mixed-citation>
                    </ref>
                                    <ref id="ref18">
                        <label>18</label>
                        <mixed-citation publication-type="journal">Melo, R.A., Wolsey, L.A. (2012). “MIP formulations and heuristics for two-level production-transportation problems”. Computers &amp; Operations Research, 39: 2776–2786.</mixed-citation>
                    </ref>
                                    <ref id="ref19">
                        <label>19</label>
                        <mixed-citation publication-type="journal">Qui, Y., Wang, L., Fang, X., Pardalos, P.M., Goldengorin B. (2018). “Formulations and branch-and-cut algorithms for production routing problems with time windows”. Transportmetrica A: Transport Science, 14: 669–690.</mixed-citation>
                    </ref>
                                    <ref id="ref20">
                        <label>20</label>
                        <mixed-citation publication-type="journal">Ruokokoski, M., Solyalı, O., Cordeau, J.-F., Jans, R., Süral, H. (2010). “Efficient formulations and a branch-and-cut algorithm for a production-routing problem”. GERAD Technical Report, G-2010-66, HEC Montreal, Canada, 1–43.</mixed-citation>
                    </ref>
                                    <ref id="ref21">
                        <label>21</label>
                        <mixed-citation publication-type="journal">Russell, R.A. (2017). “Mathematical programming heuristics for the production routing problem”. International Journal of Production Economics, 193: 40–49.</mixed-citation>
                    </ref>
                                    <ref id="ref22">
                        <label>22</label>
                        <mixed-citation publication-type="journal">Senoussi, A., Mouss, N.K., Penz, B., Brahimi, N., Dauzere-Peres, S. (2016). “Modeling and solving a one-supplier multi-vehicle production-inventory-distribution problem with clustered retailers”. International Journal of Advanced Manufacturing Technologies, 85: 971–989.</mixed-citation>
                    </ref>
                                    <ref id="ref23">
                        <label>23</label>
                        <mixed-citation publication-type="journal">Senoussi, A., Dauzere-Peres, S., Brahimi, N., Penz, B., Mouss, N.K. (2018). “Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem”. Computers &amp; Operations Research, 96: 108–119.</mixed-citation>
                    </ref>
                                    <ref id="ref24">
                        <label>24</label>
                        <mixed-citation publication-type="journal">Solyalı, O., Süral, H. (2012). “The one-warehouse multi-retailer problem: Reformulation, classification, and computational results”. Annals of Operations Research, 196: 517–541.</mixed-citation>
                    </ref>
                                    <ref id="ref25">
                        <label>25</label>
                        <mixed-citation publication-type="journal">Solyalı, O., Süral, H. (2017). “A multi-phase heuristic for the production routing problem”. Computers &amp; Operations Research, 87: 114–124.</mixed-citation>
                    </ref>
                            </ref-list>
                    </back>
    </article>
