Scholarlink

Route optimization algorithms are essential to calculate the best routes and solve problems that may arise in logistics services. This study focuses on the problem of route optimization for both single and fleets of electrical motorbikes dedicated to urban services. The paper explores the most relevant and widely-known problems within route optimization, which match the requirements of the specified target problem, e.g., traveling salesman problems. This paper also explores the most widely used algorithms for solving the identified problem variations, namely exact methods such as Branch and Bound and Dijkstra’s algorithm; and also heuristic and meta-heuristic algorithms. Route optimization issues and problem variations related to vehicle fleets are also addressed, including the Vehicle Routing Problem (VRP), Battery-Constrained Vehicle Routing Problem (BCVRP), and Vehicle Routing Problem with Time Windows (VRPTW). This study concludes that efficient algorithms for solving these problems can have several benefits, including cost reduction, resource optimization, and time efficiency.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Route Optimization Problems and Algorithms for Urban Service Electrical Motorbike Fleets

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Rodrigo Fernandes,
  • Ana Vigário,
  • Beatriz Teixeira,
  • Paula Catarino,
  • Paulo Vasco,
  • Arsénio Reis,
  • Eduardo Solteiro Pires,
  • João Barroso,
  • Tiago Pinto

摘要

Route optimization algorithms are essential to calculate the best routes and solve problems that may arise in logistics services. This study focuses on the problem of route optimization for both single and fleets of electrical motorbikes dedicated to urban services. The paper explores the most relevant and widely-known problems within route optimization, which match the requirements of the specified target problem, e.g., traveling salesman problems. This paper also explores the most widely used algorithms for solving the identified problem variations, namely exact methods such as Branch and Bound and Dijkstra’s algorithm; and also heuristic and meta-heuristic algorithms. Route optimization issues and problem variations related to vehicle fleets are also addressed, including the Vehicle Routing Problem (VRP), Battery-Constrained Vehicle Routing Problem (BCVRP), and Vehicle Routing Problem with Time Windows (VRPTW). This study concludes that efficient algorithms for solving these problems can have several benefits, including cost reduction, resource optimization, and time efficiency.