{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:57Z","timestamp":1725487137456},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730545"},{"type":"electronic","value":"9783540730552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73055-2_34","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T19:59:58Z","timestamp":1182542398000},"page":"317-327","source":"Crossref","is-referenced-by-count":2,"title":["Solving Dial-a-Ride Problems with a Low-Level Hybridization of Ants and Constraint Programming"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Castro","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","first-page":"255","volume-title":"Proc. of Symp. Operations Research","author":"D. Alexandrov","year":"2000","unstructured":"Alexandrov, D., Kochetov, Y.: Behavior of the ant colony algorithm for the set covering problem. In: Proc. of Symp. Operations Research, pp. 255\u2013260. Springer, Heidelberg (2000)"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/ICHIS.2004.13","volume-title":"HIS \u201904: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (HIS\u201904)","author":"G.B. Alvarenga","year":"2004","unstructured":"Alvarenga, G.B., Mateus, G.R.: A two-phase genetic and set partitioning approach for the vehicle routing problem with time windows. In: HIS \u201904: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (HIS\u201904), Washington, DC, USA, pp. 428\u2013433. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"34_CR3","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":"34_CR4","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":"34_CR5","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":"34_CR6","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"},{"issue":"2","key":"34_CR7","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J.E. Beasley","year":"1996","unstructured":"Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. European Journal of Operational Research\u00a094(2), 392\u2013404 (1996)","journal-title":"European Journal of Operational Research"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Bessiere, C.: Constraint propagation. Technical Report 06020, LIRMM (March 2006), also as Chapter 3 of the Handbook of Constraint Programming, Rossi, F., van Beek, P., Walsh,T. (eds.) Elsevier. Amsterdam (2006)","DOI":"10.1016\/S1574-6526(06)80007-6"},{"key":"34_CR9","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":"34_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-540-28645-5_10","volume-title":"Advances in Artificial Intelligence \u2013 SBIA 2004","author":"C. Castro","year":"2004","unstructured":"Castro, C., Moossen, M., Riff, M.C.: A cooperative framework based on local search and constraint programming for solving discrete global optimisation. In: Bazzan, A.L.C., Labidi, S. (eds.) SBIA 2004. LNCS (LNAI), vol.\u00a03171, pp. 93\u2013102. Springer, Heidelberg (2004)"},{"key":"34_CR11","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":"2","key":"34_CR12","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":"34_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1007\/11785231_113","volume-title":"Artificial Intelligence and Soft Computing \u2013 ICAISC 2006","author":"B. Crawford","year":"2006","unstructured":"Crawford, B., Castro, C.: Integrating lookahead and post processing procedures with ACO for solving set partitioning and covering problems. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., \u017burada, J.M. (eds.) ICAISC 2006. LNCS (LNAI), vol.\u00a04029, pp. 1082\u20131090. Springer, Heidelberg (2006)"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.3230110206","volume":"11","author":"F. Cullen","year":"1981","unstructured":"Cullen, F., Jarvis, J., Ratliff, D.: Set partitioning based heuristics for interactive routing. Networks\u00a011, 125\u2013144 (1981)","journal-title":"Networks"},{"key":"34_CR15","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"},{"issue":"2","key":"34_CR16","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res.\u00a040(2), 342\u2013354 (1992)","journal-title":"Oper. Res."},{"key":"34_CR17","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)"},{"key":"34_CR18","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for discrete optimization. Artificial Life\u00a05, 137\u2013172 (1999)","journal-title":"Artificial Life"},{"issue":"1","key":"34_CR19","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":"34_CR20","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, Cambridge (2004)"},{"key":"34_CR21","first-page":"67","volume":"8","author":"A. Feo","year":"1989","unstructured":"Feo, A., Mauricio, G., Resende, A.: A probabilistic heuristic for a computationally difficult set covering problem. OR Letters\u00a08, 67\u201371 (1989)","journal-title":"OR Letters"},{"key":"34_CR22","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 Academic Publishers, Dordrecht (2002)"},{"key":"34_CR23","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: J.S., et al. (eds.) Proceedings of the fourth Metaheuristics International Conference MIC\u201901, July 2001, pp. 79\u201384 (2001)"},{"key":"34_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-540-28646-2_5","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"X. Gandibleux","year":"2004","unstructured":"Gandibleux, X., Delorme, X., T\u2019Kindt, V.: An ant colony optimisation algorithm for the set packing problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol.\u00a03172, pp. 49\u201360. Springer, Heidelberg (2004)"},{"issue":"6","key":"34_CR25","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":"34_CR26","unstructured":"Hadji, R., Rahoual, M., Talbi, E., Bachelet, V.: Ant colonies for the set covering problem. In: Dorigo, M., et al. (eds.) ANTS 2000, pp. 63\u201366 (2000)"},{"key":"34_CR27","doi-asserted-by":"crossref","unstructured":"Jorgensen, R.M., Jesper, L.: Solving the dial-a-ride problem using genetic algorithms. Journal of the Operational Research Society, Forthcoming (2007)","DOI":"10.1057\/palgrave.jors.2602287"},{"issue":"2","key":"34_CR28","doi-asserted-by":"crossref","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":"34_CR29","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":"34_CR30","first-page":"1459","volume-title":"Congress on Evolutionary Computation, CEC\u201999","author":"G. Leguizam\u00f3n","year":"1999","unstructured":"Leguizam\u00f3n, G., Michalewicz, Z.: A new version of ant system for subset problems. In: Congress on Evolutionary Computation, CEC\u201999, pp. 1459\u20131464. IEEE Computer Society Press, Piscataway (1999)"},{"key":"34_CR31","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"L. Lessing","year":"2004","unstructured":"Lessing, L., Dumitrescu, I., St\u00fctzle, T.: A comparison between ACO algorithms for the set covering problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol.\u00a03172, pp. 1\u201312. Springer, Heidelberg (2004)"},{"key":"34_CR32","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":"34_CR33","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 2002. LNCS, vol.\u00a02463, pp. 222\u2013227. Springer, Heidelberg (2002)"},{"key":"34_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-540-28646-2_15","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"B. Meyer","year":"2004","unstructured":"Meyer, B., Ernst, A.: Integrating ACO and constraint propagation. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol.\u00a03172, pp. 166\u2013177. Springer, Heidelberg (2004)"},{"key":"34_CR35","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)"},{"key":"34_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11890584_1","volume-title":"Hybrid Metaheuristics","author":"G.R. Raidl","year":"2006","unstructured":"Raidl, G.R.: A unified view on hybrid metaheuristics. In: Almeida, F., Blesa Aguilera, M.J., Blum, C., Moreno Vega, J.M., P\u00e9rez P\u00e9rez, M., Roli, A., Sampels, M. (eds.) HM 2006. LNCS, vol.\u00a04030, pp. 1\u201312. Springer, Heidelberg (2006)"},{"issue":"5","key":"34_CR37","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.engappai.2005.12.013","volume":"19","author":"B. Rekiek","year":"2006","unstructured":"Rekiek, B., Delchambre, A., Saleh, H.A.: Handicapped person transportation: An application of the grouping genetic algorithm. Engineering Applications of Artificial Intelligence\u00a019(5), 511\u2013520 (2006)","journal-title":"Engineering Applications of Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Nature Inspired Problem-Solving Methods in Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73055-2_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:20Z","timestamp":1605762680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73055-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540730545","9783540730552"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73055-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}