Parallel and distributed local search in COMET
The availability of commodity multiprocessors and high-speed networks of workstations offer significant opportunities for addressing the increasing computational requirements of optimization applications. To leverage these potential benefits, it is important, however, to make parallel and distribute...
Saved in:
| Published in: | Computers & operations research Vol. 36; no. 8; pp. 2357 - 2375 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Pergamon Press Inc
01.08.2009
|
| Subjects: | |
| ISSN: | 0305-0548, 0305-0548 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The availability of commodity multiprocessors and high-speed networks of workstations offer significant opportunities for addressing the increasing computational requirements of optimization applications. To leverage these potential benefits, it is important, however, to make parallel and distributed processing easily accessible to a wide audience of optimization programmers. This paper addresses this challenge by proposing parallel and distributed programming abstractions that keep the distance from sequential local search algorithms as small as possible. The abstractions, including parallel loops, interruptions, thread pools, and shared objects, are compositional and cleanly separate the optimization program and the parallel instructions. They have been evaluated experimentally on a variety of applications, including warehouse location and coloring, for which they provide significant speedups. [PUBLICATION ABSTRACT] |
|---|---|
| AbstractList | The availability of commodity multiprocessors and high-speed networks of workstations offer significant opportunities for addressing the increasing computational requirements of optimization applications. To leverage these potential benefits, it is important, however, to make parallel and distributed processing easily accessible to a wide audience of optimization programmers. This paper addresses this challenge by proposing parallel and distributed programming abstractions that keep the distance from sequential local search algorithms as small as possible. The abstractions, including parallel loops, interruptions, thread pools, and shared objects, are compositional and cleanly separate the optimization program and the parallel instructions. They have been evaluated experimentally on a variety of applications, including warehouse location and coloring, for which they provide significant speedups. [PUBLICATION ABSTRACT] The availability of commodity multiprocessors and high-speed networks of workstations offer significant opportunities for addressing the increasing computational requirements of optimization applications. To leverage these potential benefits, it is important, however, to make parallel and distributed processing easily accessible to a wide audience of optimization programmers. This paper addresses this challenge by proposing parallel and distributed programming abstractions that keep the distance from sequential local search algorithms as small as possible. The abstractions, including parallel loops, interruptions, thread pools, and shared objects, are compositional and cleanly separate the optimization program and the parallel instructions. They have been evaluated experimentally on a variety of applications, including warehouse location and coloring, for which they provide significant speedups. |
| Author | See, Andrew Van Hentenryck, Pascal Michel, Laurent |
| Author_xml | – sequence: 1 givenname: Laurent surname: Michel fullname: Michel, Laurent – sequence: 2 givenname: Andrew surname: See fullname: See, Andrew – sequence: 3 givenname: Pascal surname: Van Hentenryck fullname: Van Hentenryck, Pascal |
| BookMark | eNp9kD1PwzAQhi1UJNrCD2CLGNgS7Nj58Iii8iEVlaHM1sV2hCPXLnYy8O9JVAbUgdNJd8Pz3nt6V2jhvNMI3RKcEUzKhz6TPmQ5xnU2N2EXaIkpLlJcsHrxZ79Cqxh7PFWVkyXK3iGAtdom4FSiTByCacdBq8R6CTaJGoL8TIxLmt3bZn-NLjuwUd_8zjX6eNrsm5d0u3t-bR63qaSUDakCqaqu1TyXOIe6qBlRBDjXhOGypJRUWJZMScVyTsuayK6TdcfKtoBWg-Z0je5Pd4_Bf406DuJgotTWgtN-jGJyoZjn1QTenYG9H4ObfhOET75FzWeInCAZfIxBd-IYzAHCtyBYzPGJXkzxiTk-MTdhk6Y600gzwGC8GwIY-4_yB8p7dlo |
| CODEN | CMORAP |
| CitedBy_id | crossref_primary_10_1007_s10732_015_9292_3 crossref_primary_10_1016_j_jpdc_2016_11_014 crossref_primary_10_1016_j_compchemeng_2013_12_001 crossref_primary_10_1017_S1471068418000340 crossref_primary_10_1109_TPDS_2013_251 crossref_primary_10_1007_s10601_014_9168_4 crossref_primary_10_1007_s10601_012_9131_1 crossref_primary_10_1007_s10732_017_9342_0 crossref_primary_10_1007_s42979_022_01120_1 crossref_primary_10_1007_s11227_016_1712_0 crossref_primary_10_1007_s10601_016_9242_1 crossref_primary_10_1007_s10732_013_9228_8 crossref_primary_10_1002_cpe_1855 |
| Cites_doi | 10.1109/99.660313 10.1007/BF02023076 10.1007/0-387-23529-9_21 10.1007/978-3-540-74970-7_37 10.1007/978-3-540-48085-3_25 10.1016/S0377-2217(03)00247-9 10.1016/0004-3702(92)90007-K 10.1109/69.729707 10.1016/j.ejor.2005.02.046 10.1023/B:SUPE.0000020179.55383.ad 10.1023/A:1006314320276 10.1287/mnsc.42.6.797 10.1007/978-3-540-30201-8_7 10.1016/0020-0190(93)90029-9 10.1006/jpdc.1996.0107 10.1007/978-3-540-45193-8_5 10.1007/11493853_28 10.1145/582427.582430 |
| ContentType | Journal Article |
| Copyright | Copyright Pergamon Press Inc. Aug 2009 |
| Copyright_xml | – notice: Copyright Pergamon Press Inc. Aug 2009 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cor.2008.08.014 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 0305-0548 |
| EndPage | 2375 |
| ExternalDocumentID | 1642717271 10_1016_j_cor_2008_08_014 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9DU 9JN 9JO AAAKF AAAKG AABNK AAEDT AAEDW AAFJI AAIKJ AAKOC AALRI AAOAW AAQXK AARIN AATTM AAXKI AAXUO AAYFN AAYWO AAYXX ABAOU ABBOA ABDPE ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABWVN ABXDB ACDAQ ACGFO ACGFS ACLOT ACNCT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADGUI ADJOM ADMUD ADNMO AEBSH AEFWE AEHXG AEIPS AEKER AENEX AEUPX AFFNX AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGII AIGVJ AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOMHK AOUOD APLSM APXCP ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CITATION CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UPT VH1 WUQ XPP ZMT ~02 ~G- ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c334t-dacd7fbe92c02a85841d1a99e1406633170c64dcd4293681cffc8f46b5abeae93 |
| ISICitedReferencesCount | 15 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000263630300005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Wed Oct 01 14:18:37 EDT 2025 Sun Nov 30 04:06:15 EST 2025 Sat Nov 29 03:23:33 EST 2025 Tue Nov 18 22:43:39 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 8 |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c334t-dacd7fbe92c02a85841d1a99e1406633170c64dcd4293681cffc8f46b5abeae93 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 195845897 |
| PQPubID | 45870 |
| PageCount | 19 |
| ParticipantIDs | proquest_miscellaneous_33430927 proquest_journals_195845897 crossref_primary_10_1016_j_cor_2008_08_014 crossref_citationtrail_10_1016_j_cor_2008_08_014 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-08-01 |
| PublicationDateYYYYMMDD | 2009-08-01 |
| PublicationDate_xml | – month: 08 year: 2009 text: 2009-08-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2009 |
| Publisher | Pergamon Press Inc |
| Publisher_xml | – name: Pergamon Press Inc |
| References | 10.1016/j.cor.2008.08.014_bib9 10.1016/j.cor.2008.08.014_bib19 10.1016/j.cor.2008.08.014_bib18 Gomes (10.1016/j.cor.2008.08.014_bib3) 2000; 24 Walser (10.1016/j.cor.2008.08.014_bib22) 1998 Van Hentenryck (10.1016/j.cor.2008.08.014_bib10) 2005 Michel (10.1016/j.cor.2008.08.014_bib16) 2004; 157 Nowicki (10.1016/j.cor.2008.08.014_bib11) 1996; 42 Dagum (10.1016/j.cor.2008.08.014_bib24) 1998; 5 Yokoo (10.1016/j.cor.2008.08.014_bib36) 1998; 10 Blumofe (10.1016/j.cor.2008.08.014_bib30) 1996; 37 10.1016/j.cor.2008.08.014_bib31 10.1016/j.cor.2008.08.014_bib12 10.1016/j.cor.2008.08.014_bib34 10.1016/j.cor.2008.08.014_bib33 Moore (10.1016/j.cor.2008.08.014_bib1) 1965; 38 10.1016/j.cor.2008.08.014_bib5 Luby (10.1016/j.cor.2008.08.014_bib2) 1993; 47 10.1016/j.cor.2008.08.014_bib7 10.1016/j.cor.2008.08.014_bib15 Dell’Amico (10.1016/j.cor.2008.08.014_bib17) 1993; 41 10.1016/j.cor.2008.08.014_bib8 10.1016/j.cor.2008.08.014_bib14 Philippsen (10.1016/j.cor.2008.08.014_bib35) 1995; 6 10.1016/j.cor.2008.08.014_bib29 Laguna (10.1016/j.cor.2008.08.014_bib6) 2002 Mauricio (10.1016/j.cor.2008.08.014_bib4) 2006; 174 Chandra (10.1016/j.cor.2008.08.014_bib25) 2000 Minton (10.1016/j.cor.2008.08.014_bib13) 1992; 58 Dorne (10.1016/j.cor.2008.08.014_bib20) 1998 Dotu (10.1016/j.cor.2008.08.014_bib21) 2005 10.1016/j.cor.2008.08.014_bib23 Ralphs (10.1016/j.cor.2008.08.014_bib32) 2004; 28 10.1016/j.cor.2008.08.014_bib28 10.1016/j.cor.2008.08.014_bib27 10.1016/j.cor.2008.08.014_bib26 |
| References_xml | – volume: 5 start-page: 46 year: 1998 ident: 10.1016/j.cor.2008.08.014_bib24 article-title: OpenMP: an industry-standard API for shared-memory programming publication-title: IEEE Computational Science and Engineering doi: 10.1109/99.660313 – volume: 41 start-page: 231 year: 1993 ident: 10.1016/j.cor.2008.08.014_bib17 article-title: Applying tabu search to the job-shop scheduling problem publication-title: Annals of Operations Research doi: 10.1007/BF02023076 – volume: 6 start-page: 109 year: 1995 ident: 10.1016/j.cor.2008.08.014_bib35 article-title: JavaParty—transparent remote objects in Java publication-title: Concurrency: Practice & Experience – ident: 10.1016/j.cor.2008.08.014_bib15 doi: 10.1007/0-387-23529-9_21 – ident: 10.1016/j.cor.2008.08.014_bib33 doi: 10.1007/978-3-540-74970-7_37 – ident: 10.1016/j.cor.2008.08.014_bib7 doi: 10.1007/978-3-540-48085-3_25 – volume: 157 start-page: 576 issue: 3 year: 2004 ident: 10.1016/j.cor.2008.08.014_bib16 article-title: A simple tabu search for warehouse location publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(03)00247-9 – ident: 10.1016/j.cor.2008.08.014_bib29 – volume: 38 start-page: 114 issue: 8 year: 1965 ident: 10.1016/j.cor.2008.08.014_bib1 article-title: Cramming more components onto integrated circuits publication-title: Electronics – volume: 58 start-page: 161 issue: 1–3 year: 1992 ident: 10.1016/j.cor.2008.08.014_bib13 article-title: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems publication-title: Artificial Intelligence doi: 10.1016/0004-3702(92)90007-K – ident: 10.1016/j.cor.2008.08.014_bib23 – volume: 10 start-page: 673 issue: 5 year: 1998 ident: 10.1016/j.cor.2008.08.014_bib36 article-title: The distributed constraint satisfaction problem: formalization and algorithms publication-title: Knowledge and Data Engineering doi: 10.1109/69.729707 – volume: 174 start-page: 54 issue: 1 year: 2006 ident: 10.1016/j.cor.2008.08.014_bib4 article-title: A hybrid multistart heuristic for the uncapacitated facility location problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.02.046 – ident: 10.1016/j.cor.2008.08.014_bib27 – ident: 10.1016/j.cor.2008.08.014_bib14 – ident: 10.1016/j.cor.2008.08.014_bib12 – start-page: 183 year: 2002 ident: 10.1016/j.cor.2008.08.014_bib6 article-title: Scatter search – year: 2000 ident: 10.1016/j.cor.2008.08.014_bib25 – volume: 28 start-page: 215 issue: 2 year: 2004 ident: 10.1016/j.cor.2008.08.014_bib32 article-title: A library hierarchy for implementing scalable parallel search algorithms publication-title: Journal of Supercomputing doi: 10.1023/B:SUPE.0000020179.55383.ad – ident: 10.1016/j.cor.2008.08.014_bib31 – volume: 24 start-page: 67 issue: 1/2 year: 2000 ident: 10.1016/j.cor.2008.08.014_bib3 article-title: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems publication-title: Journal of Automated Reasoning doi: 10.1023/A:1006314320276 – volume: 42 start-page: 797 issue: 6 year: 1996 ident: 10.1016/j.cor.2008.08.014_bib11 article-title: A fast taboo search algorithm for the job shop problem publication-title: Management Science doi: 10.1287/mnsc.42.6.797 – ident: 10.1016/j.cor.2008.08.014_bib18 – ident: 10.1016/j.cor.2008.08.014_bib19 doi: 10.1007/978-3-540-30201-8_7 – year: 2005 ident: 10.1016/j.cor.2008.08.014_bib10 – year: 1998 ident: 10.1016/j.cor.2008.08.014_bib22 – start-page: 2018 year: 2005 ident: 10.1016/j.cor.2008.08.014_bib21 article-title: A simple hybrid evolutionary algorithm for finding Golomb rulers – ident: 10.1016/j.cor.2008.08.014_bib5 – volume: 47 start-page: 173 issue: 4 year: 1993 ident: 10.1016/j.cor.2008.08.014_bib2 article-title: Optimal speedup of Las Vegas algorithms publication-title: Information Processing Letters doi: 10.1016/0020-0190(93)90029-9 – ident: 10.1016/j.cor.2008.08.014_bib28 – volume: 37 start-page: 55 issue: 1 year: 1996 ident: 10.1016/j.cor.2008.08.014_bib30 article-title: Cilk: an efficient multithreaded runtime system publication-title: Journal of Parallel and Distributed Computing doi: 10.1006/jpdc.1996.0107 – ident: 10.1016/j.cor.2008.08.014_bib8 doi: 10.1007/978-3-540-45193-8_5 – ident: 10.1016/j.cor.2008.08.014_bib26 doi: 10.1007/11493853_28 – year: 1998 ident: 10.1016/j.cor.2008.08.014_bib20 – ident: 10.1016/j.cor.2008.08.014_bib9 doi: 10.1145/582427.582430 – ident: 10.1016/j.cor.2008.08.014_bib34 |
| SSID | ssj0000721 |
| Score | 2.0312665 |
| Snippet | The availability of commodity multiprocessors and high-speed networks of workstations offer significant opportunities for addressing the increasing... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 2357 |
| SubjectTerms | Distributed processing High speed Optimization Optimization algorithms Parallel processing Studies |
| Title | Parallel and distributed local search in COMET |
| URI | https://www.proquest.com/docview/195845897 https://www.proquest.com/docview/33430927 |
| Volume | 36 |
| WOSCitedRecordID | wos000263630300005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 0305-0548 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFD6CDiF44FJAK-OSB_YCytTYTmM_TqMVoNFVIpP6FjmOI21CaZd0aPx7jmM7TUHi8oAURVGapIrPyfFn-5zvA3jDeBmbMXUYM0VChoA2zEmuQhYVEUkUjUotW7GJZD7ny6VYOHmrppUTSKqK39yI9X81NZ5DY5vS2X8wd_dQPIHHaHTco9lx_1eGX8ja6KNYCoDC8OIaSSvElW239W47zXFy9nma9sGpV3hoWn9YrXXt8uQcI1A3c2zzR31ZdS915otN6-llSVotL-zdTKp8_d0G34VslHsNP-EgunS3rtDK5PvFliDTB1HLYuKchfcjIrUE1K53JdQKpfwSue0kwiU2fO0yXHGz9aW7LNnzs2x2fnqapdNlekhn66vQSIiZpfZD-t6a8zbskSQWfAB7xx-ny0_brjlpC_G6N_DL3G3C30__vAtUdvvpFnykj-CBGzUEx9baj-GWroZw1xctDOGhN13gYvUQ7veYJp_AkfeKAL0i6HlF0HpFYO0bXFRB6xVP4Xw2TU8-hE4qI1SUsk1YSFUkZa4FUWMiOaJK_NakEBrHz4gpESSO1YQVqkD4QSc8UmWpeMkmeSxzLbWgz2BQrSq9D4FCSKsRJAqeEMZVLCXLJ7oscnySjshkBGPfLplyPPJGzuRr5hMGLzNsSqdvilvERvC2u2VtSVR-d_GBb-zMfVZNZiiRWMxFMoLX3a8YCM3qlqz06rrJsB3oWJDk-R-vOIB7W79-AYNNfa1fwh31bXPR1K-cz_wASPx7pA |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parallel+and+distributed+local+search+in+COMET&rft.jtitle=Computers+%26+operations+research&rft.au=Michel%2C+Laurent&rft.au=See%2C+Andrew&rft.au=Van+Hentenryck%2C+Pascal&rft.date=2009-08-01&rft.issn=0305-0548&rft.volume=36&rft.issue=8&rft.spage=2357&rft.epage=2375&rft_id=info:doi/10.1016%2Fj.cor.2008.08.014&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |