{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:19:04Z","timestamp":1760170744144},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642211102"},{"type":"electronic","value":"9783642211119"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21111-9_4","type":"book-chapter","created":{"date-parts":[[2011,5,20]],"date-time":"2011-05-20T13:58:55Z","timestamp":1305899935000},"page":"31-40","source":"Crossref","is-referenced-by-count":1,"title":["Local Search Heuristics for Robotic Routing Planner"],"prefix":"10.1007","author":[{"given":"Stanislav","family":"Slu\u0161n\u00fd","sequence":"first","affiliation":[]},{"given":"Roman","family":"Neruda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"4_CR1","first-page":"821","volume":"30","author":"J.F. Bard","year":"1998","unstructured":"Bard, J.F., Huang, L., Dror, M., Jaillet, P.: A branch and cut algorithm for the VRP with satellite facilities. IIE Transactions\u00a030(9), 821\u2013834 (1998)","journal-title":"IIE Transactions"},{"key":"4_CR2","first-page":"367","volume-title":"Transportation, Handbooks in Operations Research and Management Science","author":"J.-F. Cordeau","year":"2007","unstructured":"Cordeau, J.-F., Laporte, G., Savelsbergh, M.W.P., Vigo, D.: Vehicle routing. In: Barnhart, C., Laporte, G. (eds.) Transportation, Handbooks in Operations Research and Management Science, vol.\u00a014, pp. 367\u2013428. Elsevier, Amsterdam (2007)"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.aei.2004.07.001","volume":"18","author":"J.E. Bell","year":"2004","unstructured":"Bell, J.E., McMullen, P.R.: Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics\u00a018(1), 41\u201348 (2004), \n                    \n                      http:\/\/www.sciencedirect.com\/science\/article\/B6X1X-4DR0TJ0-5\/2\/1bef0eafe5930a7bfeafaf51f7daa183\n                    \n                    \n                  , doi:10.1016\/j.aei.2004.07.001","journal-title":"Advanced Engineering Informatics"},{"issue":"5","key":"4_CR4","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","volume":"30","author":"B.M. Baker","year":"2003","unstructured":"Baker, B.M., Ayechew, M.A.: A genetic algorithm for the vehicle routing problem. Comput. Oper. Res.\u00a030(5), 787\u2013800 (2003)","journal-title":"Comput. Oper. Res."},{"key":"4_CR5","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)"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1023\/A:1009621410177","volume":"6","author":"B. Backer De","year":"2000","unstructured":"De Backer, B., Furnon, V., Shaw, P., Kilby, P., Prosser, P.: Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. Journal of Heuristics\u00a06(4), 501\u2013523 (2000)","journal-title":"Journal of Heuristics"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1013661617536","volume":"8","author":"L.-M. Rousseau","year":"2002","unstructured":"Rousseau, L.-M., Gendreau, M., Pesant, G.: Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows. Journal of Heuristics\u00a08(1), 43\u201358 (2002)","journal-title":"Journal of Heuristics"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/S1574-6526(06)80029-5","volume-title":"Handbook of Constraint Programming","author":"H. Simonis","year":"2006","unstructured":"Simonis, H.: Constraint applications in networks. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, pp. 875\u2013903. Elsevier, Amsterdam (2006)"},{"key":"4_CR9","first-page":"932","volume":"11","author":"P.C. Pop","year":"2007","unstructured":"Pop, P.C.: New Integer Programming Formulations of the Generalized Travelling Salesman Problem. American Journal of Applied Sciences\u00a011, 932\u2013937 (2007)","journal-title":"American Journal of Applied Sciences"},{"key":"4_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag New York, Inc., Secaucus (1999)"},{"key":"4_CR11","unstructured":"Cyberbotics: Webots simulator, \n                    \n                      http:\/\/www.cyberbotics.com\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Neural Networks \u2013 ISNN 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21111-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T09:36:52Z","timestamp":1558604212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21111-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642211102","9783642211119"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21111-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}