A branch and bound algorithm for mixed zero-one multiple objective linear programming
In this paper, a branch and bound algorithm for the generation of the efficient set in mixed zero-one multiple objective linear programming problems is presented. The algorithm is developed as to take account of the multiple objectives in the node fathoming procedure. In order to extend the algorith...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 1998-06, Vol.107 (3), p.530-541 |
|---|---|
| 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 | 541 |
|---|---|
| container_issue | 3 |
| container_start_page | 530 |
| container_title | European journal of operational research |
| container_volume | 107 |
| creator | Mavrotas, G. Diakoulaki, D. |
| description | In this paper, a branch and bound algorithm for the generation of the efficient set in mixed zero-one multiple objective linear programming problems is presented. The algorithm is developed as to take account of the multiple objectives in the node fathoming procedure. In order to extend the algorithm's applicability to large sized problems from real life, an interactive procedure is introduced which systematically reduces the number of efficient points and thus saves considerable computational effort without losing essential information. The algorithm is tested in randomly generated problems along with a case study conceming the power generation sector |
| doi_str_mv | 10.1016/S0377-2217(97)00077-5 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204144260</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221797000775</els_id><sourcerecordid>44173915</sourcerecordid><originalsourceid>FETCH-LOGICAL-c497t-203202d02e996288d6eb78b8ee9512628fbc670391b79dba4cf81c1ac9456f8d3</originalsourceid><addsrcrecordid>eNqFkMFq3DAQhkVJodu0j1AQIYfm4EaSLUs6lbCkTUighyRnIcvjXS225UrepenTZzYb9hrBzEji_2eGj5BvnP3gjNeXD6xUqhCCq-9GXTDG8CU_kAXXShS1rtkJWRwln8jnnDco4pLLBXm6ok1yo19TN7a0iVvMrl_FFOb1QLuY6BD-QUv_Q4pFHIEO234OUw80Nhvwc9gB7cMILtEpxVVywxDG1RfysXN9hq9v9ZQ8_bp-XN4U939-3y6v7gtfGTUXgpWCiZYJMKYWWrc1NEo3GsBILvCna3ytWGl4o0zbuMp3mnvuvKlk3em2PCVnh744--8W8mw3cZtGHGkFq3hViZqhSB5EPsWcE3R2SmFw6dlyZvcA7StAu6djjbKvAK1E393Bl2ACfzQBnk1MkO3Olo4zhfl5fzNGYwkYJcaEIUtmZcXteh6w2_nbqi5713d76CEfuwphKiY0yn4eZIDYdgGSzT7A6KENCXHbNoZ31n4B2Wadkg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204144260</pqid></control><display><type>article</type><title>A branch and bound algorithm for mixed zero-one multiple objective linear programming</title><source>RePEc</source><source>Access via ScienceDirect (Elsevier)</source><creator>Mavrotas, G. ; Diakoulaki, D.</creator><creatorcontrib>Mavrotas, G. ; Diakoulaki, D.</creatorcontrib><description>In this paper, a branch and bound algorithm for the generation of the efficient set in mixed zero-one multiple objective linear programming problems is presented. The algorithm is developed as to take account of the multiple objectives in the node fathoming procedure. In order to extend the algorithm's applicability to large sized problems from real life, an interactive procedure is introduced which systematically reduces the number of efficient points and thus saves considerable computational effort without losing essential information. The algorithm is tested in randomly generated problems along with a case study conceming the power generation sector</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/S0377-2217(97)00077-5</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Branch and bound ; Exact sciences and technology ; Integer programming ; Linear programming ; Mathematical programming ; Multiple criteria programming ; Operational research and scientific management ; Operational research. Management science ; Studies</subject><ispartof>European journal of operational research, 1998-06, Vol.107 (3), p.530-541</ispartof><rights>1998</rights><rights>1998 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Jun 16, 1998</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c497t-203202d02e996288d6eb78b8ee9512628fbc670391b79dba4cf81c1ac9456f8d3</citedby><cites>FETCH-LOGICAL-c497t-203202d02e996288d6eb78b8ee9512628fbc670391b79dba4cf81c1ac9456f8d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0377-2217(97)00077-5$$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=2294028$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a107_3ay_3a1998_3ai_3a3_3ap_3a530-541.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Mavrotas, G.</creatorcontrib><creatorcontrib>Diakoulaki, D.</creatorcontrib><title>A branch and bound algorithm for mixed zero-one multiple objective linear programming</title><title>European journal of operational research</title><description>In this paper, a branch and bound algorithm for the generation of the efficient set in mixed zero-one multiple objective linear programming problems is presented. The algorithm is developed as to take account of the multiple objectives in the node fathoming procedure. In order to extend the algorithm's applicability to large sized problems from real life, an interactive procedure is introduced which systematically reduces the number of efficient points and thus saves considerable computational effort without losing essential information. The algorithm is tested in randomly generated problems along with a case study conceming the power generation sector</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Branch and bound</subject><subject>Exact sciences and technology</subject><subject>Integer programming</subject><subject>Linear programming</subject><subject>Mathematical programming</subject><subject>Multiple criteria programming</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNqFkMFq3DAQhkVJodu0j1AQIYfm4EaSLUs6lbCkTUighyRnIcvjXS225UrepenTZzYb9hrBzEji_2eGj5BvnP3gjNeXD6xUqhCCq-9GXTDG8CU_kAXXShS1rtkJWRwln8jnnDco4pLLBXm6ok1yo19TN7a0iVvMrl_FFOb1QLuY6BD-QUv_Q4pFHIEO234OUw80Nhvwc9gB7cMILtEpxVVywxDG1RfysXN9hq9v9ZQ8_bp-XN4U939-3y6v7gtfGTUXgpWCiZYJMKYWWrc1NEo3GsBILvCna3ytWGl4o0zbuMp3mnvuvKlk3em2PCVnh744--8W8mw3cZtGHGkFq3hViZqhSB5EPsWcE3R2SmFw6dlyZvcA7StAu6djjbKvAK1E393Bl2ACfzQBnk1MkO3Olo4zhfl5fzNGYwkYJcaEIUtmZcXteh6w2_nbqi5713d76CEfuwphKiY0yn4eZIDYdgGSzT7A6KENCXHbNoZ31n4B2Wadkg</recordid><startdate>19980616</startdate><enddate>19980616</enddate><creator>Mavrotas, G.</creator><creator>Diakoulaki, D.</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>19980616</creationdate><title>A branch and bound algorithm for mixed zero-one multiple objective linear programming</title><author>Mavrotas, G. ; Diakoulaki, D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c497t-203202d02e996288d6eb78b8ee9512628fbc670391b79dba4cf81c1ac9456f8d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Branch and bound</topic><topic>Exact sciences and technology</topic><topic>Integer programming</topic><topic>Linear programming</topic><topic>Mathematical programming</topic><topic>Multiple criteria programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mavrotas, G.</creatorcontrib><creatorcontrib>Diakoulaki, D.</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>Mavrotas, G.</au><au>Diakoulaki, D.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A branch and bound algorithm for mixed zero-one multiple objective linear programming</atitle><jtitle>European journal of operational research</jtitle><date>1998-06-16</date><risdate>1998</risdate><volume>107</volume><issue>3</issue><spage>530</spage><epage>541</epage><pages>530-541</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>In this paper, a branch and bound algorithm for the generation of the efficient set in mixed zero-one multiple objective linear programming problems is presented. The algorithm is developed as to take account of the multiple objectives in the node fathoming procedure. In order to extend the algorithm's applicability to large sized problems from real life, an interactive procedure is introduced which systematically reduces the number of efficient points and thus saves considerable computational effort without losing essential information. The algorithm is tested in randomly generated problems along with a case study conceming the power generation sector</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0377-2217(97)00077-5</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 1998-06, Vol.107 (3), p.530-541 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204144260 |
| source | RePEc; Access via ScienceDirect (Elsevier) |
| subjects | Algorithms Applied sciences Branch and bound Exact sciences and technology Integer programming Linear programming Mathematical programming Multiple criteria programming Operational research and scientific management Operational research. Management science Studies |
| title | A branch and bound algorithm for mixed zero-one multiple objective linear programming |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T19%3A14%3A32IST&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%20branch%20and%20bound%20algorithm%20for%20mixed%20zero-one%20multiple%20objective%20linear%20programming&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Mavrotas,%20G.&rft.date=1998-06-16&rft.volume=107&rft.issue=3&rft.spage=530&rft.epage=541&rft.pages=530-541&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/S0377-2217(97)00077-5&rft_dat=%3Cproquest_cross%3E44173915%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=204144260&rft_id=info:pmid/&rft_els_id=S0377221797000775&rfr_iscdi=true |