{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T10:39:29Z","timestamp":1785235169692,"version":"3.55.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,3,29]],"date-time":"2018-03-29T00:00:00Z","timestamp":1522281600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P27858-G27"],"award-info":[{"award-number":["P27858-G27"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00291-018-0516-4","type":"journal-article","created":{"date-parts":[[2018,4,3]],"date-time":"2018-04-03T23:30:23Z","timestamp":1522798223000},"page":"613-635","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["Centralized bundle generation in auction-based collaborative transportation"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0039-4519","authenticated-orcid":false,"given":"Margaretha","family":"Gansterer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,3,29]]},"reference":[{"key":"516_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-24264-9_1","volume-title":"Computational Logistics","author":"H Ackermann","year":"2011","unstructured":"Ackermann H, Ewe H, Kopfer H, K\u00fcfer K (2011) Combinatorial auctions in freight logistics. In: B\u00f6se J, Hu H, Carlos C, Shi X, Stahlbock R, Voss S (eds) Computational Logistics, vol 6971. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, pp 1\u201317"},{"issue":"4","key":"516_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s13675-014-0030-7","volume":"2","author":"C Archetti","year":"2014","unstructured":"Archetti C, Speranza MG (2014) A survey on matheuristics for routing problems. EURO J Comput Optim 2(4):223\u2013246","journal-title":"EURO J Comput Optim"},{"issue":"1","key":"516_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G Berbeglia","year":"2007","unstructured":"Berbeglia G, Cordeau JF, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: a classification scheme and survey. TOP 15(1):1\u201331","journal-title":"TOP"},{"key":"516_CR4","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.tre.2009.12.006","volume":"46","author":"S Berger","year":"2010","unstructured":"Berger S, Bierwirth C (2010) Solutions to the request reassignment problem in collaborative carrier networks. Transp Res Part E Logist Transp Rev 46:627\u2013638","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"516_CR5","unstructured":"Buer T (2014) An exact and two heuristic strategies for truthful bidding in combinatorial transport auctions. CoRR abs\/1406.1928. \n                    http:\/\/arxiv.org\/abs\/1406.1928"},{"issue":"2","key":"516_CR6","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/BF03342722","volume":"3","author":"T Buer","year":"2010","unstructured":"Buer T, Pankratz G (2010) Grasp with hybrid path relinking for bi-objective winner determination in combinatorial transportation auctions. Bus Res 3(2):192\u2013213","journal-title":"Bus Res"},{"key":"516_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2012.08.032","volume":"163","author":"V Cacchiani","year":"2014","unstructured":"Cacchiani V, Hemmelmayr V, Tricoire F (2014) A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discret Appl Math 163:53\u201364","journal-title":"Discret Appl Math"},{"issue":"3","key":"516_CR8","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.ejor.2013.06.012","volume":"236","author":"D Cattaruzza","year":"2014","unstructured":"Cattaruzza D, Absi N, Feillet D, Vidal T (2014) A memetic algorithm for the multi trip vehicle routing problem. Eur J Oper Res 236(3):833\u2013848","journal-title":"Eur J Oper Res"},{"issue":"4","key":"516_CR9","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1287\/trsc.1090.0273","volume":"43","author":"RLY Chen","year":"2009","unstructured":"Chen RLY, Ahmad Beygi S, Cohn A, Beil DR, Sinha A (2009) Solving truckload procurement auctions over an exponential number of bundles. Transp Sci 43(4):493\u2013510","journal-title":"Transp Sci"},{"issue":"1","key":"516_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E Clarke","year":"1971","unstructured":"Clarke E (1971) Multipart pricing of public goods. Public Choice 11(1):17\u201333","journal-title":"Public Choice"},{"issue":"2","key":"516_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tre.2005.09.007","volume":"43","author":"F Cruijssen","year":"2007","unstructured":"Cruijssen F, Cools M, Dullaert W (2007) Horizontal cooperation in logistics: opportunities and impediments. Transp Res Part E Logist Transp Rev 43(2):129\u2013142","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"3","key":"516_CR12","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.dss.2011.02.018","volume":"51","author":"S Dahl","year":"2011","unstructured":"Dahl S, Derigs U (2011) Cooperative planning in express carrier networks an empirical study on the effectiveness of a real-time decision support system. Decis Support Syst 51(3):620\u2013626","journal-title":"Decis Support Syst"},{"issue":"2\u20133","key":"516_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s12159-011-0046-9","volume":"3","author":"B Dai","year":"2011","unstructured":"Dai B, Chen H (2011) A multi-agent and auction-based framework and approach for carrier collaboration. Logist Res 3(2\u20133):101\u2013120","journal-title":"Logist Res"},{"issue":"3","key":"516_CR14","first-page":"361","volume":"14","author":"B Dai","year":"2014","unstructured":"Dai B, Chen H, Yang G (2014) Price-setting based combinatorial auction approach for carrier collaboration with pickup and delivery requests. Oper Res 14(3):361\u2013386","journal-title":"Oper Res"},{"issue":"3","key":"516_CR15","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S Vries de","year":"2003","unstructured":"de Vries S, Vohra R (2003) Combinatorial auctions: a survey. Informs J Comput 15(3):284\u2013309","journal-title":"Informs J Comput"},{"key":"516_CR16","first-page":"206","volume-title":"Survey: matheuristics for rich vehicle routing problems","author":"KF D\u00f6rner","year":"2010","unstructured":"D\u00f6rner KF, Schmid V (2010) Survey: matheuristics for rich vehicle routing problems. Springer, Berlin, Heidelberg, pp 206\u2013221"},{"issue":"2","key":"516_CR17","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1287\/trsc.1060.0169","volume":"41","author":"O Ergun","year":"2007","unstructured":"Ergun O, Kuyzu G, Savelsbergh M (2007a) Reducing truckload transportation costs through collaboration. Transp Sci 41(2):206\u2013221","journal-title":"Transp Sci"},{"key":"516_CR18","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1016\/j.cor.2005.07.026","volume":"34","author":"O Ergun","year":"2007","unstructured":"Ergun O, Kuyzu G, Savelsbergh M (2007b) Shipper collaboration. Comput Oper Res 34:1551\u20131560","journal-title":"Comput Oper Res"},{"issue":"1","key":"516_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00291-015-0411-1","volume":"38","author":"M Gansterer","year":"2016","unstructured":"Gansterer M, Hartl RF (2016) Request evaluation strategies for carriers in auction-based collaborations. OR Spectr 38(1):3\u201323","journal-title":"OR Spectr"},{"key":"516_CR20","first-page":"1","volume":"39","author":"M Gansterer","year":"2016","unstructured":"Gansterer M, K\u00fc\u00e7\u00fcktepe M, Hartl RF (2016) The multi-vehicle profitable pickup and delivery problem. OR Spectrum 39:1\u201317","journal-title":"OR Spectrum"},{"key":"516_CR21","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning, 1st edn. Addison-Wesley Longman Publishing Co., Inc, Boston","edition":"1"},{"key":"516_CR22","doi-asserted-by":"crossref","unstructured":"Groves T (1973) Incentives in teams. Econometrica 41(4):617\u2013631, URL \n                    http:\/\/www.jstor.org\/stable\/1914085","DOI":"10.2307\/1914085"},{"issue":"3","key":"516_CR23","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1111\/itor.12205","volume":"23","author":"M Guajardo","year":"2016","unstructured":"Guajardo M, R\u00f6nnqvist M (2016) A review on cost allocation methods in collaborative transportation. Int Trans Oper Res 23(3):371\u2013392. \n                    https:\/\/doi.org\/10.1111\/itor.12205","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"516_CR24","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.3982\/TE2275","volume":"12","author":"F Kojima","year":"2017","unstructured":"Kojima F, Yamashita T (2017) Double auction with interdependent values: incentives and efficiency. Theor Econ 12(3):1393\u20131438","journal-title":"Theor Econ"},{"issue":"3","key":"516_CR25","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s00291-005-0031-2","volume":"28","author":"M Krajewska","year":"2006","unstructured":"Krajewska M, Kopfer H (2006) Collaborating freight forwarding enterprises. OR Spectr 28(3):301\u2013317","journal-title":"OR Spectr"},{"key":"516_CR26","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1057\/palgrave.jors.2602489","volume":"59","author":"M Krajewska","year":"2008","unstructured":"Krajewska M, Kopfer H, Laporte G, Ropke S, Zaccor G (2008) Horizontal cooperation among freight carriers: request allocation and profit sharing. J Oper Res Soc 59:1483\u20131491","journal-title":"J Oper Res Soc"},{"issue":"5","key":"516_CR27","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/inte.32.5.4.30","volume":"32","author":"J Ledyard","year":"2002","unstructured":"Ledyard J, Olson M, Porter D, Swanson J, Torma D (2002) The first use of a combined-value auction for transportation services. Interfaces 32(5):4\u201312","journal-title":"Interfaces"},{"key":"516_CR28","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tre.2015.09.010","volume":"84","author":"J Li","year":"2015","unstructured":"Li J, Rong G, Feng Y (2015) Request selection and exchange approach for carrier collaboration based on auction of a single request. Transp Res Part E Logist Transp Rev 84:23\u201339","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"1","key":"516_CR29","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ejor.2015.12.032","volume":"252","author":"Y Li","year":"2016","unstructured":"Li Y, Chen H, Prins C (2016) Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. Eur J Oper Res 252(1):27\u201338","journal-title":"Eur J Oper Res"},{"issue":"4","key":"516_CR30","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.cie.2008.03.001","volume":"55","author":"C Lin","year":"2008","unstructured":"Lin C (2008) A cooperative strategy for a vehicle routing problem with pickup and delivery time windows. Comput Ind Eng 55(4):766\u2013782","journal-title":"Comput Ind Eng"},{"key":"516_CR31","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44:2245\u20132269","journal-title":"Bell Syst Tech J"},{"key":"516_CR32","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd S (1982) Least squares quantization in PCM. IEEE Trans Inf Theor 28:129\u2013137","journal-title":"IEEE Trans Inf Theor"},{"key":"516_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic algorithms + data structures = evolution programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z (1996) Genetic algorithms + data structures = evolution programs, 3rd edn. Springer, London","edition":"3"},{"issue":"6","key":"516_CR34","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1080\/09537287.2016.1147092","volume":"27","author":"JR Montoya-Torres","year":"2016","unstructured":"Montoya-Torres JR, Mu\u00f1oz-Villamizar A, Vega-Mejia CA (2016) On the impact of collaborative strategies for goods delivery in city logistics. Prod Plan Control 27(6):443\u2013455","journal-title":"Prod Plan Control"},{"key":"516_CR35","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"S Parragh","year":"2008","unstructured":"Parragh S, D\u00f6rner K, Hartl R (2008) A survey on pickup and delivery problems. Part II: transportation between pickup and delivery locations. J f\u00fcr Betriebswirtschaft 58:21\u201351","journal-title":"J f\u00fcr Betriebswirtschaft"},{"issue":"1","key":"516_CR36","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/j.cor.2012.08.004","volume":"40","author":"SN Parragh","year":"2013","unstructured":"Parragh SN, Schmid V (2013) Hybrid column generation and large neighborhood search for the dial-a-ride problem. Comput Oper Res 40(1):490\u2013497","journal-title":"Comput Oper Res"},{"issue":"11","key":"516_CR37","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1287\/mnsc.49.11.1485.20585","volume":"49","author":"A Peke\u010d","year":"2003","unstructured":"Peke\u010d A, Rothkopf M (2003) Combinatorial auction design. Manag Sci 49(11):1485\u20131503","journal-title":"Manag Sci"},{"issue":"3","key":"516_CR38","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s00291-010-0211-6","volume":"32","author":"C Puettmann","year":"2010","unstructured":"Puettmann C, Stadtler H (2010) A collaborative planning approach for intermodal freight transportation. OR Spectr 32(3):809\u2013830","journal-title":"OR Spectr"},{"key":"516_CR39","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.trc.2013.07.006","volume":"35","author":"N Remli","year":"2013","unstructured":"Remli N, Rekik M (2013) A robust winner determination problem for combinatorial transportation auctions under uncertain shipment volumes. Transp Res Part C Emerg Technol 35:204\u2013217","journal-title":"Transp Res Part C Emerg Technol"},{"key":"516_CR40","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1016\/S0305-0548(99)00066-0","volume":"27","author":"J Renaud","year":"2000","unstructured":"Renaud J, Boctor F, Quenniche J (2000) A heuristic for the pickup and delivery traveling salesman problem. Comput Oper Res 27:905\u2013916","journal-title":"Comput Oper Res"},{"key":"516_CR41","unstructured":"Schmelzer H (2014) Cooperational platform for urban logistics in Zurich. Accessed June 2017. \n                    https:\/\/blog.zhaw.ch\/mobine\/category\/1\/city-logistik\/"},{"issue":"1","key":"516_CR42","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/trsc.1080.0249","volume":"43","author":"V Schmid","year":"2009","unstructured":"Schmid V, D\u00f6rner KF, Hartl RF, Savelsbergh MWP, St\u00f6cher W (2009) A hybrid solution approach for ready-mixed concrete delivery. Transp Sci 43(1):70\u201385","journal-title":"Transp Sci"},{"key":"516_CR43","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10257-008-0102-4","volume":"7","author":"M Schwind","year":"2009","unstructured":"Schwind M, Gujo O, Vykoukal J (2009) A combinatorial intra-enterprise exchange for logistics services. Inf Syst E-Bus Manag 7:447\u2013471","journal-title":"Inf Syst E-Bus Manag"},{"issue":"4","key":"516_CR44","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1287\/inte.1040.0075","volume":"34","author":"Y Sheffi","year":"2004","unstructured":"Sheffi Y (2004) Combinatorial auctions in the procurement of transportation services. Interfaces 34(4):245\u2013252","journal-title":"Interfaces"},{"key":"516_CR45","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1016\/j.ejor.2012.07.021","volume":"223","author":"R Sprenger","year":"2012","unstructured":"Sprenger R, M\u00f6nch L (2012) A methodology to solve large-scale cooperative transportation planning problems. Eur J Oper Res 223:626\u2013636","journal-title":"Eur J Oper Res"},{"issue":"3","key":"516_CR46","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1016\/j.ejor.2013.06.013","volume":"236","author":"C Triki","year":"2014","unstructured":"Triki C, Oprea S, Beraldi P, Crainic T (2014) The stochastic bid generation problem in combinatorial transportation auctions. Eur J Oper Res 236(3):991\u2013999","journal-title":"Eur J Oper Res"},{"issue":"3","key":"516_CR47","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Financ 16(3):8\u201337","journal-title":"J Financ"},{"issue":"3","key":"516_CR48","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","volume":"234","author":"T Vidal","year":"2014","unstructured":"Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur J Oper Res 234(3):658\u2013673","journal-title":"Eur J Oper Res"},{"issue":"2","key":"516_CR49","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ejor.2013.04.026","volume":"230","author":"JG Villegas","year":"2013","unstructured":"Villegas JG, Prins C, Prodhon C, Medaglia AL, Velasco N (2013) A matheuristic for the truck and trailer routing problem. Eur J Oper Res 230(2):231\u2013244","journal-title":"Eur J Oper Res"},{"key":"516_CR50","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00291-013-0331-x","volume":"36","author":"X Wang","year":"2014","unstructured":"Wang X, Kopfer H (2014) Collaborative transportation planning of less-than-truckload freight. OR Spectr 36:357\u2013380","journal-title":"OR Spectr"},{"key":"516_CR51","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1177\/0361198105192300120","volume":"1923","author":"X Wang","year":"2005","unstructured":"Wang X, Xia M (2005) Combinatorial bid generation problem for transportation service procurement. Transp Res Record J Transp Res Board 1923:189\u2013198","journal-title":"Transp Res Record J Transp Res Board"},{"key":"516_CR52","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1287\/trsc.2016.0694","volume":"51","author":"SX Xu","year":"2016","unstructured":"Xu SX, Huang GQ, Cheng M (2016) Truthful, budget-balanced bundle double auctions for carrier collaboration. Transp Sci 51:1365\u20131386","journal-title":"Transp Sci"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-018-0516-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0516-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-018-0516-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T20:48:19Z","timestamp":1553806099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-018-0516-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,29]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["516"],"URL":"https:\/\/doi.org\/10.1007\/s00291-018-0516-4","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,29]]},"assertion":[{"value":"29 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}