1 citations · 1 across the 2 of their papers we have counts for
4 papers · 2 filters
Efficient labeling algorithms for adjacent quadratic shortest paths
João Vilela, Bruno Fanzeres, Rafael Martinelli +1
In this article, we study the Adjacent Quadratic Shortest Path Problem (AQSPP), which consists in finding the shortest path on a directed graph when its total weight component also…
Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem
Toni Pacheco, Rafael Martinelli, Anand Subramanian +2
Neighborhood search is a cornerstone of state-of-the-art traveling salesman and vehicle routing metaheuristics. While neighborhood exploration procedures are well developed for pro…
Electric Vehicle Fleets: Scalable Route and Recharge Scheduling through Column Generation
Axel Parmentier, Rafael Martinelli, Thibaut Vidal
The rise of battery-powered vehicles has led to many new technical and methodological hurdles. Among these, the efficient planning of an electric fleet to fulfill passenger transpo…
Iterated Greedy Algorithms for a Complex Parallel Machine Scheduling Problem
Davi Mecler, Victor Abu-Marrul, Rafael Martinelli +1
This paper addresses a complex parallel machine scheduling problem with jobs divided into operations and operations grouped in families. Non-anticipatory family setup times are hel…