{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:13:04Z","timestamp":1742911984541,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030589417"},{"type":"electronic","value":"9783030589424"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_30","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"457-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Insertion Sequence Variables for Hybrid Routing and Scheduling Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7360-5372","authenticated-orcid":false,"given":"Charles","family":"Thomas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1809-9822","authenticated-orcid":false,"given":"Roger","family":"Kameugne","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3153-8941","authenticated-orcid":false,"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"issue":"7","key":"30_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending chip in order to solve complex scheduling and placement problems. Math. Comput. Modell. 17(7), 57\u201373 (1993)","journal-title":"Math. Comput. Modell."},{"key":"30_CR2","unstructured":"Braekers, K.: Dial-a-Ride Problems Instances. \nhttp:\/\/alpha.uhasselt.be\/kris.braekers\/\n\n (2019). Accessed 2 Dec 2019"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-319-98334-9_32","volume-title":"Principles and Practice of Constraint Programming","author":"Q Cappart","year":"2018","unstructured":"Cappart, Q., Thomas, C., Schaus, P., Rousseau, L.-M.: A constraint programming approach for solving patient transportation problems. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 490\u2013506. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-98334-9_32"},{"issue":"3","key":"30_CR4","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"JF Cordeau","year":"2006","unstructured":"Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3), 573\u2013586 (2006)","journal-title":"Oper. Res."},{"key":"30_CR5","doi-asserted-by":"publisher","unstructured":"Cordeau, J., Laporte, G.: The dial-a-ride problem (DARP): variants, modeling issues and algorithms. 4OR 1(2), 89\u2013101 (2003). \nhttps:\/\/doi.org\/10.1007\/s10288-002-0009-8","DOI":"10.1007\/s10288-002-0009-8"},{"issue":"6","key":"30_CR6","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"JF Cordeau","year":"2003","unstructured":"Cordeau, J.F., Laporte, G.: A Tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp. Res. Part B: Methodol. 37(6), 579\u2013594 (2003)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1), 29\u201346 (2007)","journal-title":"Ann. Oper. Res."},{"key":"30_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF00137870","volume":"1","author":"C Gervet","year":"1997","unstructured":"Gervet, C.: Interval propagation to reason about sets: definition and implementation of a practical language. Constraints 1(3), 191\u2013244 (1997)","journal-title":"Constraints"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-319-23219-5_41","volume-title":"Principles and Practice of Constraint Programming","author":"R Hartert","year":"2015","unstructured":"Hartert, R., Schaus, P., Vissicchio, S., Bonaventure, O.: Solving segment routing problems with hybrid constraint programming techniques. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 592\u2013608. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23219-5_41"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.trb.2018.02.001","volume":"111","author":"SC Ho","year":"2018","unstructured":"Ho, S.C., Szeto, W., Kuo, Y.H., Leung, J.M., Petering, M., Tou, T.W.: A survey of dial-a-ride problems: Literature review and recent developments. Transp. Res. Part B: Methodol. 111, 395\u2013421 (2018)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"30_CR12","unstructured":"IBM Knowledge Center: Interval variable sequencing in CP Optimizer. \nhttps:\/\/www.ibm.com\/support\/knowledgecenter\/SSSA5P_12.9.0\/ilog.odms.ide.help\/refcppopl\/html\/interval_sequence.html\n\n (2019). Accessed 22 Nov 2019"},{"key":"30_CR13","unstructured":"IBM Knowledge Center: Search API for scheduling in CP Optimizer. \nhttps:\/\/www.ibm.com\/support\/knowledgecenter\/SSSA5P_12.9.0\/ilog.odms.cpo.help\/refcppcpoptimizer\/html\/sched_search_api.html?view=kc#85\n\n (2019). Accessed 22 Nov 2019"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-23786-7_31","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"S Jain","year":"2011","unstructured":"Jain, S., Van Hentenryck, P.: Large neighborhood search for dial-a-ride problems. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 400\u2013413. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-23786-7_31"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-319-93031-2_28","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"P Laborie","year":"2018","unstructured":"Laborie, P.: Objective landscapes for constraint programming. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 387\u2013402. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-93031-2_28"},{"key":"30_CR16","unstructured":"Laborie, P., Godard, D.: Self-adapting large neighborhood search: application to single-mode scheduling problems. In: Proceedings MISTA-07, Paris, vol. 8 (2007)"},{"key":"30_CR17","unstructured":"Laborie, P., Rogerie, J.: Reasoning with conditional time-intervals. In: FLAIRS conference. pp. 555\u2013560 (2008)"},{"key":"30_CR18","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: Reasoning with conditional time-intervals. part ii: an algebraical model for resources. In: Twenty-Second International FLAIRS Conference (2009)"},{"issue":"2","key":"30_CR19","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: IBM ILOG CP optimizer for scheduling. Constraints 23(2), 210\u2013250 (2018)","journal-title":"Constraints"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-319-93031-2_30","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"C Liu","year":"2018","unstructured":"Liu, C., Aleman, D.M., Beck, J.C.: Modelling and solving the senior transportation problem. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 412\u2013428. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-93031-2_30"},{"key":"30_CR21","unstructured":"OscaR Team: OscaR: Scala in OR (2012). \nhttps:\/\/bitbucket.org\/oscarlib\/oscar"},{"key":"30_CR22","unstructured":"Perron, L., Furnon, V.: Or-tools (2019). \nhttps:\/\/developers.google.com\/optimization\/"},{"key":"30_CR23","unstructured":"Perron, L., Furnon, V.: OR-Tools Sequence Var. \nhttps:\/\/developers.google.com\/optimization\/reference\/constraint_solver\/constraint_solver\/SequenceVar\n\n (2019). Accessed 22 Nov 2019"},{"key":"30_CR24","unstructured":"de Saint-Marcq, V.l.C., Schaus, P., Solnon, C., Lecoutre, C.: Sparse-sets for domain implementation. In: CP Workshop on Techniques for Implementing Constraint Programming Systems (TRICS), pp. 1\u201310 (2013)"},{"key":"30_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming\u2014CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"key":"30_CR26","unstructured":"Thomas, C., Cappart, Q., Schaus, P., Rousseau, L.M.: CSPLib problem 082: patient transportation problem (2018). \nhttp:\/\/www.csplib.org\/Problems\/prob082"},{"issue":"1","key":"30_CR27","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10601-017-9277-y","volume":"23","author":"SV Cauwelaert","year":"2017","unstructured":"Cauwelaert, S.V., Lombardi, M., Schaus, P.: How efficient is a global constraint in practice? Constraints 23(1), 87\u2013122 (2017). \nhttps:\/\/doi.org\/10.1007\/s10601-017-9277-y","journal-title":"Constraints"},{"key":"30_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-319-18008-3_30","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"P Vil\u00edm","year":"2015","unstructured":"Vil\u00edm, P., Laborie, P., Shaw, P.: Failure-directed search for constraint-based scheduling. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 437\u2013453. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-18008-3_30"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:16:18Z","timestamp":1600409778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.08","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.08","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}