Solving a selective dial-a-ride problem with logic-based Benders decomposition
•We propose logic-based Benders algorithms for a selective dial-a-ride problem.•Subproblems are solved using a combination of CP and MILP algorithms.•Four different strategies for refining Benders cuts are tested.•We speed up the master-problem using heuristic boosting techniques. Today’s society is...
Uloženo v:
| Vydáno v: | Computers & operations research Ročník 96; s. 30 - 54 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
Elsevier Ltd
01.08.2018
Pergamon Press Inc |
| Témata: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| 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 | •We propose logic-based Benders algorithms for a selective dial-a-ride problem.•Subproblems are solved using a combination of CP and MILP algorithms.•Four different strategies for refining Benders cuts are tested.•We speed up the master-problem using heuristic boosting techniques.
Today’s society is facing an ever-growing demand for mobility. To a high degree these needs can be fulfilled by individual and public transport. People that do not have access to the former and cannot use the latter require additional means of transportation. This is where dial-a-ride services come into play. The dial-a-ride problem considers transportation requests of people from pick-up to drop-off locations. Users specify time windows with respect to these points. Requests are served by a given vehicle fleet with limited capacity and tour duration per vehicle. Moreover, user inconvenience considerations are taken into account by limiting the travel time between origin and destination for each request.
Previous research on the dial-a-ride problem primarily focused on serving a given set of requests with a fixed-size vehicle fleet at minimal traveling costs. It is assumed that the request set is sufficiently small to be served by the available vehicles. We consider a different scenario in which a maximal number of requests shall be served under the given constraints, i.e., it is no longer guaranteed that all requests can be accepted. For this new problem variant we propose a compact mixed integer linear programming model as well as algorithms based on Benders decomposition. In particular, we employ logic-based Benders decomposition and branch-and-check using mixed integer linear programming and constraint programming algorithms. We consider different variants on how to generate Benders cuts as well as heuristic boosting techniques and different types of valid inequalities. Computational experiments illustrate the effectiveness of the suggested algorithms. |
|---|---|
| AbstractList | Today’s society is facing an ever-growing demand for mobility. To a high degree these needs can be fulfilled by individual and public transport. People that do not have access to the former and cannot use the latter require additional means of transportation. This is where dial-a-ride services come into play. The dial-a-ride problem considers transportation requests of people from pick-up to drop-off locations. Users specify time windows with respect to these points. Requests are served by a given vehicle fleet with limited capacity and tour duration per vehicle. Moreover, user inconvenience considerations are taken into account by limiting the travel time between origin and destination for each request. Previous research on the dial-a-ride problem primarily focused on serving a given set of requests with a fixed-size vehicle fleet at minimal traveling costs. It is assumed that the request set is sufficiently small to be served by the available vehicles. We consider a different scenario in which a maximal number of requests shall be served under the given constraints, i.e., it is no longer guaranteed that all requests can be accepted. For this new problem variant we propose a compact mixed integer linear programming model as well as algorithms based on Benders decomposition. In particular, we employ logic-based Benders decomposition and branch-and-check using mixed integer linear programming and constraint programming algorithms. We consider different variants on how to generate Benders cuts as well as heuristic boosting techniques and different types of valid inequalities. Computational experiments illustrate the effectiveness of the suggested algorithms. •We propose logic-based Benders algorithms for a selective dial-a-ride problem.•Subproblems are solved using a combination of CP and MILP algorithms.•Four different strategies for refining Benders cuts are tested.•We speed up the master-problem using heuristic boosting techniques. Today’s society is facing an ever-growing demand for mobility. To a high degree these needs can be fulfilled by individual and public transport. People that do not have access to the former and cannot use the latter require additional means of transportation. This is where dial-a-ride services come into play. The dial-a-ride problem considers transportation requests of people from pick-up to drop-off locations. Users specify time windows with respect to these points. Requests are served by a given vehicle fleet with limited capacity and tour duration per vehicle. Moreover, user inconvenience considerations are taken into account by limiting the travel time between origin and destination for each request. Previous research on the dial-a-ride problem primarily focused on serving a given set of requests with a fixed-size vehicle fleet at minimal traveling costs. It is assumed that the request set is sufficiently small to be served by the available vehicles. We consider a different scenario in which a maximal number of requests shall be served under the given constraints, i.e., it is no longer guaranteed that all requests can be accepted. For this new problem variant we propose a compact mixed integer linear programming model as well as algorithms based on Benders decomposition. In particular, we employ logic-based Benders decomposition and branch-and-check using mixed integer linear programming and constraint programming algorithms. We consider different variants on how to generate Benders cuts as well as heuristic boosting techniques and different types of valid inequalities. Computational experiments illustrate the effectiveness of the suggested algorithms. |
| Author | Riedler, Martin Raidl, Günther |
| Author_xml | – sequence: 1 givenname: Martin surname: Riedler fullname: Riedler, Martin email: riedler@ac.tuwien.ac.at – sequence: 2 givenname: Günther surname: Raidl fullname: Raidl, Günther email: raidl@ac.tuwien.ac.at |
| BookMark | eNp9kD1PwzAQhi1UJErhB7BFYk44x4njiAkqvqQKBkBis1z7XFylcbHTIv49rsrE0FtueZ_7eE7JqPc9EnJBoaBA-dWy0D4UJVBRACsAxBEZU9GwvOH1x4iMgUGdQ12JE3Ia4xJSNSUdk-dX321dv8hUFrFDPbgtZsapLld5cAazdfDzDlfZtxs-s84vnM7nKqLJbrE3GGJmUPvV2kc3ON-fkWOruojnf31C3u_v3qaP-ezl4Wl6M8s1q5shtzUiB9Fa0XJmbFvyxiII1agSWsFaqwGNAChLwzlSbmtWsapqUZSKV8qyCbncz03nfW0wDnLpN6FPK2WakJIcGppSdJ_SwccY0Mp1cCsVfiQFudMmlzJpkzttEphM2hLT_GO0G9TutyEo1x0kr_ckpse3DoOM2mGv0biQxErj3QH6F6YMiQ4 |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2024_04_013 crossref_primary_10_1016_j_eswa_2024_125996 crossref_primary_10_1016_j_cor_2020_104950 crossref_primary_10_1016_j_cor_2021_105666 crossref_primary_10_1016_j_ejor_2023_06_006 crossref_primary_10_1016_j_trpro_2021_01_060 crossref_primary_10_1016_j_cor_2021_105649 crossref_primary_10_1080_0305215X_2019_1699919 crossref_primary_10_1016_j_trb_2025_103234 crossref_primary_10_1016_j_trc_2024_104624 crossref_primary_10_1016_j_tra_2024_104360 crossref_primary_10_1016_j_tre_2023_103394 crossref_primary_10_1016_j_cie_2020_106641 crossref_primary_10_1287_ijoc_2021_1079 crossref_primary_10_1007_s10489_021_03079_7 crossref_primary_10_1016_j_ejor_2019_07_004 crossref_primary_10_1016_j_ejor_2024_05_036 crossref_primary_10_3390_sym11040514 crossref_primary_10_1016_j_comnet_2025_111146 crossref_primary_10_1016_j_cor_2019_104840 crossref_primary_10_1049_iet_its_2020_0138 crossref_primary_10_1016_j_ejor_2025_03_003 crossref_primary_10_1016_j_ejor_2025_05_051 crossref_primary_10_3390_electronics11030423 crossref_primary_10_1007_s43069_023_00242_3 crossref_primary_10_1016_j_cor_2021_105271 crossref_primary_10_1016_j_ejor_2023_07_002 |
| Cites_doi | 10.1016/j.omega.2015.02.001 10.1287/trsc.2013.0495 10.1287/trsc.29.1.63 10.1287/ijoc.1110.0458 10.1007/s11116-011-9375-4 10.1287/trsc.19.4.411 10.1007/s00291-016-0454-y 10.1016/j.omega.2006.05.006 10.1007/s10107-003-0375-9 10.1007/s11301-008-0036-4 10.1287/opre.1060.0371 10.1287/opre.1060.0286 10.1080/03052159808941240 10.1016/0191-2615(86)90020-2 10.1002/net.20177 10.1007/s10288-006-0018-0 10.1007/s10479-007-0170-8 10.1287/opre.1060.0283 10.1287/opre.1100.0881 10.1287/trsc.1100.0336 10.1145/362342.362367 10.1287/trsc.19.4.378 10.1016/S0191-2615(02)00045-0 10.1007/BF01386316 10.1287/trsc.1090.0272 10.1287/trsc.14.2.130 10.1016/j.ejor.2016.10.010 10.1051/ro/2015030 10.1007/BF00934810 |
| ContentType | Journal Article |
| Copyright | 2018 Elsevier Ltd Copyright Pergamon Press Inc. Aug 2018 |
| Copyright_xml | – notice: 2018 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Aug 2018 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cor.2018.03.008 |
| 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 |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X 0305-0548 |
| EndPage | 54 |
| ExternalDocumentID | 10_1016_j_cor_2018_03_008 S0305054818300777 |
| 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~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K 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- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD AGCQF JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c357t-f5ee6089f8963df9267fe08a7a209839fc0ed80022d66e16f5343449e82a64af3 |
| ISICitedReferencesCount | 32 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000436886100003&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 Aug 13 07:34:49 EDT 2025 Sat Nov 29 03:23:41 EST 2025 Tue Nov 18 21:37:43 EST 2025 Fri Feb 23 02:32:28 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Branch-and-check Dial-a-Ride problem Combinatorial Benders cuts Logic-based Benders decomposition Transportation |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c357t-f5ee6089f8963df9267fe08a7a209839fc0ed80022d66e16f5343449e82a64af3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2094496071 |
| PQPubID | 45870 |
| PageCount | 25 |
| ParticipantIDs | proquest_journals_2094496071 crossref_primary_10_1016_j_cor_2018_03_008 crossref_citationtrail_10_1016_j_cor_2018_03_008 elsevier_sciencedirect_doi_10_1016_j_cor_2018_03_008 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-08-01 |
| PublicationDateYYYYMMDD | 2018-08-01 |
| PublicationDate_xml | – month: 08 year: 2018 text: 2018-08-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2018 |
| Publisher | Elsevier Ltd Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc |
| References | Sexton, Bodin (bib0041) 1985; 19 Raidl, Baumhauer, Hu (bib0036) 2014 Codato, Fischetti (bib0009) 2006; 54 Benders (bib0004) 1962; 4 Psaraftis (bib0033) 1980; 14 Garey, Johnson (bib0019) 1990 Thorsteinsson (bib0042) 2001 Raidl, Baumhauer, Hu (bib0037) 2014; 8457 Ropke, Cordeau (bib0038) 2009; 43 Paquette, Bellavance, Cordeau, Laporte (bib0031) 2012; 39 Gansterer, Küçüktepe, Hartl (bib0017) 2017; 39 Jain, Van Hentenryck (bib0029) 2011 Hamdi, Loukil (bib0023) 2013 Garg, Smith (bib0020) 2008; 36 Hooker (bib0026) 2007; 55 Cordeau (bib0010) 2006; 54 Fazel-Zarandi, Beck (bib0016) 2012; 24 Cire, Hooker (bib0008) 2012 Häme, Hakula (bib0024) 2015; 49 Gecode Team, 2017. Gecode: generic constraint development environment. Available from Baugh, Kakivaya, Stone (bib0003) 1998; 30 Dumas, Desrosiers, Soumis (bib0015) 1989 Desrosiers, Dumas, Soumis, Taillefer, Villeneuve (bib0014) 1991 Hooker (bib0025) 2000 Qiu, Feuerriegel, Neumann (bib0035) 2017; 259 Jaw, Odoni, Psaraftis, Wilson (bib0030) 1986; 20 Cordeau, Laporte (bib0011) 2003; 1 Sexton, Bodin (bib0040) 1985; 19 Ropke, Cordeau, Laporte (bib0039) 2007; 49 Hooker, Ottosson (bib0027) 2003; 96 Cordeau, Laporte (bib0013) 2007; 153 . Ioachim, Desrosiers, Dumas, Solomon, Villeneuve (bib0028) 1995; 29 Bron, Kerbosch (bib0007) 1973; 16 Wheatley, Gzara, Jewkes (bib0044) 2015; 55 Cordeau, Laporte (bib0012) 2003; 37 Baklagis, Dikas, Minis (bib0001) 2016; 50 Bodin, Sexton (bib0006) 1986; 2 Baldacci, Bartolini, Mingozzi (bib0002) 2011; 59 Geoffrion (bib0022) 1972; 10 Parragh, Dörner, Hartl (bib0032) 2008; 58 Garey, Graham, Johnson (bib0018) 1976 Wolfler Calvo, Colorni (bib0045) 2007; 5 Berbeglia, Pesant, Rousseau (bib0005) 2011; 45 Qiu, Feuerriegel (bib0034) 2014 Tran, Beck (bib0043) 2012 10.1016/j.cor.2018.03.008_bib0021 Baldacci (10.1016/j.cor.2018.03.008_bib0002) 2011; 59 Jaw (10.1016/j.cor.2018.03.008_bib0030) 1986; 20 Baugh (10.1016/j.cor.2018.03.008_bib0003) 1998; 30 Tran (10.1016/j.cor.2018.03.008_bib0043) 2012 Garey (10.1016/j.cor.2018.03.008_bib0018) 1976 Gansterer (10.1016/j.cor.2018.03.008_bib0017) 2017; 39 Geoffrion (10.1016/j.cor.2018.03.008_bib0022) 1972; 10 Dumas (10.1016/j.cor.2018.03.008_bib0015) 1989 Hooker (10.1016/j.cor.2018.03.008_bib0026) 2007; 55 Thorsteinsson (10.1016/j.cor.2018.03.008_bib0042) 2001 Qiu (10.1016/j.cor.2018.03.008_bib0034) 2014 Wolfler Calvo (10.1016/j.cor.2018.03.008_bib0045) 2007; 5 Wheatley (10.1016/j.cor.2018.03.008_bib0044) 2015; 55 Bron (10.1016/j.cor.2018.03.008_bib0007) 1973; 16 Parragh (10.1016/j.cor.2018.03.008_bib0032) 2008; 58 Cordeau (10.1016/j.cor.2018.03.008_bib0012) 2003; 37 Garg (10.1016/j.cor.2018.03.008_bib0020) 2008; 36 Hamdi (10.1016/j.cor.2018.03.008_bib0023) 2013 Sexton (10.1016/j.cor.2018.03.008_bib0041) 1985; 19 Bodin (10.1016/j.cor.2018.03.008_bib0006) 1986; 2 Ropke (10.1016/j.cor.2018.03.008_bib0038) 2009; 43 Ioachim (10.1016/j.cor.2018.03.008_bib0028) 1995; 29 Paquette (10.1016/j.cor.2018.03.008_bib0031) 2012; 39 Ropke (10.1016/j.cor.2018.03.008_bib0039) 2007; 49 Psaraftis (10.1016/j.cor.2018.03.008_bib0033) 1980; 14 Raidl (10.1016/j.cor.2018.03.008_bib0036) 2014 Cordeau (10.1016/j.cor.2018.03.008_bib0013) 2007; 153 Garey (10.1016/j.cor.2018.03.008_bib0019) 1990 Cordeau (10.1016/j.cor.2018.03.008_bib0011) 2003; 1 Fazel-Zarandi (10.1016/j.cor.2018.03.008_bib0016) 2012; 24 Berbeglia (10.1016/j.cor.2018.03.008_bib0005) 2011; 45 Cordeau (10.1016/j.cor.2018.03.008_bib0010) 2006; 54 Desrosiers (10.1016/j.cor.2018.03.008_bib0014) 1991 Hooker (10.1016/j.cor.2018.03.008_bib0025) 2000 Cire (10.1016/j.cor.2018.03.008_bib0008) 2012 Codato (10.1016/j.cor.2018.03.008_bib0009) 2006; 54 Raidl (10.1016/j.cor.2018.03.008_bib0037) 2014; 8457 Baklagis (10.1016/j.cor.2018.03.008_bib0001) 2016; 50 Sexton (10.1016/j.cor.2018.03.008_bib0040) 1985; 19 Häme (10.1016/j.cor.2018.03.008_bib0024) 2015; 49 Jain (10.1016/j.cor.2018.03.008_bib0029) 2011 Hooker (10.1016/j.cor.2018.03.008_bib0027) 2003; 96 Qiu (10.1016/j.cor.2018.03.008_bib0035) 2017; 259 Benders (10.1016/j.cor.2018.03.008_bib0004) 1962; 4 |
| References_xml | – start-page: 149 year: 2000 end-page: 161 ident: bib0025 – volume: 96 start-page: 33 year: 2003 end-page: 60 ident: bib0027 article-title: Logic-based Benders decomposition publication-title: Math. Program. – volume: 50 start-page: 503 year: 2016 end-page: 517 ident: bib0001 article-title: The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing publication-title: RAIRO-Oper. Res. – volume: 30 start-page: 91 year: 1998 end-page: 123 ident: bib0003 article-title: Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing publication-title: Eng. Optim. – start-page: 149 year: 2014 end-page: 156 ident: bib0036 article-title: Boosting an exact logic-based Benders decomposition approach by variable neighborhood search publication-title: Proceedings of the Third International Conference on Variable Neighborhood Search – volume: 19 start-page: 411 year: 1985 end-page: 435 ident: bib0041 article-title: Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing publication-title: Transp. Sci. – volume: 37 start-page: 579 year: 2003 end-page: 594 ident: bib0012 article-title: A tabu search heuristic for the static multi-vehicle dial-a-ride problem publication-title: Transp. Res. Part B Methodol. – start-page: 16 year: 2001 end-page: 30 ident: bib0042 article-title: Branch-and-check: a hybrid framework integrating mixed integer programming and constraint logic programming publication-title: Principles and Practice of Constraint Programming — CP 2001 – year: 1991 ident: bib0014 article-title: An algorithm for mini-clustering in handicapped transport publication-title: Technical Report – volume: 55 start-page: 588 year: 2007 end-page: 602 ident: bib0026 article-title: Planning and scheduling by logic-based Benders decomposition publication-title: Oper. Res. – volume: 19 start-page: 378 year: 1985 end-page: 410 ident: bib0040 article-title: Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling publication-title: Transp. Sci. – volume: 39 start-page: 303 year: 2017 end-page: 319 ident: bib0017 article-title: The multi-vehicle profitable pickup and delivery problem publication-title: OR Spectr. – volume: 29 start-page: 63 year: 1995 end-page: 78 ident: bib0028 article-title: A request clustering algorithm for door-to-door handicapped transportation publication-title: Transp. Sci. – start-page: 1 year: 2013 end-page: 7 ident: bib0023 article-title: Logic-based Benders decomposition to solve the permutation flowshop scheduling problem with time lags publication-title: Proceedings of the Fifth International Conference on Modeling, Simulation and Applied Optimization (ICMSAO) – start-page: 774 year: 2012 end-page: 779 ident: bib0043 article-title: Logic-based benders decomposition for alternative resource scheduling with sequence dependent setups publication-title: Proceedings of the Twentieth European Conference on Artificial Intelligence – volume: 4 start-page: 238 year: 1962 end-page: 252 ident: bib0004 article-title: Partitioning procedures for solving mixed-variables programming problems publication-title: Numer. Math. – volume: 24 start-page: 387 year: 2012 end-page: 398 ident: bib0016 article-title: Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem publication-title: INFORMS J. Comput. – volume: 54 start-page: 756 year: 2006 end-page: 766 ident: bib0009 article-title: Combinatorial benders’ cuts for mixed-integer linear programming publication-title: Oper. Res. – volume: 1 start-page: 89 year: 2003 end-page: 101 ident: bib0011 article-title: The dial-a-ride problem (DARP): variants, modeling issues and algorithms publication-title: Q. J. Belgian French Italian Oper. Res. Soc. – volume: 43 start-page: 267 year: 2009 end-page: 286 ident: bib0038 article-title: Branch and cut and price for the pickup and delivery problem with time windows publication-title: Transp. Sci. – volume: 10 start-page: 237 year: 1972 end-page: 260 ident: bib0022 article-title: Generalized Benders decomposition publication-title: J. Optim. Theory. Appl. – volume: 16 start-page: 575 year: 1973 end-page: 577 ident: bib0007 article-title: Algorithm 457: finding all cliques of an undirected graph publication-title: Commun. ACM – volume: 49 start-page: 295 year: 2015 end-page: 310 ident: bib0024 article-title: A maximum cluster algorithm for checking the feasibility of dial-a-ride instances publication-title: Transp. Sci. – volume: 5 start-page: 61 year: 2007 end-page: 73 ident: bib0045 article-title: An effective and fast heuristic for the dial-a-ride problem publication-title: 4OR – volume: 36 start-page: 1057 year: 2008 end-page: 1071 ident: bib0020 article-title: Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios publication-title: Omega – volume: 14 start-page: 130 year: 1980 end-page: 154 ident: bib0033 article-title: A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem publication-title: Transp. Sci. – year: 2014 ident: bib0034 article-title: A multi-vehicle profitable pickup and delivery selection problem with time windows publication-title: Proceedings of the European Conference on Information Systems (ECIS) 2014 – volume: 49 start-page: 258 year: 2007 end-page: 272 ident: bib0039 article-title: Models and branch-and-cut algorithms for pickup and delivery problems with time windows publication-title: Networks – start-page: 400 year: 2011 end-page: 413 ident: bib0029 article-title: Large neighborhood search for dial-a-ride problems publication-title: International Conference on Principles and Practice of Constraint Programming — CP 2011 – year: 1990 ident: bib0019 publication-title: Computers and Intractability; A Guide to the Theory of NP-Completeness – volume: 39 start-page: 539 year: 2012 end-page: 564 ident: bib0031 article-title: Measuring quality of service in dial-a-ride operations: The case of a Canadian city publication-title: Transportation – volume: 59 start-page: 414 year: 2011 end-page: 426 ident: bib0002 article-title: An exact algorithm for the pickup and delivery problem with time windows publication-title: Oper. Res. – reference: . – volume: 153 start-page: 29 year: 2007 end-page: 46 ident: bib0013 article-title: The dial-a-ride problem: models and algorithms publication-title: Ann. Oper. Res. – reference: Gecode Team, 2017. Gecode: generic constraint development environment. Available from – start-page: 10 year: 1976 end-page: 22 ident: bib0018 article-title: Some NP-complete geometric problems publication-title: Proceedings of the Eighth Annual ACM Symposium on Theory of Computing – volume: 58 start-page: 81 year: 2008 end-page: 117 ident: bib0032 article-title: A survey on pickup and delivery models : Part II: transportation between pickup and delivery locations publication-title: J. Betriebswirtschaft – volume: 54 start-page: 573 year: 2006 end-page: 586 ident: bib0010 article-title: A branch-and-cut algorithm for the dial-a-ride problem publication-title: Oper. Res. – volume: 45 start-page: 399 year: 2011 end-page: 412 ident: bib0005 article-title: Checking the feasibility of dial-a-ride instances using constraint programming publication-title: Transp. Sci. – year: 2012 ident: bib0008 article-title: A heuristic logic-based benders method for the home health care problem publication-title: Technical Report – volume: 259 start-page: 155 year: 2017 end-page: 168 ident: bib0035 article-title: Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem publication-title: Eur. J. Oper. Res. – volume: 55 start-page: 10 year: 2015 end-page: 23 ident: bib0044 article-title: Logic-based Benders decomposition for an inventory-location problem with service constraints publication-title: Omega – volume: 2 start-page: 73 year: 1986 end-page: 86 ident: bib0006 article-title: The multi-vehicle subscriber dial-a-ride problem publication-title: TIMS Stud. Manag. Sci. – year: 1989 ident: bib0015 article-title: Large scale multi-vehicle dial-a-ride problems publication-title: Technical Report – volume: 20 start-page: 243 year: 1986 end-page: 257 ident: bib0030 article-title: A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows publication-title: Transp. Res. Part B Methodol. – volume: 8457 start-page: 183 year: 2014 end-page: 197 ident: bib0037 article-title: Speeding up logic-based Benders’ decomposition by a metaheuristic for a bi-level capacitated vehicle routing problem publication-title: Hybrid Metaheuristics – volume: 55 start-page: 10 year: 2015 ident: 10.1016/j.cor.2018.03.008_bib0044 article-title: Logic-based Benders decomposition for an inventory-location problem with service constraints publication-title: Omega doi: 10.1016/j.omega.2015.02.001 – volume: 49 start-page: 295 issue: 2 year: 2015 ident: 10.1016/j.cor.2018.03.008_bib0024 article-title: A maximum cluster algorithm for checking the feasibility of dial-a-ride instances publication-title: Transp. Sci. doi: 10.1287/trsc.2013.0495 – volume: 29 start-page: 63 issue: 1 year: 1995 ident: 10.1016/j.cor.2018.03.008_bib0028 article-title: A request clustering algorithm for door-to-door handicapped transportation publication-title: Transp. Sci. doi: 10.1287/trsc.29.1.63 – start-page: 149 year: 2014 ident: 10.1016/j.cor.2018.03.008_bib0036 article-title: Boosting an exact logic-based Benders decomposition approach by variable neighborhood search – year: 1989 ident: 10.1016/j.cor.2018.03.008_bib0015 article-title: Large scale multi-vehicle dial-a-ride problems – volume: 1 start-page: 89 issue: 2 year: 2003 ident: 10.1016/j.cor.2018.03.008_bib0011 article-title: The dial-a-ride problem (DARP): variants, modeling issues and algorithms publication-title: Q. J. Belgian French Italian Oper. Res. Soc. – volume: 24 start-page: 387 issue: 3 year: 2012 ident: 10.1016/j.cor.2018.03.008_bib0016 article-title: Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1110.0458 – volume: 39 start-page: 539 issue: 3 year: 2012 ident: 10.1016/j.cor.2018.03.008_bib0031 article-title: Measuring quality of service in dial-a-ride operations: The case of a Canadian city publication-title: Transportation doi: 10.1007/s11116-011-9375-4 – volume: 19 start-page: 411 issue: 4 year: 1985 ident: 10.1016/j.cor.2018.03.008_bib0041 article-title: Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing publication-title: Transp. Sci. doi: 10.1287/trsc.19.4.411 – volume: 39 start-page: 303 issue: 1 year: 2017 ident: 10.1016/j.cor.2018.03.008_bib0017 article-title: The multi-vehicle profitable pickup and delivery problem publication-title: OR Spectr. doi: 10.1007/s00291-016-0454-y – volume: 36 start-page: 1057 issue: 6 year: 2008 ident: 10.1016/j.cor.2018.03.008_bib0020 article-title: Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios publication-title: Omega doi: 10.1016/j.omega.2006.05.006 – volume: 96 start-page: 33 issue: 1 year: 2003 ident: 10.1016/j.cor.2018.03.008_bib0027 article-title: Logic-based Benders decomposition publication-title: Math. Program. doi: 10.1007/s10107-003-0375-9 – year: 2014 ident: 10.1016/j.cor.2018.03.008_bib0034 article-title: A multi-vehicle profitable pickup and delivery selection problem with time windows – volume: 58 start-page: 81 year: 2008 ident: 10.1016/j.cor.2018.03.008_bib0032 article-title: A survey on pickup and delivery models : Part II: transportation between pickup and delivery locations publication-title: J. Betriebswirtschaft doi: 10.1007/s11301-008-0036-4 – volume: 55 start-page: 588 issue: 3 year: 2007 ident: 10.1016/j.cor.2018.03.008_bib0026 article-title: Planning and scheduling by logic-based Benders decomposition publication-title: Oper. Res. doi: 10.1287/opre.1060.0371 – start-page: 149 year: 2000 ident: 10.1016/j.cor.2018.03.008_bib0025 – volume: 54 start-page: 756 issue: 4 year: 2006 ident: 10.1016/j.cor.2018.03.008_bib0009 article-title: Combinatorial benders’ cuts for mixed-integer linear programming publication-title: Oper. Res. doi: 10.1287/opre.1060.0286 – volume: 30 start-page: 91 issue: 2 year: 1998 ident: 10.1016/j.cor.2018.03.008_bib0003 article-title: Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing publication-title: Eng. Optim. doi: 10.1080/03052159808941240 – volume: 20 start-page: 243 issue: 3 year: 1986 ident: 10.1016/j.cor.2018.03.008_bib0030 article-title: A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows publication-title: Transp. Res. Part B Methodol. doi: 10.1016/0191-2615(86)90020-2 – volume: 49 start-page: 258 issue: 4 year: 2007 ident: 10.1016/j.cor.2018.03.008_bib0039 article-title: Models and branch-and-cut algorithms for pickup and delivery problems with time windows publication-title: Networks doi: 10.1002/net.20177 – volume: 5 start-page: 61 issue: 1 year: 2007 ident: 10.1016/j.cor.2018.03.008_bib0045 article-title: An effective and fast heuristic for the dial-a-ride problem publication-title: 4OR doi: 10.1007/s10288-006-0018-0 – volume: 153 start-page: 29 issue: 1 year: 2007 ident: 10.1016/j.cor.2018.03.008_bib0013 article-title: The dial-a-ride problem: models and algorithms publication-title: Ann. Oper. Res. doi: 10.1007/s10479-007-0170-8 – volume: 54 start-page: 573 issue: 3 year: 2006 ident: 10.1016/j.cor.2018.03.008_bib0010 article-title: A branch-and-cut algorithm for the dial-a-ride problem publication-title: Oper. Res. doi: 10.1287/opre.1060.0283 – start-page: 400 year: 2011 ident: 10.1016/j.cor.2018.03.008_bib0029 article-title: Large neighborhood search for dial-a-ride problems – start-page: 16 year: 2001 ident: 10.1016/j.cor.2018.03.008_bib0042 article-title: Branch-and-check: a hybrid framework integrating mixed integer programming and constraint logic programming – volume: 8457 start-page: 183 year: 2014 ident: 10.1016/j.cor.2018.03.008_bib0037 article-title: Speeding up logic-based Benders’ decomposition by a metaheuristic for a bi-level capacitated vehicle routing problem – volume: 59 start-page: 414 issue: 2 year: 2011 ident: 10.1016/j.cor.2018.03.008_bib0002 article-title: An exact algorithm for the pickup and delivery problem with time windows publication-title: Oper. Res. doi: 10.1287/opre.1100.0881 – volume: 45 start-page: 399 issue: 3 year: 2011 ident: 10.1016/j.cor.2018.03.008_bib0005 article-title: Checking the feasibility of dial-a-ride instances using constraint programming publication-title: Transp. Sci. doi: 10.1287/trsc.1100.0336 – volume: 16 start-page: 575 issue: 9 year: 1973 ident: 10.1016/j.cor.2018.03.008_bib0007 article-title: Algorithm 457: finding all cliques of an undirected graph publication-title: Commun. ACM doi: 10.1145/362342.362367 – start-page: 774 year: 2012 ident: 10.1016/j.cor.2018.03.008_bib0043 article-title: Logic-based benders decomposition for alternative resource scheduling with sequence dependent setups – volume: 19 start-page: 378 issue: 4 year: 1985 ident: 10.1016/j.cor.2018.03.008_bib0040 article-title: Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling publication-title: Transp. Sci. doi: 10.1287/trsc.19.4.378 – volume: 2 start-page: 73 year: 1986 ident: 10.1016/j.cor.2018.03.008_bib0006 article-title: The multi-vehicle subscriber dial-a-ride problem publication-title: TIMS Stud. Manag. Sci. – year: 1991 ident: 10.1016/j.cor.2018.03.008_bib0014 article-title: An algorithm for mini-clustering in handicapped transport – start-page: 10 year: 1976 ident: 10.1016/j.cor.2018.03.008_bib0018 article-title: Some NP-complete geometric problems – volume: 37 start-page: 579 issue: 6 year: 2003 ident: 10.1016/j.cor.2018.03.008_bib0012 article-title: A tabu search heuristic for the static multi-vehicle dial-a-ride problem publication-title: Transp. Res. Part B Methodol. doi: 10.1016/S0191-2615(02)00045-0 – volume: 4 start-page: 238 issue: 1 year: 1962 ident: 10.1016/j.cor.2018.03.008_bib0004 article-title: Partitioning procedures for solving mixed-variables programming problems publication-title: Numer. Math. doi: 10.1007/BF01386316 – year: 1990 ident: 10.1016/j.cor.2018.03.008_bib0019 – start-page: 1 year: 2013 ident: 10.1016/j.cor.2018.03.008_bib0023 article-title: Logic-based Benders decomposition to solve the permutation flowshop scheduling problem with time lags – volume: 43 start-page: 267 issue: 3 year: 2009 ident: 10.1016/j.cor.2018.03.008_bib0038 article-title: Branch and cut and price for the pickup and delivery problem with time windows publication-title: Transp. Sci. doi: 10.1287/trsc.1090.0272 – year: 2012 ident: 10.1016/j.cor.2018.03.008_bib0008 article-title: A heuristic logic-based benders method for the home health care problem – volume: 14 start-page: 130 issue: 2 year: 1980 ident: 10.1016/j.cor.2018.03.008_bib0033 article-title: A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem publication-title: Transp. Sci. doi: 10.1287/trsc.14.2.130 – volume: 259 start-page: 155 issue: 1 year: 2017 ident: 10.1016/j.cor.2018.03.008_bib0035 article-title: Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.10.010 – volume: 50 start-page: 503 issue: 3 year: 2016 ident: 10.1016/j.cor.2018.03.008_bib0001 article-title: The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing publication-title: RAIRO-Oper. Res. doi: 10.1051/ro/2015030 – ident: 10.1016/j.cor.2018.03.008_bib0021 – volume: 10 start-page: 237 issue: 4 year: 1972 ident: 10.1016/j.cor.2018.03.008_bib0022 article-title: Generalized Benders decomposition publication-title: J. Optim. Theory. Appl. doi: 10.1007/BF00934810 |
| SSID | ssj0000721 |
| Score | 2.3993235 |
| Snippet | •We propose logic-based Benders algorithms for a selective dial-a-ride problem.•Subproblems are solved using a combination of CP and MILP algorithms.•Four... Today’s society is facing an ever-growing demand for mobility. To a high degree these needs can be fulfilled by individual and public transport. People that do... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 30 |
| SubjectTerms | Algorithms Benders decomposition Branch-and-check Combinatorial Benders cuts Decomposition Dial-a-Ride problem Integer programming Linear programming Logic-based Benders decomposition Mixed integer Operations research Public transportation Studies Transportation Travel time Windows (intervals) |
| Title | Solving a selective dial-a-ride problem with logic-based Benders decomposition |
| URI | https://dx.doi.org/10.1016/j.cor.2018.03.008 https://www.proquest.com/docview/2094496071 |
| Volume | 96 |
| WOSCitedRecordID | wos000436886100003&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: 1873-765X 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/eLvHCXMwtV1bb9MwFLagQwgeuBQQg4H8wF6oLKW52X7cRitAVZmgk_pmObGNNk1pSQraz-f4kjQbUMEDL1HlNEnr8-X4-Nw-hN7EmZbUOt1NzGCDok1OmDFjQgtaFDJnknvWkhmdz9lyyU-DK7txdAK0qtjVFV__V1HDGAjbls7-g7i7m8IAfAahwxHEDse_EvyX1aVzEshR4zhubGqQrQ4hktTnytZFOQoZ74F1mo_YpUyNjh2rXDNS2uaZh2SuvvHaMkA0Di-rta5DHl3oGNR5lj-DXRsqDH2bgl40SXlGLxugPz6prPnZdzyMWZf25qFyquuvlhDJ54pcT9u0WoSAMeg1q_7NWNC9vK88fYDmF53u3QsXIBLbv3XMQlPa7QLWBu3nn8T0bDYTi8lycZhM19-IJRezQfjD5J0X9G20F9OMswHaO_owWX7cLtrUleh1P7INgLtUwBtP_pMJc2MxdxbK4hF6ELYW-MhD4jG6pashuttWNgzRw1Z-OCj0Ibrfa0f5BM0DdLDEHXRwDzo4QAdb6OAedHCADr4GnafobDpZnLwngW-DlElGN8RkWucR44aBVlaGxzk1OmKSyjjiYEibMtLKbjBiled6nJssSZM05ZrFMk-lSZ6hQbWq9HOEwfhRcRTrMit1muaqKIqScUUVK-FuGd1HUTuFogzN6C0nyqVosw4vBMy6sLMuokTArO-jt90la9-JZdeX01YuIpiS3kQUgKpdlx20MhThlW7gPIc_afswvth9-iW6t31PDtBgU3_Xr9Cd8sfmvKlfB8T9BPPRmu8 |
| 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=Solving+a+selective+dial-a-ride+problem+with+logic-based+Benders+decomposition&rft.jtitle=Computers+%26+operations+research&rft.au=Riedler%2C+Martin&rft.au=Raidl%2C+G%C3%BCnther&rft.date=2018-08-01&rft.pub=Pergamon+Press+Inc&rft.issn=0305-0548&rft.eissn=0305-0548&rft.volume=96&rft.spage=30&rft_id=info:doi/10.1016%2Fj.cor.2018.03.008&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 |