Papers for

fleet managers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Electric vehicle routing cuts emissions by shifting charge times

Carbon-Aware Electric Vehicle Routing Problem with Decision-Focused Learning

Abstract: Electric vehicles produce no tailpipe emissions, but charging them produces emissions that depend on the time-varying generation mix of the electricity consumed. We study an Electric Vehicle Routing Problem with a carbon-aware objective that accounts for charging-related emissions alongside conventional routing costs. The problem determines routing, charging, and waiting decisions, allowing charging demand to be shifted toward periods with lower grid carbon intensity. Because these decisions depend on forecasts of future carbon intensity, we propose a decision-focused learning approach so that the training of the model employed for predicting the carbon intensity of the grid over time is solver-aware. In particular, we train a linear predictor using approximate SPO+ directions and employ a time-limited Large Neighborhood Search followed by exact postprocessing as the underlying solver. Experiments on realistic Germany-based instances show that explicitly considering charging-related emissions reduces realized emissions by 28.76% on average relative to carbon-blind optimization, although at the expense of higher non-carbon operating cost. Moreover, decision-focused training reduces realized total cost by 2.30% on average relative to conventional prediction-focused learning and performs better on 75.5% of the test instances, despite substantially lower pointwise predictive accuracy. Finally, we show that its average advantage remains positive across varied solver configurations and carbon-cost weights.

Thu 29 OctMachine Learning
The gist
Electric vehicles don’t emit pollution while driving, but how clean their charging is depends on the energy mix powering the grid. The authors study how to plan routes and charging times for electric vehicles to reduce the carbon emissions from electricity production by charging when cleaner energy is available. They develop a special way to train prediction models that focus on helping these routing decisions rather than just making the most accurate forecasts. Their experiments on German data show that this approach reduces emissions by nearly 29% compared to ignoring carbon emissions. They also show their method leads to more cost-efficient routes than standard prediction models, even though the predicted carbon levels are less accurate.
Open → 2610.39645v1

Parallel genetic algorithm improves loading of three dimensional trailers

An Island-Based Parallel Biased Random-Key Genetic Algorithm for the Three-Dimensional Trailer Loading Problem

Abstract: The Three-Dimensional Trailer Loading Problem (3D-TLP) involves determining the optimal placement and orientation of heterogeneous items within the confined space of a trailer while maximizing volume utilization and satisfying a wide range of complex logistical and safety constraints. The 3D-TLP is NP-hard, rendering exact optimization approaches computationally impractical for large-scale industrial applications. To address this challenge, we propose an enhanced Biased Random-Key Genetic Algorithm (BRKGA) accelerated through a novel island-based parallelization framework, PANGEA. The proposed method combines the search efficiency and robustness of BRKGA with a multi-population evolutionary scheme for genetic algorithms. This island-model strategy promotes population diversity, mitigates premature convergence, and significantly reduces computational times. The proposed solution was validated in a real trailer loading process, providing an effective solution approach for real-world large-scale logistics.

Wed 30 SeptNeural and Evolutionary ComputingDistributed, Parallel, and Cluster Computing
The gist
Fitting many different-sized items efficiently into a trailer is really complicated and takes a lot of computer time to solve perfectly. The authors worked on this packing problem and created a new way to speed up the process using a type of genetic algorithm that runs many searches in parallel, sharing information to avoid getting stuck with bad solutions. They tested their approach in a real trailer loading scenario and showed it can find good arrangements faster. This method helps logistics teams pack trailers better while respecting safety and space rules.
Open → 2609.39272v1