Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm
Networks provide a useful way for modeling real world problems and are extensively used in many different types of systems: communications, hydraulic, mechanical, electronic, and logistics. The transportation problem (TP) is known as one of the important network problems. When the TP problem is asso...
Gespeichert in:
| Veröffentlicht in: | Computers & industrial engineering 2007-09, Vol.53 (2), p.290-298 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 298 |
|---|---|
| container_issue | 2 |
| container_start_page | 290 |
| container_title | Computers & industrial engineering |
| container_volume | 53 |
| creator | Jo, Jung-Bok Li, Yinzhen Gen, Mitsuo |
| description | Networks provide a useful way for modeling real world problems and are extensively used in many different types of systems: communications, hydraulic, mechanical, electronic, and logistics. The transportation problem (TP) is known as one of the important network problems. When the TP problem is associated with additional fixed cost for establishing the facilities or fulfilling the demand of customers, then it is called fixed charge transportation problem (fcTP).
This problem is one of the NP-hard (IE/OR) problems that are difficult to solve using traditional methods. This paper aims to show the application of spanning tree-based Genetic Algorithm (GA) approach for solving nonlinear fixed charge transportation problem. Our new idea lies on the GA representation that includes the feasibility criteria and repairing procedure for the chromosome. Several numerical experimental results are presented to show the effectiveness of the proposed method. |
| doi_str_mv | 10.1016/j.cie.2007.06.022 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_30122276</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S036083520700112X</els_id><sourcerecordid>1334464701</sourcerecordid><originalsourceid>FETCH-LOGICAL-c452t-7147c2d540fdb5f15233e224aec4cbdaa3d19dd30f560b27aa45dff1fa2f8bb73</originalsourceid><addsrcrecordid>eNqFkb1O5DAURq0VK-0w8ADbRVvQJVzbcZyICiFgkRA0LK3l2NeDRxl7sDMI3h6jodoCqtucc_8-Qn5TaCjQ7nTdGI8NA5ANdA0w9oMsaC-HGoSAA7IA3kHdc8F-kcOc1wDQioEuyONdDJMPqFPl_CvayjzptMJqTjrkbUyznn0M1TbFccJNNb5VeatD8GFVEMR61LlIKww4e1PpaRWTn582R-Sn01PG48-6JP-uLh8u_ta399c3F-e3tWkFm2tJW2mYFS04OwpHBeMcGWs1mtaMVmtu6WAtByc6GJnUuhXWOeo0c_04Sr4kJ_u-ZcHnHeZZbXw2OE06YNxlxYEyxmT3LUgHwfuhzF-SP_-B67hLoRyhGOWylb0YCkT3kEkx54RObZPf6PSmKKiPPNRalTzURx4KOlXyKM7Z3sHyjxePSeWCBIPWJzSzstF_Yb8DOJqUIA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>213747859</pqid></control><display><type>article</type><title>Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm</title><source>Access via ScienceDirect (Elsevier)</source><creator>Jo, Jung-Bok ; Li, Yinzhen ; Gen, Mitsuo</creator><creatorcontrib>Jo, Jung-Bok ; Li, Yinzhen ; Gen, Mitsuo</creatorcontrib><description>Networks provide a useful way for modeling real world problems and are extensively used in many different types of systems: communications, hydraulic, mechanical, electronic, and logistics. The transportation problem (TP) is known as one of the important network problems. When the TP problem is associated with additional fixed cost for establishing the facilities or fulfilling the demand of customers, then it is called fixed charge transportation problem (fcTP).
This problem is one of the NP-hard (IE/OR) problems that are difficult to solve using traditional methods. This paper aims to show the application of spanning tree-based Genetic Algorithm (GA) approach for solving nonlinear fixed charge transportation problem. Our new idea lies on the GA representation that includes the feasibility criteria and repairing procedure for the chromosome. Several numerical experimental results are presented to show the effectiveness of the proposed method.</description><identifier>ISSN: 0360-8352</identifier><identifier>EISSN: 1879-0550</identifier><identifier>DOI: 10.1016/j.cie.2007.06.022</identifier><identifier>CODEN: CINDDL</identifier><language>eng</language><publisher>New York: Elsevier Ltd</publisher><subject>Fixed costs ; Genetic algorithms ; Nonlinear fixed charge problem ; Nonlinear programming ; Spanning tree-based genetic algorithm ; Studies ; Transportation problem ; Transportation problem (Operations research)</subject><ispartof>Computers & industrial engineering, 2007-09, Vol.53 (2), p.290-298</ispartof><rights>2007</rights><rights>Copyright Pergamon Press Inc. Sep 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c452t-7147c2d540fdb5f15233e224aec4cbdaa3d19dd30f560b27aa45dff1fa2f8bb73</citedby><cites>FETCH-LOGICAL-c452t-7147c2d540fdb5f15233e224aec4cbdaa3d19dd30f560b27aa45dff1fa2f8bb73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.cie.2007.06.022$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>315,781,785,3551,27929,27930,46000</link.rule.ids></links><search><creatorcontrib>Jo, Jung-Bok</creatorcontrib><creatorcontrib>Li, Yinzhen</creatorcontrib><creatorcontrib>Gen, Mitsuo</creatorcontrib><title>Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm</title><title>Computers & industrial engineering</title><description>Networks provide a useful way for modeling real world problems and are extensively used in many different types of systems: communications, hydraulic, mechanical, electronic, and logistics. The transportation problem (TP) is known as one of the important network problems. When the TP problem is associated with additional fixed cost for establishing the facilities or fulfilling the demand of customers, then it is called fixed charge transportation problem (fcTP).
This problem is one of the NP-hard (IE/OR) problems that are difficult to solve using traditional methods. This paper aims to show the application of spanning tree-based Genetic Algorithm (GA) approach for solving nonlinear fixed charge transportation problem. Our new idea lies on the GA representation that includes the feasibility criteria and repairing procedure for the chromosome. Several numerical experimental results are presented to show the effectiveness of the proposed method.</description><subject>Fixed costs</subject><subject>Genetic algorithms</subject><subject>Nonlinear fixed charge problem</subject><subject>Nonlinear programming</subject><subject>Spanning tree-based genetic algorithm</subject><subject>Studies</subject><subject>Transportation problem</subject><subject>Transportation problem (Operations research)</subject><issn>0360-8352</issn><issn>1879-0550</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNqFkb1O5DAURq0VK-0w8ADbRVvQJVzbcZyICiFgkRA0LK3l2NeDRxl7sDMI3h6jodoCqtucc_8-Qn5TaCjQ7nTdGI8NA5ANdA0w9oMsaC-HGoSAA7IA3kHdc8F-kcOc1wDQioEuyONdDJMPqFPl_CvayjzptMJqTjrkbUyznn0M1TbFccJNNb5VeatD8GFVEMR61LlIKww4e1PpaRWTn582R-Sn01PG48-6JP-uLh8u_ta399c3F-e3tWkFm2tJW2mYFS04OwpHBeMcGWs1mtaMVmtu6WAtByc6GJnUuhXWOeo0c_04Sr4kJ_u-ZcHnHeZZbXw2OE06YNxlxYEyxmT3LUgHwfuhzF-SP_-B67hLoRyhGOWylb0YCkT3kEkx54RObZPf6PSmKKiPPNRalTzURx4KOlXyKM7Z3sHyjxePSeWCBIPWJzSzstF_Yb8DOJqUIA</recordid><startdate>20070901</startdate><enddate>20070901</enddate><creator>Jo, Jung-Bok</creator><creator>Li, Yinzhen</creator><creator>Gen, Mitsuo</creator><general>Elsevier Ltd</general><general>Pergamon Press Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>FR3</scope><scope>P64</scope><scope>RC3</scope></search><sort><creationdate>20070901</creationdate><title>Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm</title><author>Jo, Jung-Bok ; Li, Yinzhen ; Gen, Mitsuo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c452t-7147c2d540fdb5f15233e224aec4cbdaa3d19dd30f560b27aa45dff1fa2f8bb73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Fixed costs</topic><topic>Genetic algorithms</topic><topic>Nonlinear fixed charge problem</topic><topic>Nonlinear programming</topic><topic>Spanning tree-based genetic algorithm</topic><topic>Studies</topic><topic>Transportation problem</topic><topic>Transportation problem (Operations research)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jo, Jung-Bok</creatorcontrib><creatorcontrib>Li, Yinzhen</creatorcontrib><creatorcontrib>Gen, Mitsuo</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Engineering Research Database</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Genetics Abstracts</collection><jtitle>Computers & industrial engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jo, Jung-Bok</au><au>Li, Yinzhen</au><au>Gen, Mitsuo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm</atitle><jtitle>Computers & industrial engineering</jtitle><date>2007-09-01</date><risdate>2007</risdate><volume>53</volume><issue>2</issue><spage>290</spage><epage>298</epage><pages>290-298</pages><issn>0360-8352</issn><eissn>1879-0550</eissn><coden>CINDDL</coden><abstract>Networks provide a useful way for modeling real world problems and are extensively used in many different types of systems: communications, hydraulic, mechanical, electronic, and logistics. The transportation problem (TP) is known as one of the important network problems. When the TP problem is associated with additional fixed cost for establishing the facilities or fulfilling the demand of customers, then it is called fixed charge transportation problem (fcTP).
This problem is one of the NP-hard (IE/OR) problems that are difficult to solve using traditional methods. This paper aims to show the application of spanning tree-based Genetic Algorithm (GA) approach for solving nonlinear fixed charge transportation problem. Our new idea lies on the GA representation that includes the feasibility criteria and repairing procedure for the chromosome. Several numerical experimental results are presented to show the effectiveness of the proposed method.</abstract><cop>New York</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cie.2007.06.022</doi><tpages>9</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0360-8352 |
| ispartof | Computers & industrial engineering, 2007-09, Vol.53 (2), p.290-298 |
| issn | 0360-8352 1879-0550 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_30122276 |
| source | Access via ScienceDirect (Elsevier) |
| subjects | Fixed costs Genetic algorithms Nonlinear fixed charge problem Nonlinear programming Spanning tree-based genetic algorithm Studies Transportation problem Transportation problem (Operations research) |
| title | Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-13T08%3A05%3A13IST&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=Nonlinear%20fixed%20charge%20transportation%20problem%20by%20spanning%20tree-based%20genetic%20algorithm&rft.jtitle=Computers%20&%20industrial%20engineering&rft.au=Jo,%20Jung-Bok&rft.date=2007-09-01&rft.volume=53&rft.issue=2&rft.spage=290&rft.epage=298&rft.pages=290-298&rft.issn=0360-8352&rft.eissn=1879-0550&rft.coden=CINDDL&rft_id=info:doi/10.1016/j.cie.2007.06.022&rft_dat=%3Cproquest_cross%3E1334464701%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=213747859&rft_id=info:pmid/&rft_els_id=S036083520700112X&rfr_iscdi=true |