{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:25:09Z","timestamp":1725560709305},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213673"},{"type":"electronic","value":"9783540246527"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24652-7_19","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T19:53:07Z","timestamp":1279828387000},"page":"188-198","source":"Crossref","is-referenced-by-count":5,"title":["Improving Vehicle Routing Using a Customer Waiting Time Colony"],"prefix":"10.1007","author":[{"given":"Samer","family":"Sa\u2019adah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Ross","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben","family":"Paechter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","first-page":"63","volume-title":"New Ideas in Optimization","author":"L.M. Gambardella","year":"1999","unstructured":"Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 63\u201376. McGraw-Hill, UK (1999); Also available as Technical Report IDSIA-06-99, IDSIA, Lugano, Switzerland"},{"key":"19_CR2","unstructured":"Larsen, J.: Parallelization of the vehicle routing problem time windows. Ph.D. thesis, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark (1999)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45724-0_5","volume-title":"Ant Algorithms","author":"I. Ellabib","year":"2002","unstructured":"Ellabib, I., Basir, O.A., Calamai, P.: An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, pp. 53\u201364. Springer, Heidelberg (2002)"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M.M. Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research\u00a035(2), 254\u2013265 (1987)","journal-title":"Operations Research"},{"key":"19_CR5","unstructured":"Chiang, W.C., Russel, R.: Hybrid Heuristics for the Vehicle Routing Problem with Time Windows. Hybrid Heuristics for the Vehicle Routing Problem with Time Windows Working Paper, Department of Quantitative Methods, University of Tulsa, OK, USA (1993)"},{"key":"19_CR6","unstructured":"Thangiah, S., Osman, I., Sun, T.: Hybrid Genetic Algorithm Simulated Annealing and Tabu Search Methods for Vehicle Routing Problem with Time Windows. Technical Report 27, Computer Science Department, Slippery Rock University (1994)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.D.: Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics\u00a01, 147\u2013167 (1995)","journal-title":"Journal of Heuristics"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B\u00a026(1), 29\u201341 (1996)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Gambardella, L.M., Dorigo, M.: Solving Symmetric and Asymmetric TSPs by Ant Colonies. In: ICEC 1996, Proceedings of the IEEE Conference on Evolutionary Computation, Nagoya, Japan, May 20-22 (1996)","DOI":"10.1109\/ICEC.1996.542672"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E.D. Taillard","year":"1997","unstructured":"Taillard, E.D., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation science\u00a031, 170\u2013186 (1997)","journal-title":"Transportation science"},{"key":"19_CR11","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 - CP98","author":"P. Shaw","year":"1998","unstructured":"Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/978-1-4615-5775-3_32","volume-title":"Meta-heuristics: Advances and Trends in Local Search for Optimisation","author":"P. Kilby","year":"1999","unstructured":"Kilby, P., Prosser, P., Shaw, P.: Guided Local Search for the Vehicle Routing Problems With Time Windows. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-heuristics: Advances and Trends in Local Search for Optimisation, pp. 473\u2013486. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/S0377-2217(98)00315-4","volume":"118","author":"F.H. Liu","year":"1999","unstructured":"Liu, F.H., Shen, S.Y.: A Route-Neighborhood-based Metaheuristic for Vehicle Routing Problem with Time Windows. European Journal of Operational Research\u00a0118, 485\u2013504 (1999)","journal-title":"European Journal of Operational Research"},{"key":"19_CR14","unstructured":"Br\u00e4ysy, O., Berger, J., Barkaoui, M.: A new hybrid evolutionary algorithm for the vehicle routing problem with time windows. Presented at the Route 2000- Workshop, Skodsborg, Denmark (2000)"},{"key":"19_CR15","first-page":"35","volume":"18","author":"H. Gehring","year":"2001","unstructured":"Gehring, H., Homberger, J.: Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows. Asia-Pacific Journal of Operational Research\u00a018, 35\u201347 (2001)","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"19_CR16","first-page":"1317","volume-title":"Proceedings 4th International Conference on Genetic and Evolutionary Computation (GECCO 2002)","author":"M. Reimann","year":"2002","unstructured":"Reimann, M., Doerner, K., Doerner, K.: A Savings based Ant System for the Vehicle Routing Problem. In: Proceedings 4th International Conference on Genetic and Evolutionary Computation (GECCO 2002), New York City, New York, USA, pp. 1317\u20131325. Morgan Kaufmann, San Francisco (2002)"},{"issue":"0","key":"19_CR17","first-page":"1","volume":"00","author":"O. Br\u00e4ysy","year":"2002","unstructured":"Br\u00e4ysy, O.: A Reactive Variable Neighbourhood Search for the Vehicle Routing Problem with Time Windows. INFORMS Journal on Computing 2002 INFORMS\u00a000(0), 1\u201322 (2002)","journal-title":"INFORMS Journal on Computing 2002 INFORMS"},{"issue":"2","key":"19_CR18","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1080\/03155986.2003.11732675","volume":"41","author":"J. Berger","year":"2003","unstructured":"Berger, J., Barkaoui, M., Br\u00e4ysy, O.: A Route-directed Hybrid Genetic Approach for the Vehicle Routing Problem with Time Windows. Information Systems and Operational Research\u00a041(2), 179\u2013194 (2003)","journal-title":"Information Systems and Operational Research"},{"key":"19_CR19","unstructured":"Br\u00e4ysy, O., Berger, J., Barkaoui, M., Dullaert, W.: A Threshold Accepting Metaheuristic for the Vehicle Routing Problem with Time Windows. Central European Journal of Operations Research\u00a04 (2003)"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1011301019184","volume":"7","author":"R. Cordone","year":"2001","unstructured":"Cordone, R., Wolfer-Calvo, R.: A heuristic for the vehicle routing problem with time windows. Journal of Heuristics\u00a07, 107\u2013129 (2001)","journal-title":"Journal of Heuristics"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","volume":"8","author":"J.Y. Potvin","year":"1996","unstructured":"Potvin, J.Y., Bengio, S.: The Vehicle Routing Problem with Time Windows - Part II: Genetic Search. INFORMS Journal of Computing\u00a08, 165\u2013172 (1996)","journal-title":"INFORMS Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24652-7_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:50:07Z","timestamp":1605761407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24652-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213673","9783540246527"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24652-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}