Rafael Martinelli

Orcid: 0000-0001-5715-149X

According to our database1, Rafael Martinelli authored at least 21 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Electric Vehicle Fleets: Scalable Route and Recharge Scheduling Through Column Generation.
Transp. Sci., May, 2023

Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem.
Transp. Sci., March, 2023

Simheuristic algorithm for a stochastic parallel machine scheduling problem with periodic re-planning assessment.
Ann. Oper. Res., 2023

2022
Iterated greedy algorithms for a complex parallel machine scheduling problem.
Eur. J. Oper. Res., 2022

Solving a School Bus Routing Problem in Rural Areas: An Application in Brazil.
Proceedings of the Computational Logistics - 13th International Conference, 2022

2021
Arc Routing with Time-Dependent Travel Times and Paths.
Transp. Sci., 2021

Scheduling pipe laying support vessels with non-anticipatory family setup times and intersections between sets of operations.
Int. J. Prod. Res., 2021

Efficient labeling algorithms for adjacent quadratic shortest paths.
CoRR, 2021

Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: Application in the offshore oil and gas industry.
Comput. Oper. Res., 2021

A Hybrid VNS for the Multi-product Maritime Inventory Routing Problem.
Proceedings of the Variable Neighborhood Search - 8th International Conference, 2021

Solving a Real-Life Tramp Ship Routing and Scheduling Problem with Speed Profiles.
Proceedings of the Computational Logistics - 12th International Conference, 2021

2020
Industrial and tramp ship routing problems: Closing the gap for real-scale instances.
Eur. J. Oper. Res., 2020

An Efficient Matheuristic for the Inventory Routing Problem.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2018
The minimum distance superset problem: formulations and algorithms.
J. Glob. Optim., 2018

Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads.
Eur. J. Oper. Res., 2018

The vehicle routing problem with service level constraints.
Eur. J. Oper. Res., 2018

2015
Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure.
INFORMS J. Comput., 2015

2014
Efficient elementary and restricted non-elementary route pricing.
Eur. J. Oper. Res., 2014

A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints.
Discret. Optim., 2014

2013
Improved bounds for large scale capacitated arc routing problem.
Comput. Oper. Res., 2013

2011
A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011


  Loading...