Evaluating the quality of online optimization algorithms by discrete event simulation

DOI10.1007/S10100-016-0455-6zbMath1390.90059OpenAlexW2529895156MaRDI QIDQ1642796

Fabian Dunke, Stefan Nickel

Publication date: 15 June 2018

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-016-0455-6

zbMATH Keywords

order pickingonline optimizationpickup and deliveryalgorithm analysisdiscrete event simulation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Editorial

Uses Software

• VRP
• UMDES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• On the relative dominance of paging algorithms
• Competitive snoopy caching
• A new measure for the study of on-line algorithms
• Extending the accommodating function
• Online storage systems and transportation problems with applications. Optimization models and mathematical solutions.
• Dynamic vehicle routing: Status and prospects
• The Vehicle Routing Problem
• The Accommodating Function: A Generalization of the Competitive Ratio
• The relative worst order ratio for online algorithms
• Some Distribution-Free Aspects of Paging Algorithm Performance
• Information Theory and Statistical Mechanics
• Integer Programming Formulation of Traveling Salesman Problems
• Introduction to Discrete Event Systems
• Smoothed analysis of algorithms
• A stochastic model of bin-packing
• Speed is as powerful as clairvoyance
• Beyond Competitive Analysis
• Markov Paging
• Resource augmentation for online bounded space bin packing
• A Method for Solving Traveling-Salesman Problems
• On the Relative Dominance of Paging Algorithms
• Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
• Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
• A new average case analysis for completion time scheduling

This page was built for publication: Evaluating the quality of online optimization algorithms by discrete event simulation