Oadrp Having Issues with Due Date and Limitations with Information
Main Article Content
Abstract
The "Online Dial-A-Ride Problem (ODARP)" is discussed in this article and time constraints and demand specifics include a deadline to reach the time limit. If a proposal is not filed by its delivery date, it will be cancelled. For data limit, only data on the origin is presented whenever the application is received public. And until the basis of the request is met, the target of the server is not statistics. The purpose of the problem is to schedule a server movement so that its deadlines can be met for a determined figure of queries (or the extreme amount of goods). We examine competitively several deterministic strategies with various constraints on the problem. And in various cases this paper shows many lower limits on the competitiveness of any deterministic algorithm for the problem.
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.