A tuned NSGA-II to optimize the total cost and service level for a just-in-time distribution network

Distribution network planning has attracted the attention of many studies during last decades. Just-in-time (JIT) distribution has a key role in efficient delivery of products within distribution networks. In modeling of JIT distribution networks, the most frequently applied objectives are related t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Neural computing & applications 2017-11, Vol.28 (11), p.3413-3427
Hauptverfasser: Memari, Ashkan, Abdul Rahim, Abd. Rahman, Hassan, Adnan, Ahmad, Robiah
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 3427
container_issue 11
container_start_page 3413
container_title Neural computing & applications
container_volume 28
creator Memari, Ashkan
Abdul Rahim, Abd. Rahman
Hassan, Adnan
Ahmad, Robiah
description Distribution network planning has attracted the attention of many studies during last decades. Just-in-time (JIT) distribution has a key role in efficient delivery of products within distribution networks. In modeling of JIT distribution networks, the most frequently applied objectives are related to cost and service level. However, evaluating the impact of simultaneously minimizing total costs and balance between distribution network entities in different echelons still rarely complies with the current literature. To remedy this shortcoming and model reality more accurately, this paper develops a multi-objective mixed-integer nonlinear optimization model for a JIT distribution in three-echelon distribution network. The aims are minimization of total logistics cost along with maximization of capacity utilization balance for distribution centers and manufacturing plants. A non-dominated sorting genetic algorithm-II (NSGA-II) with three different mutation operators namely swap, reversion and insertion is employed to provide a set of near-optimal Pareto solutions. Then, the provided solutions are verified with non-dominated ranked genetic algorithm (NRGA) as well. The Taguchi method in design of experiments tunes the parameters of both algorithms, and their performances are then compared in terms of some multi-objective performance measures. In addition, a genetic algorithm is used to assess Pareto optimal solutions of NSGA-II. Different problems with different sizes are considered to compare the performance of the suggested algorithms. The results show that the proposed solution approach performs efficiently. Finally, the conclusion and some directions for future research are proposed.
doi_str_mv 10.1007/s00521-016-2249-0
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1946479755</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1946479755</sourcerecordid><originalsourceid>FETCH-LOGICAL-c364t-746df45011ee6a7c2dbd23a660d33c925a7f7f6eaf07ea8319a968c85b5298513</originalsourceid><addsrcrecordid>eNp1kD1PwzAQhi0EEqXwA9gsMRvO8UeSsaqgVKpgAGbLjR1wSeNiO0Xw63EVBhaG0w33Pu9JD0KXFK4pQHkTAURBCVBJioLXBI7QhHLGCANRHaMJ1DxfJWen6CzGDQBwWYkJMjOcht4a_PC0mJHlEieP_S65rfu2OL3l8Ul3uPExYd0bHG3Yu8bizu5th1sfsMabISbiepIpi42LKbj1kJzvcW_Tpw_v5-ik1V20F797il7ubp_n92T1uFjOZyvSMMkTKbk0LRdAqbVSl01h1qZgWkowjDV1IXTZlq20uoXS6orRWteyaiqxFkVdCcqm6Grs3QX_MdiY1MYPoc8vFa255GVdCpFTdEw1wccYbKt2wW11-FIU1EGmGmWqLFMdZCrITDEyMWf7Vxv-NP8L_QANSHaA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1946479755</pqid></control><display><type>article</type><title>A tuned NSGA-II to optimize the total cost and service level for a just-in-time distribution network</title><source>SpringerNature Journals</source><creator>Memari, Ashkan ; Abdul Rahim, Abd. Rahman ; Hassan, Adnan ; Ahmad, Robiah</creator><creatorcontrib>Memari, Ashkan ; Abdul Rahim, Abd. Rahman ; Hassan, Adnan ; Ahmad, Robiah</creatorcontrib><description>Distribution network planning has attracted the attention of many studies during last decades. Just-in-time (JIT) distribution has a key role in efficient delivery of products within distribution networks. In modeling of JIT distribution networks, the most frequently applied objectives are related to cost and service level. However, evaluating the impact of simultaneously minimizing total costs and balance between distribution network entities in different echelons still rarely complies with the current literature. To remedy this shortcoming and model reality more accurately, this paper develops a multi-objective mixed-integer nonlinear optimization model for a JIT distribution in three-echelon distribution network. The aims are minimization of total logistics cost along with maximization of capacity utilization balance for distribution centers and manufacturing plants. A non-dominated sorting genetic algorithm-II (NSGA-II) with three different mutation operators namely swap, reversion and insertion is employed to provide a set of near-optimal Pareto solutions. Then, the provided solutions are verified with non-dominated ranked genetic algorithm (NRGA) as well. The Taguchi method in design of experiments tunes the parameters of both algorithms, and their performances are then compared in terms of some multi-objective performance measures. In addition, a genetic algorithm is used to assess Pareto optimal solutions of NSGA-II. Different problems with different sizes are considered to compare the performance of the suggested algorithms. The results show that the proposed solution approach performs efficiently. Finally, the conclusion and some directions for future research are proposed.</description><identifier>ISSN: 0941-0643</identifier><identifier>EISSN: 1433-3058</identifier><identifier>DOI: 10.1007/s00521-016-2249-0</identifier><language>eng</language><publisher>London: Springer London</publisher><subject>Artificial Intelligence ; Classification ; Computational Biology/Bioinformatics ; Computational Science and Engineering ; Computer Science ; Data Mining and Knowledge Discovery ; Design of experiments ; Distribution centers ; Distribution management ; Genetic algorithms ; Image Processing and Computer Vision ; Industrial engineering ; Industrial plants ; Logistics ; Manufacturing engineering ; Mathematical models ; Multiple objective analysis ; Networks ; Optimization ; Original Article ; Pareto optimum ; Probability and Statistics in Computer Science ; Reversion ; Sorting algorithms ; Taguchi methods</subject><ispartof>Neural computing &amp; applications, 2017-11, Vol.28 (11), p.3413-3427</ispartof><rights>The Natural Computing Applications Forum 2016</rights><rights>Copyright Springer Science &amp; Business Media 2017</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c364t-746df45011ee6a7c2dbd23a660d33c925a7f7f6eaf07ea8319a968c85b5298513</citedby><cites>FETCH-LOGICAL-c364t-746df45011ee6a7c2dbd23a660d33c925a7f7f6eaf07ea8319a968c85b5298513</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00521-016-2249-0$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00521-016-2249-0$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>315,782,786,27931,27932,41495,42564,51326</link.rule.ids></links><search><creatorcontrib>Memari, Ashkan</creatorcontrib><creatorcontrib>Abdul Rahim, Abd. Rahman</creatorcontrib><creatorcontrib>Hassan, Adnan</creatorcontrib><creatorcontrib>Ahmad, Robiah</creatorcontrib><title>A tuned NSGA-II to optimize the total cost and service level for a just-in-time distribution network</title><title>Neural computing &amp; applications</title><addtitle>Neural Comput &amp; Applic</addtitle><description>Distribution network planning has attracted the attention of many studies during last decades. Just-in-time (JIT) distribution has a key role in efficient delivery of products within distribution networks. In modeling of JIT distribution networks, the most frequently applied objectives are related to cost and service level. However, evaluating the impact of simultaneously minimizing total costs and balance between distribution network entities in different echelons still rarely complies with the current literature. To remedy this shortcoming and model reality more accurately, this paper develops a multi-objective mixed-integer nonlinear optimization model for a JIT distribution in three-echelon distribution network. The aims are minimization of total logistics cost along with maximization of capacity utilization balance for distribution centers and manufacturing plants. A non-dominated sorting genetic algorithm-II (NSGA-II) with three different mutation operators namely swap, reversion and insertion is employed to provide a set of near-optimal Pareto solutions. Then, the provided solutions are verified with non-dominated ranked genetic algorithm (NRGA) as well. The Taguchi method in design of experiments tunes the parameters of both algorithms, and their performances are then compared in terms of some multi-objective performance measures. In addition, a genetic algorithm is used to assess Pareto optimal solutions of NSGA-II. Different problems with different sizes are considered to compare the performance of the suggested algorithms. The results show that the proposed solution approach performs efficiently. Finally, the conclusion and some directions for future research are proposed.</description><subject>Artificial Intelligence</subject><subject>Classification</subject><subject>Computational Biology/Bioinformatics</subject><subject>Computational Science and Engineering</subject><subject>Computer Science</subject><subject>Data Mining and Knowledge Discovery</subject><subject>Design of experiments</subject><subject>Distribution centers</subject><subject>Distribution management</subject><subject>Genetic algorithms</subject><subject>Image Processing and Computer Vision</subject><subject>Industrial engineering</subject><subject>Industrial plants</subject><subject>Logistics</subject><subject>Manufacturing engineering</subject><subject>Mathematical models</subject><subject>Multiple objective analysis</subject><subject>Networks</subject><subject>Optimization</subject><subject>Original Article</subject><subject>Pareto optimum</subject><subject>Probability and Statistics in Computer Science</subject><subject>Reversion</subject><subject>Sorting algorithms</subject><subject>Taguchi methods</subject><issn>0941-0643</issn><issn>1433-3058</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><recordid>eNp1kD1PwzAQhi0EEqXwA9gsMRvO8UeSsaqgVKpgAGbLjR1wSeNiO0Xw63EVBhaG0w33Pu9JD0KXFK4pQHkTAURBCVBJioLXBI7QhHLGCANRHaMJ1DxfJWen6CzGDQBwWYkJMjOcht4a_PC0mJHlEieP_S65rfu2OL3l8Ul3uPExYd0bHG3Yu8bizu5th1sfsMabISbiepIpi42LKbj1kJzvcW_Tpw_v5-ik1V20F797il7ubp_n92T1uFjOZyvSMMkTKbk0LRdAqbVSl01h1qZgWkowjDV1IXTZlq20uoXS6orRWteyaiqxFkVdCcqm6Grs3QX_MdiY1MYPoc8vFa255GVdCpFTdEw1wccYbKt2wW11-FIU1EGmGmWqLFMdZCrITDEyMWf7Vxv-NP8L_QANSHaA</recordid><startdate>20171101</startdate><enddate>20171101</enddate><creator>Memari, Ashkan</creator><creator>Abdul Rahim, Abd. Rahman</creator><creator>Hassan, Adnan</creator><creator>Ahmad, Robiah</creator><general>Springer London</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20171101</creationdate><title>A tuned NSGA-II to optimize the total cost and service level for a just-in-time distribution network</title><author>Memari, Ashkan ; Abdul Rahim, Abd. Rahman ; Hassan, Adnan ; Ahmad, Robiah</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c364t-746df45011ee6a7c2dbd23a660d33c925a7f7f6eaf07ea8319a968c85b5298513</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Artificial Intelligence</topic><topic>Classification</topic><topic>Computational Biology/Bioinformatics</topic><topic>Computational Science and Engineering</topic><topic>Computer Science</topic><topic>Data Mining and Knowledge Discovery</topic><topic>Design of experiments</topic><topic>Distribution centers</topic><topic>Distribution management</topic><topic>Genetic algorithms</topic><topic>Image Processing and Computer Vision</topic><topic>Industrial engineering</topic><topic>Industrial plants</topic><topic>Logistics</topic><topic>Manufacturing engineering</topic><topic>Mathematical models</topic><topic>Multiple objective analysis</topic><topic>Networks</topic><topic>Optimization</topic><topic>Original Article</topic><topic>Pareto optimum</topic><topic>Probability and Statistics in Computer Science</topic><topic>Reversion</topic><topic>Sorting algorithms</topic><topic>Taguchi methods</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Memari, Ashkan</creatorcontrib><creatorcontrib>Abdul Rahim, Abd. Rahman</creatorcontrib><creatorcontrib>Hassan, Adnan</creatorcontrib><creatorcontrib>Ahmad, Robiah</creatorcontrib><collection>CrossRef</collection><jtitle>Neural computing &amp; applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Memari, Ashkan</au><au>Abdul Rahim, Abd. Rahman</au><au>Hassan, Adnan</au><au>Ahmad, Robiah</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A tuned NSGA-II to optimize the total cost and service level for a just-in-time distribution network</atitle><jtitle>Neural computing &amp; applications</jtitle><stitle>Neural Comput &amp; Applic</stitle><date>2017-11-01</date><risdate>2017</risdate><volume>28</volume><issue>11</issue><spage>3413</spage><epage>3427</epage><pages>3413-3427</pages><issn>0941-0643</issn><eissn>1433-3058</eissn><abstract>Distribution network planning has attracted the attention of many studies during last decades. Just-in-time (JIT) distribution has a key role in efficient delivery of products within distribution networks. In modeling of JIT distribution networks, the most frequently applied objectives are related to cost and service level. However, evaluating the impact of simultaneously minimizing total costs and balance between distribution network entities in different echelons still rarely complies with the current literature. To remedy this shortcoming and model reality more accurately, this paper develops a multi-objective mixed-integer nonlinear optimization model for a JIT distribution in three-echelon distribution network. The aims are minimization of total logistics cost along with maximization of capacity utilization balance for distribution centers and manufacturing plants. A non-dominated sorting genetic algorithm-II (NSGA-II) with three different mutation operators namely swap, reversion and insertion is employed to provide a set of near-optimal Pareto solutions. Then, the provided solutions are verified with non-dominated ranked genetic algorithm (NRGA) as well. The Taguchi method in design of experiments tunes the parameters of both algorithms, and their performances are then compared in terms of some multi-objective performance measures. In addition, a genetic algorithm is used to assess Pareto optimal solutions of NSGA-II. Different problems with different sizes are considered to compare the performance of the suggested algorithms. The results show that the proposed solution approach performs efficiently. Finally, the conclusion and some directions for future research are proposed.</abstract><cop>London</cop><pub>Springer London</pub><doi>10.1007/s00521-016-2249-0</doi><tpages>15</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0941-0643
ispartof Neural computing & applications, 2017-11, Vol.28 (11), p.3413-3427
issn 0941-0643
1433-3058
language eng
recordid cdi_proquest_journals_1946479755
source SpringerNature Journals
subjects Artificial Intelligence
Classification
Computational Biology/Bioinformatics
Computational Science and Engineering
Computer Science
Data Mining and Knowledge Discovery
Design of experiments
Distribution centers
Distribution management
Genetic algorithms
Image Processing and Computer Vision
Industrial engineering
Industrial plants
Logistics
Manufacturing engineering
Mathematical models
Multiple objective analysis
Networks
Optimization
Original Article
Pareto optimum
Probability and Statistics in Computer Science
Reversion
Sorting algorithms
Taguchi methods
title A tuned NSGA-II to optimize the total cost and service level for a just-in-time distribution network
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-09T11%3A49%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20tuned%20NSGA-II%20to%20optimize%20the%20total%20cost%20and%20service%20level%20for%20a%20just-in-time%20distribution%20network&rft.jtitle=Neural%20computing%20&%20applications&rft.au=Memari,%20Ashkan&rft.date=2017-11-01&rft.volume=28&rft.issue=11&rft.spage=3413&rft.epage=3427&rft.pages=3413-3427&rft.issn=0941-0643&rft.eissn=1433-3058&rft_id=info:doi/10.1007/s00521-016-2249-0&rft_dat=%3Cproquest_cross%3E1946479755%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1946479755&rft_id=info:pmid/&rfr_iscdi=true