Connected and Autonomous Vehicle Scheduling Problems: Some Models and Algorithms

04/04/2023
by   Evgeny R. Gafarov, et al.
0

In this paper, we consider scheduling problems that arise in connected and autonomous vehicle systems. For four variants of such problems, mathematical models and solution algorithms are presented. In particular, three polynomial algorithms and a branch and bound algorithms are developed.

READ FULL TEXT
research
10/24/2012

Disk Scheduling: Selection of Algorithm

The objective of this paper is to take some aspects of disk scheduling a...
research
11/14/2022

A ride time-oriented scheduling algorithm for dial-a-ride problems

This paper offers a new algorithm to efficiently optimize scheduling dec...
research
09/03/1999

Iterative Deepening Branch and Bound

In tree search problem the best-first search algorithm needs too much of...
research
05/06/2020

Vehicle Routing and Scheduling for Regular Mobile Healthcare Services

We propose our solution to a particular practical problem in the domain ...
research
12/01/2017

Gain Scheduling LPV Control Scheme for the Autonomous Guidance Problem using a Dynamic Modelling Approach

This work proposes a solution for the longitudinal and lateral control p...
research
12/06/2017

Exact Algorithms With Worst-case Guarantee For Scheduling: From Theory to Practice

This PhD thesis summarizes research works on the design of exact algorit...
research
04/27/2015

Further Connections Between Contract-Scheduling and Ray-Searching Problems

This paper addresses two classes of different, yet interrelated optimiza...

Please sign up or login with your details

Forgot password? Click here to reset