Related papers: Optimal routing algorithm for trips involving thou…
The electric vehicle routing problem (EVRP) has garnered great interest from researchers and industrialists in an attempt to move from fuel-based vehicles to healthier and more efficient electric vehicles (EVs). While it seems that the EVRP…
The advent of vehicle autonomy, connectivity and electric powertrains is expected to enable the deployment of Autonomous Mobility-on-Demand systems. Crucially, the routing and charging activities of these fleets are impacted by the design…
Deep learning-based methods are growing prominence for planning purposes. In this paper, we present a hybrid planner that combines a graph machine learning model and an optimal solver based on branch and bound tree search for path-planning…
This paper addresses the on-demand meeting-point-based feeder electric bus routing and charging scheduling problem under charging synchronization constraints. The problem considered exhibits the structure of the location routing problem,…
An approach for mapping an electric vehicle EV driver s travel time constraints and risk taking behavior to real time routing in a probabilistic time-dependent or stochastic network is proposed in this paper. The proposed approach is based…
The shift towards electric vehicles (EVs) is crucial for establishing sustainable and low-emission urban transportation systems. However, the success of this transition depends on the strategic placement of the charging infrastructure. This…
With the growing electric vehicles (EVs) charging demand, urban planners face the challenges of providing charging infrastructure at optimal locations. For example, range anxiety during long-distance travel and the inadequate distribution…
Path finding is a well-studied problem in AI, which is often framed as graph search. Any-angle path finding is a technique that augments the initial graph with additional edges to build shorter paths to the goal. Indeed, optimal algorithms…
Electric vehicles (EVs) are increasingly used in transportation. Worldwide use of EVs, for their limited battery capacity, calls for effective planning of EVs charging stations to enhance the efficiency of using EVs. This paper provides a…
Problem definition: Motivated by global electrification targets and the advent of electric modular autonomous units (E-MAUs), this paper addresses a robust charging station location and routing-scheduling problem (E-RCRSP) in an inter-modal…
Realistic path planning applications often require optimizing with respect to several criteria simultaneously. Here we introduce an efficient algorithm for bi-criteria path planning on graphs. Our approach is based on augmenting the state…
As the global focus on combating environmental pollution intensifies, the transition to sustainable energy sources, particularly in the form of electric vehicles (EVs), has become paramount. This paper addresses the pressing need for Smart…
This paper deals with the problem of finding a collection of vertex-disjoint paths in a given graph G=(V,E) such that each path has at least four vertices and the total number of vertices in these paths is maximized. The problem is NP-hard…
Given a public transportation network, which and how many passenger routes can potentially be shortest paths, when all possible timetables are taken into account? This question leads to shortest path problems on graphs with interval costs…
With the rapid growth in the demand for plug-in electric vehicles (EVs), the corresponding charging infrastructures are expanding. These charging stations are located at various places and with different congestion levels. EV drivers face…
Drive modes are driver-selectable pre-set configurations of powertrain and certain vehicle parameters. Plug-in hybrid electric vehicles (PHEVs) typically feature special options of drive modes that can affect the hybrid energy source…
Combinatorial optimization algorithms for graph problems are usually designed afresh for each new problem with careful attention by an expert to the problem structure. In this work, we develop a new framework to solve any combinatorial…
The adoption of electric vehicles (EVs) represents a critical shift in personal mobility, fueled by policy support and advancements in automotive technology. However, the expansion of EVs for long-distance travel is hindered by charging…
The Dijkstra algorithm is a classic path planning method, which in a discrete graph space, can start from a specified source node and find the shortest path between the source node and all other nodes in the graph. However, to the best of…
With growing interest in sustainable logistics, electric vehicle (EV)-based deliveries offer a promising alternative for urban distribution. However, EVs face challenges due to their limited battery capacity, requiring careful planning for…