{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:26:01Z","timestamp":1760145961279,"version":"build-2065373602"},"reference-count":18,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T00:00:00Z","timestamp":1726876800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In this paper, we consider some problems that arise in connected and autonomous vehicle (CAV) systems. Their simplified variants can be formulated as scheduling problems. Therefore, scheduling solution algorithms can be used as a part of solution algorithms for real-world problems. For four variants of such problems, mathematical models and solution algorithms are presented. In particular, three polynomial algorithms and a branch and bound algorithm are developed. These CAV scheduling problems are considered in the literature for the first time. More complicated NP-hard scheduling problems related to CAVs can be considered in the future.<\/jats:p>","DOI":"10.3390\/a17090421","type":"journal-article","created":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T08:54:17Z","timestamp":1727168057000},"page":"421","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Connected and Autonomous Vehicle Scheduling Problems: Some Models and Algorithms"],"prefix":"10.3390","volume":"17","author":[{"given":"Evgeny R.","family":"Gafarov","sequence":"first","affiliation":[{"name":"V.A. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Profsoyuznaya St. 65, Moscow 117997, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0709-3591","authenticated-orcid":false,"given":"Frank","family":"Werner","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics, Otto-von-Guericke-Universit\u00e4t Magdeburg, PSF 4120, 39016 Magdeburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,9,21]]},"reference":[{"key":"ref_1","first-page":"152","article-title":"Integrated Machine Scheduling and Vehicle Routing with Time Windows","volume":"1","author":"Ullrich","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s11590-015-0878-3","article-title":"Heuristic Solutions for the Vehicle Routing Problem with Time Windows and Synchronized Visits","volume":"10","author":"Afifi","year":"2016","journal-title":"Optim. Lett."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s11590-015-0996-y","article-title":"Modified Particle Swarm Optimization in a Time-Dependent Vehicle Routing Problem: Minimizing Fuel Consumption","volume":"11","author":"Norouzi","year":"2017","journal-title":"Optim. Lett."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"6527","DOI":"10.1080\/00207543.2018.1471241","article-title":"Incorporating Supplier Selection and Order Allocation into the Vehicle Routing and Multi-Cross-Dock Scheduling Problem","volume":"56","author":"Nasiri","year":"2018","journal-title":"Intern. J. Prod. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/j.apm.2019.01.047","article-title":"The Vehicle Routing and Scheduling Problem with Cross-Docking for Perishable Products under Uncertainty: Two Robust Bi-objective Models","volume":"70","author":"Rahbari","year":"2018","journal-title":"Appl. Math. Modell."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1399","DOI":"10.1007\/s11590-012-0603-4","article-title":"Special Issue on Vehicle Routing and Scheduling: Recent Trends and Advances","volume":"7","author":"Repoussis","year":"2013","journal-title":"Optim. Lett."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s12469-010-0018-5","article-title":"An Overview on Vehicle Scheduling Models","volume":"1","author":"Bunte","year":"2009","journal-title":"Public Transport."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"042024","DOI":"10.1088\/1757-899X\/452\/4\/042024","article-title":"A Survey for Vehicle Routing Problems and its Derivatives","volume":"452","author":"Han","year":"2018","journal-title":"IOP Conf. Ser. Mater. Sci. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10288-020-00433-2","article-title":"Vehicle Routing Problems over Time: A Survey","volume":"18","author":"Mor","year":"2020","journal-title":"4OR"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Bazzal, M., Krawczyk, L., Govindarajan, R.P., and Wolff, C. (2020, January 17\u201318). Timing Analysis of Car-to-Car Communication Systems Using Real-Time Calculus: A Case Study. Proceedings of the 2020 IEEE 5th International Symposium on Smart and Wireless Systems within the Conferences on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS-SWS), Dortmund, Germany.","DOI":"10.1109\/IDAACS-SWS50031.2020.9297100"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"\u015eahin, T., Khalili, R., Boban, M., and Wolisz, A. (2018, January 5\u20137). Reinforcement Learning Scheduler for Vehicle-to-Vehicle Communications Outside Coverage. Proceedings of the 2018 IEEE Vehicular Networking Conference (VNC), Taipei, Taiwan.","DOI":"10.1109\/VNC.2018.8628366"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"103011","DOI":"10.1016\/j.trc.2021.103011","article-title":"Traffic scheduling and control in fully connected and automated networks","volume":"126","author":"Qian","year":"2021","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"103985","DOI":"10.1016\/j.trc.2022.103985","article-title":"Lane change scheduling for connected and autonomous vehicles","volume":"147","author":"Atagoziev","year":"2023","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Ma, M. (2022). Optimal Scheduling of Connected and Autonomous Vehicles at a Reservation-Based Intersection. [Ph.D. Thesis, University of Louisville].","DOI":"10.2139\/ssrn.4097173"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Bani Younes, M., and Boukerche, A. (2014, January 8\u201311). An Intelligent Traffic Light scheduling algorithm through VANETs. Proceedings of the 39th Annual IEEE Conference on Local Computer Networks Workshops, Edmonton, AB, Canada.","DOI":"10.1109\/LCNW.2014.6927714"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and Approximation in Deterministic Machine Scheduling: A Survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discr. Math."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(80)90111-3","article-title":"Complexity results for scheduling chains on a single machine","volume":"4","author":"Lenstra","year":"1980","journal-title":"Eur. J. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0166-218X(99)00238-3","article-title":"Scheduling equal-length jobs on identical parallel machines","volume":"103","author":"Baptiste","year":"2000","journal-title":"Discret. Appl. Math."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/9\/421\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T16:01:45Z","timestamp":1760112105000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/9\/421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,21]]},"references-count":18,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["a17090421"],"URL":"https:\/\/doi.org\/10.3390\/a17090421","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2024,9,21]]}}}