Competitive Analysis for Multi-objective Online Algorithms

Author(s):  
Morten Tiedemann ◽  
Jonas Ide ◽  
Anita Schöbel
2019 ◽  
Vol 53 (3) ◽  
pp. 1007-1031 ◽  
Author(s):  
Sahar Bsaybes ◽  
Alain Quilliot ◽  
Annegret K. Wagler

The VIPAFLEET project consists in developing models and algorithms for managing a fleet of Individual Public Autonomous Vehicles (VIPA). Hereby, we consider a fleet of cars distributed at specified stations in an industrial area to supply internal transportation, where the cars can be used in different modes of circulation (tram mode, elevator mode, taxi mode). One goal is to develop and implement suitable algorithms for each mode in order to satisfy all the requests under an economic point of view by minimizing the total tour length. The innovative idea and challenge of the project is to develop and install a dynamic fleet management system that allows the operator to switch between the different modes within the different periods of the day according to the dynamic transportation demands of the users. We model the underlying online transportation system and propose a corresponding fleet management framework, to handle modes, demands and commands. We consider two modes of circulation, tram and elevator mode, propose for each mode appropriate online algorithms and evaluate their performance, both in terms of competitive analysis and practical behavior.


2015 ◽  
Vol 26 (04) ◽  
pp. 413-439 ◽  
Author(s):  
Joan Boyar ◽  
Kim S. Larsen ◽  
Abyayananda Maiti

This is a contribution to the ongoing study of properties of performance measures for online algorithms. It has long been known that competitive analysis suffers from draw-backs in certain situations, and many alternative measures have been proposed. More systematic comparative studies of performance measures have been initiated recently, and we continue this work, considering competitive analysis, relative interval analysis, and relative worst order analysis on the frequent items problem, a fundamental online streaming problem.


2016 ◽  
Vol 33 (02) ◽  
pp. 1650011 ◽  
Author(s):  
Weimin Ma ◽  
Xiaodong Ji

An original online problem with decreasing profit growth rate is proposed to optimize the work hours of employees, named the online work-break problem (WBP). In this problem, the manager has to answer for an abstract worker when he should have a break for his work efficiency declines with the durative time of work period. The efficiency of the worker is presented by a work efficiency function [Formula: see text] in the description of our problem. We present the online algorithms to solve the WBP based on linear estimation of [Formula: see text] under two levels. Both the problems with single-period and dynamic multi-periods have 2-competitive online algorithms.


Author(s):  
Longjiang Li ◽  
Haoyang Liang ◽  
Penghui Fan ◽  
Tongqiang Li ◽  
Shawn Xiaoli Xiong ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document