Evaluating the quality of online optimization algorithms by discrete event simulation

DOI10.1007/S10100-016-0455-6MaRDI QIDQ1642796zbMATH OpenOpenAlexFDO

Authors Fabian Dunke, S. 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

online optimizationpickup and deliveryalgorithm analysisorder pickingdiscrete event simulation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 744082
• scientific article; zbMATH DE number 125280
• Optimization of the Transient and Steady-State Behavior of Discrete Event Systems
• Optimization Models of Discrete-Event System Dynamics
• Near-optimal online control of dynamic discrete-event systems

Cites work

• scientific article; zbMATH DE number 1629852 (Why is no real title available?)
• scientific article; zbMATH DE number 1656903 (Why is no real title available?)
• scientific article; zbMATH DE number 1688603 (Why is no real title available?)
• scientific article; zbMATH DE number 50190 (Why is no real title available?)
• scientific article; zbMATH DE number 65698 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1947058 (Why is no real title available?)
• scientific article; zbMATH DE number 871933 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• A method for solving traveling-salesman problems
• A new average case analysis for completion time scheduling
• A new measure for the study of on-line algorithms
• A stochastic model of bin-packing
• Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
• Beyond Competitive Analysis
• Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
• Comparison methods for stochastic models and risks
• Competitive snoopy caching
• Dynamic vehicle routing: Status and prospects
• Extending the accommodating function
• Information Theory and Statistical Mechanics
• Integer Programming Formulation of Traveling Salesman Problems
• Introduction to Discrete Event Systems
• Markov Paging
• On the Relative Dominance of Paging Algorithms
• On the relative dominance of paging algorithms
• On the separation and equivalence of paging strategies
• Online storage systems and transportation problems with applications. Optimization models and mathematical solutions.
• Optimization by simulated annealing
• Resource augmentation for online bounded space bin packing
• Smoothed analysis of algorithms
• Some Distribution-Free Aspects of Paging Algorithm Performance
• Speed is as powerful as clairvoyance
• The accommodating function: A generalization of the competitive ratio
• The relative worst order ratio for online algorithms
• The vehicle routing problem

Cited in

(2)

• scientific article; zbMATH DE number 744082 (Why is no real title available?)
• Editorial

Describes a project that uses

Uses Software

• UMDES
• VRP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1642796)