{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T09:40:20Z","timestamp":1776764420351,"version":"3.51.2"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T00:00:00Z","timestamp":1476403200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10100-016-0455-6","type":"journal-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T13:22:14Z","timestamp":1476451334000},"page":"831-858","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Evaluating the quality of online optimization algorithms by discrete event simulation"],"prefix":"10.1007","volume":"25","author":[{"given":"Fabian","family":"Dunke","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Nickel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,14]]},"reference":[{"key":"455_CR1","unstructured":"Angelopoulos S, Dorrigiv R, L\u00f3pez-Ortiz A (2007) On the separation and equivalence of paging strategies. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms, pp 229\u2013237"},{"issue":"1","key":"455_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1287\/moor.1050.0170","volume":"31","author":"L Becchetti","year":"2006","unstructured":"Becchetti L, Leonardi S, Marchetti-Spaccamela A, Sch\u00e4fer G, Vredeveld T (2006) Average-case and smoothed competitive analysis of the multilevel feedback algorithm. Math Oper Res 31(1):85\u2013108","journal-title":"Math Oper Res"},{"issue":"1","key":"455_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01294264","volume":"11","author":"S Ben-David","year":"1994","unstructured":"Ben-David S, Borodin A (1994) A new measure for the study of on-line algorithms. Algorithmica 11(1):73\u201391","journal-title":"Algorithmica"},{"key":"455_CR4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-46521-9_12","volume-title":"Algorithms and complexit","author":"M Blom","year":"2000","unstructured":"Blom M, Krumke S, de Paepe W, Stougie L (2000) The online TSP against fair adversaries. In: Bongiovanni G, Petreschi R, Gambosi G (eds) Algorithms and complexit. Springer, Berlin, pp 137\u2013149"},{"key":"455_CR5","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"key":"455_CR6","doi-asserted-by":"crossref","unstructured":"Boyar J, Favrholdt L (2007) The relative worst order ratio for online algorithms. In: ACM transactions on algorithms, 3(2), article no. 22","DOI":"10.1145\/1240233.1240245"},{"issue":"1","key":"455_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00236-003-0124-9","volume":"40","author":"J Boyar","year":"2003","unstructured":"Boyar J, Favrholdt L, Larsen K, Nielsen M (2003) Extending the accommodating function. Acta Inform 40(1):3\u201335","journal-title":"Acta Inform"},{"issue":"1","key":"455_CR8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1137\/S0097539799361786","volume":"31","author":"J Boyar","year":"2002","unstructured":"Boyar J, Larsen K, Nielsen M (2002) The accommodating function: a generalization of the competitive ratio. SIAM J Comput 31(1):233\u2013258","journal-title":"SIAM J Comput"},{"key":"455_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68612-7","volume-title":"Introduction to discrete event systems","author":"C Cassandras","year":"2008","unstructured":"Cassandras C, Lafortune S (2008) Introduction to discrete event systems, 2nd edn. Springer, Berlin","edition":"2"},{"issue":"2","key":"455_CR10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0019-9958(80)90050-9","volume":"44","author":"E Coffman","year":"1980","unstructured":"Coffman E, So K, Hofri M, Yao A (1980) A stochastic model of bin-packing. Inf Control 44(2):105\u2013115","journal-title":"Inf Control"},{"issue":"6","key":"455_CR11","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"J Cordeau","year":"2003","unstructured":"Cordeau J, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp Res B Methodol 37(6):579\u2013594","journal-title":"Transp Res B Methodol"},{"issue":"6","key":"455_CR12","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791\u2013812","journal-title":"Oper Res"},{"issue":"2","key":"455_CR13","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0196-6774(02)00202-X","volume":"44","author":"J Csirik","year":"2002","unstructured":"Csirik J, Woeginger G (2002) Resource augmentation for online bounded space bin packing. J Algorithms 44(2):308\u2013320","journal-title":"J Algorithms"},{"key":"455_CR14","unstructured":"Dorrigiv R, Lopez-Ortiz A (2007) Adaptive analysis of on-line algorithms. In: Fekete S, Fleischer R, Klein R, Lopez-Ortiz A (eds) Robot navigation, number 06421 in Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI). Schloss Dagstuhl, Germany"},{"key":"455_CR15","doi-asserted-by":"crossref","unstructured":"Dorrigiv R, L\u00f3pez-Ortiz A (2008) Closing the gap between theory and practice: new measures for on-line algorithm analysis. In: Proceedings of the 2nd international conference on algorithms and computation, pp 13\u201324","DOI":"10.1007\/978-3-540-77891-2_2"},{"issue":"38\u201340","key":"455_CR16","doi-asserted-by":"crossref","first-page":"3694","DOI":"10.1016\/j.tcs.2009.04.023","volume":"410","author":"R Dorrigiv","year":"2009","unstructured":"Dorrigiv R, L\u00f3pez-Ortiz A, Munro J (2009) On the relative dominance of paging algorithms. Theor Comput Sci 410(38\u201340):3694\u20133701","journal-title":"Theor Comput Sci"},{"key":"455_CR17","unstructured":"Dunke F (2014) Online Optimization with Lookahead. Ph.D. thesis, Karlsruhe Institute of Technology"},{"key":"455_CR18","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BFb0029578","volume-title":"Online algorithms: the state of the art","author":"A Fiat","year":"1998","unstructured":"Fiat A, Woeginger G (1998) Competitive odds and ends. In: Fiat A, Woeginger G (eds) Online algorithms: the state of the art. Springer, Berlin, pp 385\u2013394"},{"issue":"1","key":"455_CR19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321796.321800","volume":"21","author":"P Franaszek","year":"1974","unstructured":"Franaszek P, Wagner T (1974) Some distribution-free aspects of paging algorithm performance. J ACM 21(1):31\u201339","journal-title":"J ACM"},{"key":"455_CR20","volume-title":"Introduction to logistics systems planning and control","author":"G Ghiani","year":"2004","unstructured":"Ghiani G, Laporte G, Musmanno R (2004) Introduction to logistics systems planning and control. Wiley, Hoboken"},{"key":"455_CR21","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel M, Krumke S, Rambau J (eds) (2001) Online optimization of large scale systems, Springer","DOI":"10.1007\/978-3-662-04331-8"},{"key":"455_CR22","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/978-3-662-04331-8_33","volume-title":"Online optimization of large scale systems","author":"M Gr\u00f6tschel","year":"2001","unstructured":"Gr\u00f6tschel M, Krumke S, Rambau J, Winter T, Zimmermann U (2001) Combinatorial online optimization in real time. In: Gr\u00f6tschel M, Krumke S, Rambau J (eds) Online optimization of large scale systems. Springer, Berlin, pp 679\u2013704"},{"key":"455_CR23","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-1-4471-2274-6_6","volume-title":"Warehousing in the global supply chain","author":"S Henn","year":"2012","unstructured":"Henn S, Koch S, W\u00e4scher G (2012) Order batching in order picking warehouses: a survey of solution approaches. In: Manzini R (ed) Warehousing in the global supply chain. Springer, Berlin, pp 105\u2013137"},{"key":"455_CR24","unstructured":"Hiller B (2009) Online optimization: probabilistic analysis and algorithm engineering. Ph.D. thesis, Technische Universit\u00e4t Berlin"},{"key":"455_CR25","unstructured":"Huber C (2011) Throughput analysis of manual order picking systems with congestion consideration. Ph.D. thesis, Karlsruher Institut f\u00fcr Technologie"},{"issue":"4","key":"455_CR26","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1103\/PhysRev.106.620","volume":"106","author":"E Jaynes","year":"1957","unstructured":"Jaynes E (1957) Information theory and statistical mechanics. Phys Rev 106(4):620\u2013630","journal-title":"Phys Rev"},{"issue":"2","key":"455_CR27","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1103\/PhysRev.108.171","volume":"108","author":"E Jaynes","year":"1957","unstructured":"Jaynes E (1957) Information theory and statistical mechanics II. Phys Rev 108(2):171\u2013190","journal-title":"Phys Rev"},{"key":"455_CR28","volume-title":"Online storage systems and transportation problems with applications: optimization models and mathematical solutions","author":"J Kallrath","year":"2005","unstructured":"Kallrath J (2005) Online storage systems and transportation problems with applications: optimization models and mathematical solutions. Springer, Berlin"},{"issue":"4","key":"455_CR29","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram B, Pruhs K (2000) Speed is as powerful as clairvoyance. J ACM 47(4):617\u2013643","journal-title":"J ACM"},{"issue":"1\u20134","key":"455_CR30","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A Karlin","year":"1988","unstructured":"Karlin A, Manasse M, Rudolph L, Sleator D (1988) Competitive snoopy caching. Algorithmica 3(1\u20134):79\u2013119","journal-title":"Algorithmica"},{"issue":"3","key":"455_CR31","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1137\/S0097539794268042","volume":"30","author":"A Karlin","year":"2000","unstructured":"Karlin A, Phillips S, Raghavan P (2000) Markov paging. SIAM J Comput 30(3):906\u2013922","journal-title":"SIAM J Comput"},{"key":"455_CR32","unstructured":"Kenyon C (1996) Best-fit bin-packing with random order. In: Proceedings of the 7th annual ACM-SIAM symposium on discrete algorithms, pp 359\u2013364"},{"issue":"4598","key":"455_CR33","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi P (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"1","key":"455_CR34","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/S0097539796299540","volume":"30","author":"E Koutsoupias","year":"2000","unstructured":"Koutsoupias E, Papadimitriou C (2000) Beyond competitive analysis. SIAM J Comput 30(1):300\u2013317","journal-title":"SIAM J Comput"},{"key":"455_CR35","doi-asserted-by":"crossref","unstructured":"Krumke S, Laura L, Lipmann M, Marchetti-Spaccamela A, Paepe Wd, Poensgen D, Stougie L (2002) Non-abusiveness helps: An o(1)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem. In: Proceedings of the 5th international workshop on approximation algorithms for combinatorial oimization, APPROX \u201902, 200\u2013214, Springer","DOI":"10.1007\/3-540-45753-4_18"},{"key":"455_CR36","doi-asserted-by":"crossref","unstructured":"Lawler E, Lenstra J, Rinnooy\u00a0Kan A, Shmoys D (eds.) (1985) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley","DOI":"10.2307\/2582681"},{"issue":"4","key":"455_CR37","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C Miller","year":"1960","unstructured":"Miller C, Tucker A, Zemlin R (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326\u2013329","journal-title":"J ACM"},{"key":"455_CR38","volume-title":"Comparison methods for stochastic models and risks","author":"A M\u00fcller","year":"2002","unstructured":"M\u00fcller A, Stoyan D (2002) Comparison methods for stochastic models and risks. Wiley, Hoboken"},{"key":"455_CR39","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-14536-0_5","volume-title":"Simulation und Optimierung in Produktion und Logistik: Praxisorientierter Leitfaden mit Fallbeispielen","author":"L M\u00e4rz","year":"2011","unstructured":"M\u00e4rz L, Krug W (2011) Kopplung von Simulation und Optimierung. In: Krug W, Rose O, Weigert G (eds) Simulation und Optimierung in Produktion und Logistik: Praxisorientierter Leitfaden mit Fallbeispielen. Springer, Berlin, pp 41\u201345"},{"issue":"1","key":"455_CR40","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"H Psaraftis","year":"1995","unstructured":"Psaraftis H (1995) Dynamic vehicle routing: status and prospects. Ann Oper Res 61(1):143\u2013164","journal-title":"Ann Oper Res"},{"key":"455_CR41","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1090\/dimacs\/007\/05","volume":"7","author":"P Raghavan","year":"1991","unstructured":"Raghavan P (1991) A statistical adversary for on-line algorithms. DIMACS Ser Discrete Math Theor Comput Sci 7:79\u201383","journal-title":"DIMACS Ser Discrete Math Theor Comput Sci"},{"issue":"1","key":"455_CR42","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/1120582.1120585","volume":"53","author":"M Scharbrodt","year":"2006","unstructured":"Scharbrodt M, Schickinger T, Steger A (2006) A new average case analysis for completion time scheduling. J ACM 53(1):121\u2013146","journal-title":"J ACM"},{"issue":"2","key":"455_CR43","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D Sleator","year":"1985","unstructured":"Sleator D, Tarjan R (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(2):202\u2013208","journal-title":"Commun ACM"},{"issue":"3","key":"455_CR44","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"D Spielman","year":"2004","unstructured":"Spielman D, Teng S (2004) Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. J ACM 51(3):385\u2013463","journal-title":"J ACM"},{"key":"455_CR45","doi-asserted-by":"crossref","unstructured":"Stadtler H, Kilger C (eds.) (2008) Supply chain management and advanced planning: concepts, models, sftware, and case studies. Springer, 4th edn","DOI":"10.1007\/978-3-540-74512-9"},{"key":"455_CR46","doi-asserted-by":"crossref","unstructured":"Toth PM, Vigo D (eds.) (2002) The vehicle routing problem. SIAM","DOI":"10.1137\/1.9780898718515"},{"key":"455_CR47","unstructured":"Verein Deutscher Ingenieure (VDI) (1996) VDI-Richtlinie 3633. Simulation von Logistik-, Materialflu\u00df- und Produktionssystemen: Begriffsdefinitionen. In: VDI-Handbuch Materialflu\u00df und F\u00f6rdertechnik, Beuth"},{"issue":"6","key":"455_CR48","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/BF01189992","volume":"11","author":"N Young","year":"1994","unstructured":"Young N (1994) The k-server dual and loose competitiveness for paging. Algorithmica 11(6):525\u2013541","journal-title":"Algorithmica"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-016-0455-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-016-0455-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-016-0455-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T16:14:40Z","timestamp":1568477680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-016-0455-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,14]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["455"],"URL":"https:\/\/doi.org\/10.1007\/s10100-016-0455-6","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,14]]}}}