MCS—A new algorithm for multicriteria optimisation in constraint programming

MCS—A new algorithm for multicriteria optimisation in constraint programming

In this paper we propose a new algorithm called MCS for the search for solutions to multicriteria combinatorial optimisation problems. To quickly produce a solution that offers a good trade-off between criteria, the MCS algorithm alternates several Branch & Bound searches following diversified s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of operations research 2006-10, Vol.147 (1), p.143-174
Hauptverfasser: Huédé, F. Le, Grabisch, M., Labreuche, C., Savéant, P.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Automation
Branch & bound algorithms
Computer Science
Heuristic
Multiple criteria decision making
Operations Research
Optimization
Pareto optimum
Preferences
Studies
Tradeoff analysis
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 174
container_issue 1
container_start_page 143
container_title Annals of operations research
container_volume 147
creator Huédé, F. Le
Grabisch, M.
Labreuche, C.
Savéant, P.
description In this paper we propose a new algorithm called MCS for the search for solutions to multicriteria combinatorial optimisation problems. To quickly produce a solution that offers a good trade-off between criteria, the MCS algorithm alternates several Branch & Bound searches following diversified search strategies. It is implemented in CP in a dedicated framework and can be specialised for either complete or partial search. [PUBLICATION ABSTRACT]
doi_str_mv 10.1007/s10479-006-0064-1
format Article
fullrecord <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00515579v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1141566471</sourcerecordid><originalsourceid>FETCH-LOGICAL-c306t-d1e4ac0031dabbd7b60f883ff13cc6b004424e1c7cc26fb89cd13a323f8fb5553</originalsourceid><addsrcrecordid>eNo9kMFOwzAQRC0EEqXwAdwsbhwCu7GdOMeqAopU4ACcLceJW1dJXOwUxI2P4Av5EhIVcRitdvQ0Gg0h5whXCJBfRwSeFwlANooneEAmKPI0KRiTh2QCqeCJYAyOyUmMGwBAlGJCHh_mzz9f3zPa1R9UNysfXL9uqfWBtrumd2b46-A09dvetS7q3vmOuo4a38U-aNf1dBv8Kui2dd3qlBxZ3cT67O9Oyevtzct8kSyf7u7ns2ViGGR9UmHNtQFgWOmyrPIyAyslsxaZMVkJwHnKazS5MWlmS1mYCplmKbPSlkIINiWX-9y1btQ2uFaHT-W1U4vZUo0egEAh8uIdB_Zizw4933Z17NXG70I31FMpcgESMzlAuIdM8DGG2v6nIqhxYbVfeAjORnGF7Be69G9l</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>214508168</pqid></control><display><type>article</type><title>MCS—A new algorithm for multicriteria optimisation in constraint programming</title><source>Business Source Complete</source><source>SpringerLink Journals - AutoHoldings</source><creator>Huédé, F. Le ; Grabisch, M. ; Labreuche, C. ; Savéant, P.</creator><creatorcontrib>Huédé, F. Le ; Grabisch, M. ; Labreuche, C. ; Savéant, P.</creatorcontrib><description>In this paper we propose a new algorithm called MCS for the search for solutions to multicriteria combinatorial optimisation problems. To quickly produce a solution that offers a good trade-off between criteria, the MCS algorithm alternates several Branch &amp; Bound searches following diversified search strategies. It is implemented in CP in a dedicated framework and can be specialised for either complete or partial search. [PUBLICATION ABSTRACT]</description><identifier>ISSN: 0254-5330</identifier><identifier>EISSN: 1572-9338</identifier><identifier>DOI: 10.1007/s10479-006-0064-1</identifier><language>eng</language><publisher>New York: Springer Nature B.V</publisher><subject>Algorithms ; Automation ; Branch &amp; bound algorithms ; Computer Science ; Heuristic ; Multiple criteria decision making ; Operations Research ; Optimization ; Pareto optimum ; Preferences ; Studies ; Tradeoff analysis</subject><ispartof>Annals of operations research, 2006-10, Vol.147 (1), p.143-174</ispartof><rights>Springer Science+Business Media, LLC 2006</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c306t-d1e4ac0031dabbd7b60f883ff13cc6b004424e1c7cc26fb89cd13a323f8fb5553</citedby><cites>FETCH-LOGICAL-c306t-d1e4ac0031dabbd7b60f883ff13cc6b004424e1c7cc26fb89cd13a323f8fb5553</cites><orcidid>0000-0002-3283-1496 ; 0000-0002-6298-0986</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,776,780,881,27903,27904</link.rule.ids><backlink>$$Uhttps://hal.science/hal-00515579$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Huédé, F. Le</creatorcontrib><creatorcontrib>Grabisch, M.</creatorcontrib><creatorcontrib>Labreuche, C.</creatorcontrib><creatorcontrib>Savéant, P.</creatorcontrib><title>MCS—A new algorithm for multicriteria optimisation in constraint programming</title><title>Annals of operations research</title><description>In this paper we propose a new algorithm called MCS for the search for solutions to multicriteria combinatorial optimisation problems. To quickly produce a solution that offers a good trade-off between criteria, the MCS algorithm alternates several Branch &amp; Bound searches following diversified search strategies. It is implemented in CP in a dedicated framework and can be specialised for either complete or partial search. [PUBLICATION ABSTRACT]</description><subject>Algorithms</subject><subject>Automation</subject><subject>Branch &amp; bound algorithms</subject><subject>Computer Science</subject><subject>Heuristic</subject><subject>Multiple criteria decision making</subject><subject>Operations Research</subject><subject>Optimization</subject><subject>Pareto optimum</subject><subject>Preferences</subject><subject>Studies</subject><subject>Tradeoff analysis</subject><issn>0254-5330</issn><issn>1572-9338</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNo9kMFOwzAQRC0EEqXwAdwsbhwCu7GdOMeqAopU4ACcLceJW1dJXOwUxI2P4Av5EhIVcRitdvQ0Gg0h5whXCJBfRwSeFwlANooneEAmKPI0KRiTh2QCqeCJYAyOyUmMGwBAlGJCHh_mzz9f3zPa1R9UNysfXL9uqfWBtrumd2b46-A09dvetS7q3vmOuo4a38U-aNf1dBv8Kui2dd3qlBxZ3cT67O9Oyevtzct8kSyf7u7ns2ViGGR9UmHNtQFgWOmyrPIyAyslsxaZMVkJwHnKazS5MWlmS1mYCplmKbPSlkIINiWX-9y1btQ2uFaHT-W1U4vZUo0egEAh8uIdB_Zizw4933Z17NXG70I31FMpcgESMzlAuIdM8DGG2v6nIqhxYbVfeAjORnGF7Be69G9l</recordid><startdate>200610</startdate><enddate>200610</enddate><creator>Huédé, F. Le</creator><creator>Grabisch, M.</creator><creator>Labreuche, C.</creator><creator>Savéant, P.</creator><general>Springer Nature B.V</general><general>Springer Verlag</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7TA</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0002-3283-1496</orcidid><orcidid>https://orcid.org/0000-0002-6298-0986</orcidid></search><sort><creationdate>200610</creationdate><title>MCS—A new algorithm for multicriteria optimisation in constraint programming</title><author>Huédé, F. Le ; Grabisch, M. ; Labreuche, C. ; Savéant, P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c306t-d1e4ac0031dabbd7b60f883ff13cc6b004424e1c7cc26fb89cd13a323f8fb5553</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithms</topic><topic>Automation</topic><topic>Branch &amp; bound algorithms</topic><topic>Computer Science</topic><topic>Heuristic</topic><topic>Multiple criteria decision making</topic><topic>Operations Research</topic><topic>Optimization</topic><topic>Pareto optimum</topic><topic>Preferences</topic><topic>Studies</topic><topic>Tradeoff analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Huédé, F. Le</creatorcontrib><creatorcontrib>Grabisch, M.</creatorcontrib><creatorcontrib>Labreuche, C.</creatorcontrib><creatorcontrib>Savéant, P.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Materials Business File</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Annals of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Huédé, F. Le</au><au>Grabisch, M.</au><au>Labreuche, C.</au><au>Savéant, P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>MCS—A new algorithm for multicriteria optimisation in constraint programming</atitle><jtitle>Annals of operations research</jtitle><date>2006-10</date><risdate>2006</risdate><volume>147</volume><issue>1</issue><spage>143</spage><epage>174</epage><pages>143-174</pages><issn>0254-5330</issn><eissn>1572-9338</eissn><abstract>In this paper we propose a new algorithm called MCS for the search for solutions to multicriteria combinatorial optimisation problems. To quickly produce a solution that offers a good trade-off between criteria, the MCS algorithm alternates several Branch &amp; Bound searches following diversified search strategies. It is implemented in CP in a dedicated framework and can be specialised for either complete or partial search. [PUBLICATION ABSTRACT]</abstract><cop>New York</cop><pub>Springer Nature B.V</pub><doi>10.1007/s10479-006-0064-1</doi><tpages>32</tpages><orcidid>https://orcid.org/0000-0002-3283-1496</orcidid><orcidid>https://orcid.org/0000-0002-6298-0986</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0254-5330
ispartof Annals of operations research, 2006-10, Vol.147 (1), p.143-174
issn 0254-5330
1572-9338
language eng
recordid cdi_hal_primary_oai_HAL_hal_00515579v1
source Business Source Complete; SpringerLink Journals - AutoHoldings
subjects Algorithms
Automation
Branch & bound algorithms
Computer Science
Heuristic
Multiple criteria decision making
Operations Research
Optimization
Pareto optimum
Preferences
Studies
Tradeoff analysis
title MCS—A new algorithm for multicriteria optimisation in constraint programming
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T00%3A22%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=MCS%E2%80%94A%20new%20algorithm%20for%20multicriteria%20optimisation%20in%20constraint%20programming&rft.jtitle=Annals%20of%20operations%20research&rft.au=Hu%C3%A9d%C3%A9,%20F.%20Le&rft.date=2006-10&rft.volume=147&rft.issue=1&rft.spage=143&rft.epage=174&rft.pages=143-174&rft.issn=0254-5330&rft.eissn=1572-9338&rft_id=info:doi/10.1007/s10479-006-0064-1&rft_dat=%3Cproquest_hal_p%3E1141566471%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=214508168&rft_id=info:pmid/&rfr_iscdi=true