Pareto optimal solutions of a cost–time trade-off bulk transportation problem
A cost–time trade-off bulk transportation problem with the objectives to minimize the total cost and duration of bulk transportation without according priorities to them is considered. The entire requirement of each destination is to be met from one source only; however a source can supply to any nu...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 2008-07, Vol.188 (1), p.85-100 |
|---|---|
| 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 | 100 |
|---|---|
| container_issue | 1 |
| container_start_page | 85 |
| container_title | European journal of operational research |
| container_volume | 188 |
| creator | Prakash, Satya Kumar, Pranav Prasad, B.V.N.S. Gupta, Anuj |
| description | A cost–time trade-off bulk transportation problem with the objectives to minimize the total cost and duration of bulk transportation without according priorities to them is considered. The entire requirement of each destination is to be met from one source only; however a source can supply to any number of destinations subject to the availability of the commodity at it. Two new algorithms are provided to obtain the set of Pareto optimal solutions of this problem. This work extends and generalizes the work related to single-objective and prioritized two-objective bulk transportation problems done in the past while providing flexibility in decision making. |
| doi_str_mv | 10.1016/j.ejor.2007.03.040 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204143436</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221707004079</els_id><sourcerecordid>1410016331</sourcerecordid><originalsourceid>FETCH-LOGICAL-c478t-a7af4a7b27ea51a5d5809dd130d8d3db3843a6a55cf8866f36f17b38304768ee3</originalsourceid><addsrcrecordid>eNp9UMtqHDEQFMGBrJ38QE6DwceZtKQZSQFfjLHzwOAckrPQSi0yk9nVWNIafMs_5A_zJelhjY8RtB7dVdWtYuw9h44DVx-mDqeUOwGgO5Ad9PCKbbjRolVGwQnbgNS6FYLrN-y0lAkA-MCHDbv_5jLW1KSljjs3NyXNhzqmfWlSbFzjU6l_f_-hGjY1u4BtirHZHuZf63NflpSrW_HNktN2xt1b9jq6ueC75_OM_bi9-X79ub27__Tl-uqu9b02tXXaxd7prdDoBu6GMBj4GAKXEEyQYStNL51yw-CjMUpFqSLXlJXQa2UQ5Rk7P-pS34cDlmqndMh7amkF9LyXvVQEEkeQz6mUjNEumX6ZnywHu_pmJ7v6ZlffLEhLvhHp65GUcUH_wkBaBMViH6103BjanyiIul7HNUmxUJiBxMH-rDsSu3ge0xXv5kie-bG8iBKZayE04S6POCTPHkfMtvgR9x7DmNFXG9L4v5n_AWM-nds</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204143436</pqid></control><display><type>article</type><title>Pareto optimal solutions of a cost–time trade-off bulk transportation problem</title><source>RePEc</source><source>Access via ScienceDirect (Elsevier)</source><creator>Prakash, Satya ; Kumar, Pranav ; Prasad, B.V.N.S. ; Gupta, Anuj</creator><creatorcontrib>Prakash, Satya ; Kumar, Pranav ; Prasad, B.V.N.S. ; Gupta, Anuj</creatorcontrib><description>A cost–time trade-off bulk transportation problem with the objectives to minimize the total cost and duration of bulk transportation without according priorities to them is considered. The entire requirement of each destination is to be met from one source only; however a source can supply to any number of destinations subject to the availability of the commodity at it. Two new algorithms are provided to obtain the set of Pareto optimal solutions of this problem. This work extends and generalizes the work related to single-objective and prioritized two-objective bulk transportation problems done in the past while providing flexibility in decision making.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2007.03.040</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Bulk transportation ; Decision theory. Utility theory ; Exact sciences and technology ; Hierarchies ; Logistics ; Multi-objective programming ; Operational research and scientific management ; Operational research. Management science ; Optimization ; Pareto optimal ; Pareto optimum ; Studies ; Tradeoff analysis ; Transportation ; Transportation problem (Operations research)</subject><ispartof>European journal of operational research, 2008-07, Vol.188 (1), p.85-100</ispartof><rights>2007 Elsevier B.V.</rights><rights>2008 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Jul 1, 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c478t-a7af4a7b27ea51a5d5809dd130d8d3db3843a6a55cf8866f36f17b38304768ee3</citedby><cites>FETCH-LOGICAL-c478t-a7af4a7b27ea51a5d5809dd130d8d3db3843a6a55cf8866f36f17b38304768ee3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.ejor.2007.03.040$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,4008,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20017227$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a188_3ay_3a2008_3ai_3a1_3ap_3a85-100.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Prakash, Satya</creatorcontrib><creatorcontrib>Kumar, Pranav</creatorcontrib><creatorcontrib>Prasad, B.V.N.S.</creatorcontrib><creatorcontrib>Gupta, Anuj</creatorcontrib><title>Pareto optimal solutions of a cost–time trade-off bulk transportation problem</title><title>European journal of operational research</title><description>A cost–time trade-off bulk transportation problem with the objectives to minimize the total cost and duration of bulk transportation without according priorities to them is considered. The entire requirement of each destination is to be met from one source only; however a source can supply to any number of destinations subject to the availability of the commodity at it. Two new algorithms are provided to obtain the set of Pareto optimal solutions of this problem. This work extends and generalizes the work related to single-objective and prioritized two-objective bulk transportation problems done in the past while providing flexibility in decision making.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Bulk transportation</subject><subject>Decision theory. Utility theory</subject><subject>Exact sciences and technology</subject><subject>Hierarchies</subject><subject>Logistics</subject><subject>Multi-objective programming</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimization</subject><subject>Pareto optimal</subject><subject>Pareto optimum</subject><subject>Studies</subject><subject>Tradeoff analysis</subject><subject>Transportation</subject><subject>Transportation problem (Operations research)</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9UMtqHDEQFMGBrJ38QE6DwceZtKQZSQFfjLHzwOAckrPQSi0yk9nVWNIafMs_5A_zJelhjY8RtB7dVdWtYuw9h44DVx-mDqeUOwGgO5Ad9PCKbbjRolVGwQnbgNS6FYLrN-y0lAkA-MCHDbv_5jLW1KSljjs3NyXNhzqmfWlSbFzjU6l_f_-hGjY1u4BtirHZHuZf63NflpSrW_HNktN2xt1b9jq6ueC75_OM_bi9-X79ub27__Tl-uqu9b02tXXaxd7prdDoBu6GMBj4GAKXEEyQYStNL51yw-CjMUpFqSLXlJXQa2UQ5Rk7P-pS34cDlmqndMh7amkF9LyXvVQEEkeQz6mUjNEumX6ZnywHu_pmJ7v6ZlffLEhLvhHp65GUcUH_wkBaBMViH6103BjanyiIul7HNUmxUJiBxMH-rDsSu3ge0xXv5kie-bG8iBKZayE04S6POCTPHkfMtvgR9x7DmNFXG9L4v5n_AWM-nds</recordid><startdate>20080701</startdate><enddate>20080701</enddate><creator>Prakash, Satya</creator><creator>Kumar, Pranav</creator><creator>Prasad, B.V.N.S.</creator><creator>Gupta, Anuj</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20080701</creationdate><title>Pareto optimal solutions of a cost–time trade-off bulk transportation problem</title><author>Prakash, Satya ; Kumar, Pranav ; Prasad, B.V.N.S. ; Gupta, Anuj</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c478t-a7af4a7b27ea51a5d5809dd130d8d3db3843a6a55cf8866f36f17b38304768ee3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Bulk transportation</topic><topic>Decision theory. Utility theory</topic><topic>Exact sciences and technology</topic><topic>Hierarchies</topic><topic>Logistics</topic><topic>Multi-objective programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimization</topic><topic>Pareto optimal</topic><topic>Pareto optimum</topic><topic>Studies</topic><topic>Tradeoff analysis</topic><topic>Transportation</topic><topic>Transportation problem (Operations research)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Prakash, Satya</creatorcontrib><creatorcontrib>Kumar, Pranav</creatorcontrib><creatorcontrib>Prasad, B.V.N.S.</creatorcontrib><creatorcontrib>Gupta, Anuj</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering 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><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Prakash, Satya</au><au>Kumar, Pranav</au><au>Prasad, B.V.N.S.</au><au>Gupta, Anuj</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Pareto optimal solutions of a cost–time trade-off bulk transportation problem</atitle><jtitle>European journal of operational research</jtitle><date>2008-07-01</date><risdate>2008</risdate><volume>188</volume><issue>1</issue><spage>85</spage><epage>100</epage><pages>85-100</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>A cost–time trade-off bulk transportation problem with the objectives to minimize the total cost and duration of bulk transportation without according priorities to them is considered. The entire requirement of each destination is to be met from one source only; however a source can supply to any number of destinations subject to the availability of the commodity at it. Two new algorithms are provided to obtain the set of Pareto optimal solutions of this problem. This work extends and generalizes the work related to single-objective and prioritized two-objective bulk transportation problems done in the past while providing flexibility in decision making.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2007.03.040</doi><tpages>16</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 2008-07, Vol.188 (1), p.85-100 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204143436 |
| source | RePEc; Access via ScienceDirect (Elsevier) |
| subjects | Algorithms Applied sciences Bulk transportation Decision theory. Utility theory Exact sciences and technology Hierarchies Logistics Multi-objective programming Operational research and scientific management Operational research. Management science Optimization Pareto optimal Pareto optimum Studies Tradeoff analysis Transportation Transportation problem (Operations research) |
| title | Pareto optimal solutions of a cost–time trade-off bulk transportation problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T08%3A51%3A01IST&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=Pareto%20optimal%20solutions%20of%20a%20cost%E2%80%93time%20trade-off%20bulk%20transportation%20problem&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Prakash,%20Satya&rft.date=2008-07-01&rft.volume=188&rft.issue=1&rft.spage=85&rft.epage=100&rft.pages=85-100&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2007.03.040&rft_dat=%3Cproquest_cross%3E1410016331%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=204143436&rft_id=info:pmid/&rft_els_id=S0377221707004079&rfr_iscdi=true |