{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:43:45Z","timestamp":1725745425576},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642400896"},{"type":"electronic","value":"9783642400902"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40090-2_17","type":"book-chapter","created":{"date-parts":[[2013,8,21]],"date-time":"2013-08-21T03:17:39Z","timestamp":1377055059000},"page":"187-198","source":"Crossref","is-referenced-by-count":4,"title":["The Art of Negotiation: Developing Efficient Agent-Based Algorithms for Solving Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Petr","family":"Kalina","sequence":"first","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Vok\u0159\u00ednek","sequence":"additional","affiliation":[]},{"given":"Vladim\u00edr","family":"Ma\u0159\u00edk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(95)00027-O","volume":"65","author":"A. Bachem","year":"1996","unstructured":"Bachem, A., Hochstattler, W., Malich, M.: The simulated trading heuristic for solving vehicle routing problems. Discrete Applied Mathematics\u00a065(1-3), 47\u201372 (1996); First International Colloquium on Graphs and Optimization","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, part I route construction and local search algorithms. Transportation Science\u00a039(1), 104\u2013118 (2005)","journal-title":"Transportation Science"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, part II metaheuristics. Transportation Science\u00a039(1), 119\u2013139 (2005)","journal-title":"Transportation Science"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S1007-0214(09)70058-6","volume":"14","author":"Z. Dan","year":"2009","unstructured":"Dan, Z., Cai, L., Zheng, L.: Improved multi-agent system for the vehicle routing problem with time windows. Tsinghua Science Technology\u00a014(3), 407\u2013412 (2009)","journal-title":"Tsinghua Science Technology"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/088395196118669","volume":"10","author":"K. Fischer","year":"1995","unstructured":"Fischer, K., M\u00fcller, J.P., Pischel, M.: Cooperative transportation scheduling: an application domain for dai. Journal of Applied Artificial Intelligence\u00a010, 1\u201333 (1995)","journal-title":"Journal of Applied Artificial Intelligence"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.ejor.2004.01.027","volume":"162","author":"J. Homberger","year":"2005","unstructured":"Homberger, J., Gehring, H.: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research\u00a0162(1), 220\u2013238 (2005)","journal-title":"European Journal of Operational Research"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Kalina, P., Vok\u0159\u00ednek, J.: Algorithm for vehicle routing problem with time windows based on agent negotiation. In: Proceedings of the 7th Workshop on Agents in Traffic and Transportation, AAMAS (2012)","DOI":"10.1007\/978-3-642-44927-7_11"},{"key":"17_CR8","unstructured":"Kalina, P., Vok\u0159\u00ednek, J.: Improved agent based algorithm for vehicle routing problem with time windows using efficient search diversification and pruning strategy. In: Proceedings of the 3rd Workshop on Artificial Intelligence and Logistice (AILog) of the 2012 European Conference on Artificial Intelligence (ECAI), pp. 13\u201318 (2012)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Leong, H.W., Liu, M.: A multi-agent algorithm for vehicle routing problem with time window, pp. 106\u2013111. ACM (2006)","DOI":"10.1145\/1141277.1141301"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1287\/ijoc.1060.0186","volume":"19","author":"A. Lim","year":"2007","unstructured":"Lim, A., Zhang, X.: A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. INFORMS Journal on Computing\u00a019(3), 443\u2013457 (2007)","journal-title":"INFORMS Journal on Computing"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/j.ejor.2005.05.012","volume":"175","author":"Q. Lu","year":"2005","unstructured":"Lu, Q., Dessouky, M.M.: A new insertion-based construction heuristic for solving the pickup and delivery problem with hard time windows. European Journal of Operational Research\u00a0175, 672\u2013687 (2005)","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"17_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.orl.2009.04.006","volume":"37","author":"Y. Nagata","year":"2009","unstructured":"Nagata, Y., Br\u00e4ysy, O.: A powerful route minimization heuristic for the vehicle routing problem with time windows. Operations Research Letters\u00a037(5), 333\u2013338 (2009)","journal-title":"Operations Research Letters"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0305-0548(93)E0024-N","volume":"22","author":"P. Poon","year":"1995","unstructured":"Poon, P., Carter, J.: Genetic algorithm crossover operators for ordering applications. Computers and Operations Research\u00a022(1), 135\u2013147 (1995)","journal-title":"Computers and Operations Research"},{"key":"17_CR14","unstructured":"Ropke, S.: Heuristic and exact algorithms for vehicle routing problems, PHD Thesis, Technical University of Denmark (2005)"},{"key":"17_CR15","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 problems with time window constraints. Operations Research\u00a035, 254\u2013265 (1987)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Industrial Applications of Holonic and Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40090-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T11:00:52Z","timestamp":1646391652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40090-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400896","9783642400902"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40090-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}