{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:05:22Z","timestamp":1725757522834},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642449260"},{"type":"electronic","value":"9783642449277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-44927-7_11","type":"book-chapter","created":{"date-parts":[[2013,11,18]],"date-time":"2013-11-18T20:33:06Z","timestamp":1384806786000},"page":"149-164","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Route Minimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Agent Negotiation"],"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":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Bachem, A., Hochst\u00e4ttler, W., Malich, M.: The simulated trading heuristic for solving vehicle routing problems. Technical report, Discrete Applied Mathenatics (1996)","DOI":"10.1016\/0166-218X(95)00027-O"},{"key":"11_CR2","unstructured":"Brafman, R.I., Domshlak, C.: From one to many: Planning for loosely coupled multi-agent systems. In: Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), pp. 28\u201335 (2008)"},{"issue":"1","key":"11_CR3","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":"11_CR4","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"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1287\/trsc.1030.0046","volume":"38","author":"A.M. Campbell","year":"2004","unstructured":"Campbell, A.M., Savelsbergh, M.: Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Science\u00a038, 369\u2013378 (2004)","journal-title":"Transportation Science"},{"issue":"3","key":"11_CR6","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"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.trc.2005.07.002","volume":"13","author":"P. Davidsson","year":"2005","unstructured":"Davidsson, P., Henesey, L., Ramstedt, L., T\u00f6rnquist, J., Wernstedt, F.: An analysis of agent-based approaches to transport logistics. Transportation Research Part C: Emerging Technologies\u00a013(4), 255\u2013271 (2005)","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0004-3702(83)90015-2","volume":"20","author":"R. Davis","year":"1983","unstructured":"Davis, R., Smith, R.G.: Negotiation as a metaphor for distributed problem solving. Artificial Intelligence\u00a020, 63\u2013109 (1983)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/trsc.1070.0223","volume":"42","author":"G. Desaulniers","year":"2008","unstructured":"Desaulniers, G., Lessard, F., Hadjar, A.: Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Science\u00a042(3), 387\u2013404 (2008)","journal-title":"Transportation Science"},{"key":"11_CR10","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":"11_CR11","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.ejor.2004.01.027","volume":"162","author":"H. Gehring","year":"2005","unstructured":"Gehring, H., Homberger, J.: 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":"11_CR12","doi-asserted-by":"crossref","unstructured":"Kalina, P., Vok\u0159\u00ednek, J.: Parallel solver for vehicle routing and pickup and delivery problems with time windows based on agent negotiation. In: 2012 IEEE Conference on Systems, Man, and Cybernetics (SMC), pp. 1558\u20131563 (2012)","DOI":"10.1109\/ICSMC.2012.6377958"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-40090-2_17","volume-title":"Industrial Applications of Holonic and Multi-Agent Systems","author":"P. Kalina","year":"2013","unstructured":"Kalina, P., Vok\u0159\u00ednek, J., Ma\u0159\u00edk, V.: The art of negotiation: Developing efficient agent-based algorithms for solving vehicle routing problem with time windows. In: Ma\u0159\u00edk, V., Lastra, J.L.M., Skobelev, P. (eds.) HoloMAS 2013. LNCS, vol.\u00a08062, pp. 187\u2013198. Springer, Heidelberg (2013)"},{"key":"11_CR14","unstructured":"Kohout, R., Erol, K.: In-time agent-based vehicle routing with a stochastic improvement heuristic. In: 11th Conference on Innovative Applications of Artificial Intelligence. AAAI\/MIT Press (1999)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Komenda, A., Nov\u00e1k, P., P\u011bchou\u010dek, M.: Domain-independent multi-agent plan repair. Journal of Network and Computer Applications (in print, 2013)","DOI":"10.1016\/j.jnca.2012.12.011"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/MIS.2012.90","volume":"28","author":"A. Komenda","year":"2013","unstructured":"Komenda, A., Vokrinek, J., Cap, M., Pechoucek, M.: Developing multiagent algorithms for tactical missions using simulation. IEEE Intelligent Systems\u00a028(1), 42\u201349 (2013)","journal-title":"IEEE Intelligent Systems"},{"issue":"2","key":"11_CR17","doi-asserted-by":"crossref","first-page":"123","DOI":"10.3233\/WIA-2011-0210","volume":"9","author":"A. Komenda","year":"2011","unstructured":"Komenda, A., Vok\u0159\u00ednek, J., P\u011bchou\u010dek, M.: Plan representation and execution in multi-actor scenarios by means of social commitments. Web Intelligence and Agent Systems\u00a09(2), 123\u2013133 (2011)","journal-title":"Web Intelligence and Agent Systems"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Leong, H.W., Liu, M.: A multi-agent algorithm for vehicle routing problem with time window. In: Proceedings of the 2006 ACM Symposium on Applied Computing, SAC 2006, pp. 106\u2013111. ACM, New York (2006)","DOI":"10.1145\/1141277.1141301"},{"issue":"3","key":"11_CR19","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":"11_CR20","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1057\/palgrave.jors.2600763","volume":"50","author":"F.-H. Liu","year":"1999","unstructured":"Liu, F.-H., Shen, S.-Y.: The fleet size and mix vehicle routing problem with time windows. Operational Research Society\u00a050, 721\u2013732 (1999)","journal-title":"Operational Research Society"},{"key":"11_CR21","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"},{"key":"11_CR22","unstructured":"Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Technical Report C3P Report 826, California Institute of Technology (1989)"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-71615-0_13","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"Y. Nagata","year":"2007","unstructured":"Nagata, Y.: Edge assembly crossover for the capacitated vehicle routing problem. In: Cotta, C., van Hemert, J. (eds.) EvoCOP 2007. LNCS, vol.\u00a04446, pp. 142\u2013153. Springer, Heidelberg (2007)"},{"issue":"4","key":"11_CR24","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/j.cor.2009.06.022","volume":"37","author":"Y. Nagata","year":"2010","unstructured":"Nagata, Y., Br\u00e4ysy, O., Dullaert, W.: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput. Oper. Res.\u00a037(4), 724\u2013737 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"11_CR25","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1002\/net.20332","volume":"54","author":"E. Prescott-Gagnon","year":"2009","unstructured":"Prescott-Gagnon, E., Desaulniers, G., Rousseau, L.-M.: A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Netw.\u00a054(4), 190\u2013204 (2009)","journal-title":"Netw."},{"issue":"11","key":"11_CR26","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1016\/j.cor.2010.01.016","volume":"37","author":"Y. Ren","year":"2010","unstructured":"Ren, Y., Dessouky, M., Ord\u00f3\u00f1ez, F.: The multi-shift vehicle routing problem with overtime. Comput. Oper. Res.\u00a037(11), 1987\u20131998 (2010)","journal-title":"Comput. Oper. Res."},{"key":"11_CR27","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"},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/TSMCC.2010.2073465","volume":"41","author":"J. Vok\u0159\u00ednek","year":"2011","unstructured":"Vok\u0159\u00ednek, J., Komenda, A., P\u011bchou\u010dek, M.: Abstract architecture for task-oriented multi-agent problem solving. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews\u00a041(1), 31\u201340 (2011)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/CSO.2009.127","volume-title":"Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization, CSO 2009","author":"F. Wang","year":"2009","unstructured":"Wang, F., Tao, Y., Shi, N.: A survey on vehicle routing problem with loading constraints. In: Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization, CSO 2009, vol.\u00a02, pp. 602\u2013606. IEEE Computer Society, Washington, DC (2009)"}],"container-title":["Lecture Notes in Computer Science","PRIMA 2013: Principles and Practice of Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-44927-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,8]],"date-time":"2020-08-08T07:18:04Z","timestamp":1596871084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-44927-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449260","9783642449277"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44927-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}