{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:23:26Z","timestamp":1725492206758},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755548"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75555-5_43","type":"book-chapter","created":{"date-parts":[[2007,9,20]],"date-time":"2007-09-20T06:44:59Z","timestamp":1190270699000},"page":"448-457","source":"Crossref","is-referenced-by-count":3,"title":["Decomposition Approach to Solve Dial-a-Ride Problems Using Ant Computing and Constraint Programming"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Cubillos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K.R. Apt","year":"2003","unstructured":"Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)"},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"Balas, E., Padberg, M.: Set partitioning: A survey. SIAM Review\u00a018, 710\u2013760 (1976)","journal-title":"SIAM Review"},{"issue":"2","key":"43_CR3","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"M.L. Balinski","year":"1964","unstructured":"Balinski, M.L., Quandt, R.E.: On an integer program for a delivery problem. Operations Research\u00a012(2), 300\u2013304 (1964)","journal-title":"Operations Research"},{"issue":"11","key":"43_CR4","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.2307\/2582903","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: Or-library:distributing test problem by electronic mail. Journal of Operational Research Society\u00a041(11), 1069\u20131072 (1990)","journal-title":"Journal of Operational Research Society"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Bessiere, C.: Constraint propagation. Technical Report 06020, LIRMM (March 2006), also in Rossi, F., van Beek, P., Walsh, T. (eds.) ch. 3 of the Handbook of Constraint Programming, Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80007-6"},{"key":"43_CR6","unstructured":"Borndorfer, R., Grotschel, M., Klostermeier, F., Kuttner, C.: Telebus berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97-23, Konrad-Zuse-Zentrum fur Informationstechnik (1997)"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1008668508685","volume":"4","author":"P.C. Chu","year":"1998","unstructured":"Chu, P.C., Beasley, J.E.: Constraint handling in genetic algorithms: the set partitoning problem. Journal of Heuristics\u00a04, 323\u2013357 (1998)","journal-title":"Journal of Heuristics"},{"issue":"3","key":"43_CR8","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"J.-F. Cordeau","year":"2006","unstructured":"Cordeau, J.-F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res.\u00a054(3), 573\u2013586 (2006)","journal-title":"Oper. Res."},{"issue":"2","key":"43_CR9","first-page":"89","volume":"1","author":"J.-F. Cordeau","year":"2003","unstructured":"Cordeau, J.-F., Laporte, G.: The dial-a-ride problem (darp): Variants, modeling issues and algorithms. Journal 4OR: A Quarterly Journal of Operations Research\u00a01(2), 89\u2013101 (2003)","journal-title":"Journal 4OR: A Quarterly Journal of Operations Research"},{"key":"43_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/11925231_36","volume-title":"MICAI 2006: Advances in Artificial Intelligence","author":"B. Crawford","year":"2006","unstructured":"Crawford, B., Castro, C., Monfroy, E.: A hybrid ant algorithm for the airline crew pairing problem. In: Gelbukh, A., Reyes-Garcia, C.A. (eds.) MICAI 2006. LNCS (LNAI), vol.\u00a04293, pp. 381\u2013391. Springer, Heidelberg (2006)"},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0004-3702(02)00120-0","volume":"136","author":"R. Dechter","year":"2002","unstructured":"Dechter, R., Frost, D.: Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence\u00a0136, 147\u2013188 (2002)","journal-title":"Artificial Intelligence"},{"key":"43_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Ant Colony Optimization and Swarm Intelligence","year":"2004","unstructured":"Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.): ANTS 2004. LNCS, vol.\u00a03172. Springer, Heidelberg (2004)"},{"issue":"1","key":"43_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"43_CR14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, USA (2004)"},{"key":"43_CR15","volume-title":"Handbook of metaheuristics","author":"F. Focacci","year":"2002","unstructured":"Focacci, F., Laburthe, F., Lodi, A.: Local search and constraint programming. In: Handbook of metaheuristics, Kluwer, Dordrecht (2002)"},{"key":"43_CR16","unstructured":"Gagne, C., Gravel, M., Price, W.: A look-ahead addition to the ant colony optimization metaheuristic and its application to an industrial scheduling problem. In: Sousa, J.P., et al. (eds.) MIC 2001. Proceedings of the fourth Metaheuristics International Conference, pp. 79\u201384 (July 2001)"},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"Gandibleux, X., Delorme, X., T\u2019Kindt, V.: An ant colony optimisation algorithm for the set packing problem. In: Dorigo, et al. [12], pp. 49\u201360","DOI":"10.1007\/978-3-540-28646-2_5"},{"issue":"6","key":"43_CR18","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1109\/69.476495","volume":"7","author":"R.D. Gopal","year":"1995","unstructured":"Gopal, R.D., Ramesh, R.: The query clustering problem: A set partitioning approach. IEEE Trans. Knowl. Data Eng.\u00a07(6), 885\u2013899 (1995)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"43_CR19","series-title":"Lecture Notes in Computer Science","first-page":"63","volume-title":"Algorithmic Number Theory","author":"R. Hadji","year":"2000","unstructured":"Hadji, R., Rahoual, M., Talbi, E., Bachelet, V.: Ant colonies for the set covering problem. In: Bosma, W. (ed.) Algorithmic Number Theory. LNCS, vol.\u00a01838, pp. 63\u201366. Springer, Heidelberg (2000)"},{"issue":"2","key":"43_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/ijoc.11.2.161","volume":"11","author":"J.P. Kelly","year":"1999","unstructured":"Kelly, J.P., Xu, J.: A set-partitioning-based heuristic for the vehicle routing problem. INFORMS J. on Computing\u00a011(2), 161\u2013172 (1999)","journal-title":"INFORMS J. on Computing"},{"key":"43_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/978-3-540-30176-9_11","volume-title":"Applied Computing","author":"K. Kotecha","year":"2004","unstructured":"Kotecha, K., Sanghani, G., Gambhava, N.: Genetic algorithm for airline crew scheduling problem using cost-based uniform crossover. In: Manandhar, S., Austin, J., Desai, U., Oyanagi, Y., Talukder, A.K. (eds.) AACC 2004. LNCS, vol.\u00a03285, pp. 84\u201391. Springer, Heidelberg (2004)"},{"key":"43_CR22","first-page":"1459","volume-title":"CEC 1999","author":"G. Leguizam\u00f3n","year":"1999","unstructured":"Leguizam\u00f3n, G., Michalewicz, Z.: A new version of ant system for subset problems. In: CEC 1999. Congress on Evolutionary Computation, Piscataway, NJ, USA, pp. 1459\u20131464. IEEE Press, Los Alamitos (1999)"},{"key":"43_CR23","doi-asserted-by":"crossref","unstructured":"Lessing, L., Dumitrescu, I., St\u00fctzle, T.: A comparison between aco algorithms for the set covering problem. In: Dorigo, et al. [12], pp. 1\u201312","DOI":"10.1007\/978-3-540-28646-2_1"},{"key":"43_CR24","doi-asserted-by":"crossref","unstructured":"Levine, D.: A parallel genetic algorithm for the set partitioning problem. Technical Report ANL-94\/23 Argonne National Laboratory (May 1994), available at http:\/\/citeseer.ist.psu.edu\/levine94parallel.html","DOI":"10.2172\/10161119"},{"key":"43_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45724-0_19","volume-title":"Ant Algorithms","author":"V. Maniezzo","year":"2002","unstructured":"Maniezzo, V., Milandri, M.: An ant-based framework for very strongly constrained problems. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms. LNCS, vol.\u00a02463, pp. 222\u2013227. Springer, Heidelberg (2002)"},{"key":"43_CR26","doi-asserted-by":"crossref","unstructured":"Meyer, B., Ernst, A.: Integrating aco and constraint propagation. In: Dorigo, et al. [12], pp. 166\u2013177","DOI":"10.1007\/978-3-540-28646-2_15"},{"key":"43_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/BFb0056911","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"R. Michel","year":"1998","unstructured":"Michel, R., Middendorf, M.: An island model based ant system with lookahead for the shortest supersequence problem. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN V. LNCS, vol.\u00a01498, pp. 692\u2013701. Springer, Heidelberg (1998)"},{"issue":"1","key":"43_CR28","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"M.W.P. Savelsbergh","year":"1995","unstructured":"Savelsbergh, M.W.P.: The general pickup and delivery problem. Transportation Science\u00a029(1), 17\u201329 (1995)","journal-title":"Transportation Science"}],"container-title":["Lecture Notes in Computer Science","Advances in Brain, Vision, and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75555-5_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:24:30Z","timestamp":1619519070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75555-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755548"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75555-5_43","relation":{},"subject":[]}}