Two combinatorial optimization problems at the interface of computer science and operations research
Solving large combinatorial optimization problems is a ubiquitous task across multiple disciplines. Developing efficient procedures for solving these problems has been of great interest to both researchers and practitioners. Over the last half century, vast amounts of research have been devoted to s...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Dissertation |
| Jazyk: | angličtina |
| Vydáno: |
ProQuest Dissertations & Theses
01.01.2008
|
| Témata: | |
| ISBN: | 0549912312, 9780549912316 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Solving large combinatorial optimization problems is a ubiquitous task across multiple disciplines. Developing efficient procedures for solving these problems has been of great interest to both researchers and practitioners. Over the last half century, vast amounts of research have been devoted to studying various methods in tackling these problems. These methods can be divided into two categories, heuristic methods and exact algorithms. Heuristic methods can often lead to near optimal solutions in a relatively time efficient manner, but provide no guarantees on optimality. Exact algorithms guarantee optimality, but are often very time consuming. This dissertation focuses on designing efficient exact algorithms that can solve larger problem instances with faster computational time. A general framework for an exact algorithm, called the Branch, Bound, and Remember algorithm, is proposed in this dissertation. Three variations of single machine scheduling problems are presented and used to evaluate the efficiency of the Branch, Bound, and Remember algorithm. The computational results show that the Branch, Bound, and Remember algorithms outperforms the best known algorithms in the literature. While the Branch, Bound, and Remember algorithm can be used for solving combinatorial optimization problems, it does not address the subject of post-optimality selection after the combinatorial optimization problem is solved. Post-optimality selection is a common problem in multi-objective combinatorial optimization problems where there exists a set of optimal solutions called Pareto optimal (non-dominated) solutions. Post-optimality selection is the process of selecting the best solutions within the Pareto optimal solution set. In many real-world applications, a Pareto solution set (either optimal or near-optimal) can be extremely large, and can be very challenging for a decision maker to evaluate and select the best solution. To address the post-optimality selection problem, this dissertation also proposes a new discrete optimization problem to help the decision-maker to obtain an optimal preferred subset of Pareto optimal solutions. This discrete optimization problem is proven to be NP-hard. To solve this problem, exact algorithms and heuristic methods are presented. Different multi-objective problems with various numbers of objectives and constraints are used to compare the performances of the proposed algorithms and heuristics. |
|---|---|
| AbstractList | Solving large combinatorial optimization problems is a ubiquitous task across multiple disciplines. Developing efficient procedures for solving these problems has been of great interest to both researchers and practitioners. Over the last half century, vast amounts of research have been devoted to studying various methods in tackling these problems. These methods can be divided into two categories, heuristic methods and exact algorithms. Heuristic methods can often lead to near optimal solutions in a relatively time efficient manner, but provide no guarantees on optimality. Exact algorithms guarantee optimality, but are often very time consuming. This dissertation focuses on designing efficient exact algorithms that can solve larger problem instances with faster computational time. A general framework for an exact algorithm, called the Branch, Bound, and Remember algorithm, is proposed in this dissertation. Three variations of single machine scheduling problems are presented and used to evaluate the efficiency of the Branch, Bound, and Remember algorithm. The computational results show that the Branch, Bound, and Remember algorithms outperforms the best known algorithms in the literature. While the Branch, Bound, and Remember algorithm can be used for solving combinatorial optimization problems, it does not address the subject of post-optimality selection after the combinatorial optimization problem is solved. Post-optimality selection is a common problem in multi-objective combinatorial optimization problems where there exists a set of optimal solutions called Pareto optimal (non-dominated) solutions. Post-optimality selection is the process of selecting the best solutions within the Pareto optimal solution set. In many real-world applications, a Pareto solution set (either optimal or near-optimal) can be extremely large, and can be very challenging for a decision maker to evaluate and select the best solution. To address the post-optimality selection problem, this dissertation also proposes a new discrete optimization problem to help the decision-maker to obtain an optimal preferred subset of Pareto optimal solutions. This discrete optimization problem is proven to be NP-hard. To solve this problem, exact algorithms and heuristic methods are presented. Different multi-objective problems with various numbers of objectives and constraints are used to compare the performances of the proposed algorithms and heuristics. |
| Author | Kao, Gio K |
| Author_xml | – sequence: 1 givenname: Gio surname: Kao middlename: K fullname: Kao, Gio K |
| BookMark | eNotj8tqBCEURIUkkMxk_kGyb7B9tS7DkBcMZDNZD2pfGUO3dtQmkK-PeayKKjh1b23QZUwRLtCGCK51T1lPr9GulGAJIZoxwukNGo-fCbs02xBNTTmYCaelhjl8mRpSxEtOdoK5YFNxPQMOsUL2xgFO_odb1uZxcQFiy0wcGw75ly04QwGT3fkWXXkzFdj96xa9PT4c98_d4fXpZX9_6BwVg-4GDlZ4rvqBuUFaQ4TpCVFEa0qcob6XTFvGR0sd01QIqaR10irwSnHtB7ZFd3-97euPFUo9vac1x3by1NZKIpRg7Bu--1RX |
| ContentType | Dissertation |
| Copyright | Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| Copyright_xml | – notice: Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| DBID | 04Z 050 053 0BH AAFGM ABJCF ABQRF ABRGS ABUWG ADZZV AFKRA AFLLJ AGAJT AQTIP AZQEC BENPR BGLVJ CBPLH CCPQU DWQXO EU9 G20 HCIFZ M8- OK5 PHGZM PHGZT PIMPY PKEHL PQCXX PQEST PQGLB PQQKQ PQUKI |
| DatabaseName | Dissertations & Theses Europe Full Text: Business Dissertations & Theses Europe Full Text: Health & Medicine Dissertations & Theses Europe Full Text: Science & Technology ProQuest Dissertations and Theses Professional ProQuest Central Korea - hybrid linking Materials Science & Engineering Collection Technology Collection - hybrid linking Materials Science & Engineering Collection - hybrid linking ProQuest Central (Alumni) ProQuest Central (Alumni) - hybrid linking ProQuest Central UK/Ireland SciTech Premium Collection - hybrid linking ProQuest Central Essentials - hybrid linking ProQuest Women's & Gender Studies - hybrid linking ProQuest Central Essentials ProQuest Central Technology Collection ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest One Community College ProQuest Central ProQuest Dissertations & Theses A&I ProQuest Dissertations & Theses Global SciTech Premium Collection ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection Dissertations & Theses @ Big Ten Academic Alliance ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest Central - hybrid linking ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition |
| DatabaseTitle | Publicly Available Content Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Dissertations & Theses: Open ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea Dissertations & Theses @ CIC Institutions Dissertations & Theses Europe Full Text: Business ProQuest Central (New) Dissertations & Theses Europe Full Text: Health & Medicine ProQuest One Academic Eastern Edition ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations and Theses Professional ProQuest Dissertations & Theses Global Dissertations & Theses Europe Full Text: Science & Technology ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Academic ProQuest Dissertations & Theses A&I ProQuest One Academic (New) |
| DatabaseTitleList | Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: ProQuest Publicly Available Content url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 1631124401 |
| Genre | Dissertation/Thesis |
| GroupedDBID | 04Z 050 053 0BH 123 8R4 8R5 ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CBPLH CCPQU DWQXO EU9 G20 HCIFZ M8- OK5 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI Q2X |
| ID | FETCH-LOGICAL-c2579-74eb5f48173c76ba05a100809920ca2f1639b34db2c39255686bc6b8ef8849f73 |
| IEDL.DBID | BENPR |
| ISBN | 0549912312 9780549912316 |
| IngestDate | Mon Jun 30 07:42:09 EDT 2025 |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2579-74eb5f48173c76ba05a100809920ca2f1639b34db2c39255686bc6b8ef8849f73 |
| Notes | SourceType-Dissertations & Theses-1 ObjectType-Dissertation/Thesis-1 content type line 12 |
| OpenAccessLink | https://www.proquest.com/docview/304605853?pq-origsite=%requestingapplication% |
| PQID | 304605853 |
| PQPubID | 18750 |
| ParticipantIDs | proquest_journals_304605853 |
| PublicationCentury | 2000 |
| PublicationDate | 20080101 |
| PublicationDateYYYYMMDD | 2008-01-01 |
| PublicationDate_xml | – month: 01 year: 2008 text: 20080101 day: 01 |
| PublicationDecade | 2000 |
| PublicationYear | 2008 |
| Publisher | ProQuest Dissertations & Theses |
| Publisher_xml | – name: ProQuest Dissertations & Theses |
| SSID | ssib000933042 |
| Score | 1.477305 |
| Snippet | Solving large combinatorial optimization problems is a ubiquitous task across multiple disciplines. Developing efficient procedures for solving these problems... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Computer science Industrial engineering Operations research |
| Title | Two combinatorial optimization problems at the interface of computer science and operations research |
| URI | https://www.proquest.com/docview/304605853 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFH7o5kE8zJ-o05GD12Cbpm16EtRNBR1FpszTSNIEPdjqOvXf92VLRVC8eAwloaR5730v7_X7AI5SixgiURGVgknKUxFRTIMsNYXSLLCZlHP9lPvrdDgU43GW-96c2rdVNj5x7qiLSrs78mNfwYujk5dX6kSjXHHVK2gsQ9sRlfEWtE_7w_z2t3Td5UHopUPmWXeacfLDCc8jy6Dzz3dah7XzbxX1DVgy5SZ0Gq0G4k13C4rRR0VwVUyEXZqNp45U6C2e_W-YxAvL1ETOCGJC4mgkplZqQyrr5i2W8_GSyLLA6WZxemriGYMet-Fu0B-dXVKvsEA1mmpGU25UbLkI00iniZJBLB3ZD6JGFmjJLIK1TEW8UEwjjnJkZYnSiRLGCsEzm0Y70Cqr0uwC0TLWHLEIxjrFszATWgmuVGgE06GVfA-6zR5OvJnUk68N3P_zaRdWF20a7ubjAFqz6Zs5hBX9Pnuqpz3_0XuwfMECHOVXN_nDJ5HIuwU |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V07T8MwED6VFgnEUJ4CysMDjBGN4ybOgBgoFVUf6lBQmYrt2IKBBppCxY_iP3JuHYQEYuvAGFm25Nz57rvz-T6Ak8gghghl4AlOhcciHngYBhlPJ1LRqomFmPGn3LajbpcPBnGvAB_5WxhbVpnbxJmhTlJlc-Rn7gavFlw8v3iWNMperuYMGnOtaOn3KUZs2XmzjuI9pbRx1b-89hypgKdQO2MvYlrWDON-FKgolKJaE7a_DQIlWlWCGsQnsQxYIqlC6GD7c4VShZJrwzmLTRTguktQYqjrvAilXrPTu_stPWDjLvQKPnVdfvLv8IfRn3myRvmf_YN1WKt_qxjYgIIebUI556IgzjRtQdKfpgR3gYG-TSPgqSIpWsMn98yUOOKcjIgJQcxLbJuMsRFKk9TYefPlHB4gYpTgdD0_HRlxHZEetuFmIRvdgeIoHeldIErUFEOshb5cstiPuZKcSelrTpVvBNuDSi6zoTMD2fBLYPt_jh7DynW_0x62m91WBVbnJSk2y3MAxcn4VR_CsnqbPGbjI6dwBO4XLd9Pau4Spg |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V07T8MwED4VihBiKE8B5eEBxqiN4ybOgBgoFVVL1aGgMhXbsQUDCTSFip_Gv-PcOggJxMbAGFm25Nzr8_l8H8BxZBBDhDLwBKfCYxEPPDwGGU8nUtG6iYWY8afcdKNejw-Hcb8E78VbGFtWWfjEmaNOMmVz5DV3g9cIasZVRfSbrbOnZ88SSNmL1oJNY64hHf02xdNbftpuoqhPKG1dDM4vPUcw4CnU1NiLmJYNw7gfBSoKpag3hO11g6CJ1pWgBrFKLAOWSKoQRtheXaFUoeTacM5iEwW47gKUEZEzNLFyv33Vv_0pVWDPYBghfOo6_hTf4bcAMItqrco__h9rsNr8UkmwDiWdbkCl4KggzmVtQjKYZgR3JB9Sm15AayMZeslH9_yUOEKdnIgJQSxMbPuMsRFKk8zYefPlHE4gIk1wup5bTU5cp6T7Lbj-k41uw2KapXoHiBINxRCDYYyXLPZjriRnUvqaU-UbwXahWshv5NxDPvoU3t6vo0ewjEIdddu9ThVW5pUqNvmzD4uT8Ys-gCX1OnnIx4dO9wjc_bV4PwDoMhtm |
| 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%3Adissertation&rft.genre=dissertation&rft.title=Two+combinatorial+optimization+problems+at+the+interface+of+computer+science+and+operations+research&rft.DBID=04Z%3B050%3B053%3B0BH%3BAAFGM%3BABJCF%3BABQRF%3BABRGS%3BABUWG%3BADZZV%3BAFKRA%3BAFLLJ%3BAGAJT%3BAQTIP%3BAZQEC%3BBENPR%3BBGLVJ%3BCBPLH%3BCCPQU%3BDWQXO%3BEU9%3BG20%3BHCIFZ%3BM8-%3BOK5%3BPHGZM%3BPHGZT%3BPIMPY%3BPKEHL%3BPQCXX%3BPQEST%3BPQGLB%3BPQQKQ%3BPQUKI&rft.PQPubID=18750&rft.au=Kao%2C+Gio+K&rft.date=2008-01-01&rft.pub=ProQuest+Dissertations+%26+Theses&rft.isbn=0549912312&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=1631124401 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780549912316/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780549912316/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780549912316/sc.gif&client=summon&freeimage=true |