Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Martinelli, Rafael"'
Publikováno v:
In European Journal of Operational Research 16 February 2025 321(1):75-87
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 includes the impact of consecutive arcs. We provide a formal descript
Externí odkaz:
http://arxiv.org/abs/2112.04045
Neighborhood search is a cornerstone of state-of-the-art traveling salesman and vehicle routing metaheuristics. While neighborhood exploration procedures are well developed for problems with individual services, their counterparts for one-to-one pick
Externí odkaz:
http://arxiv.org/abs/2107.05189
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 transportation requests still represents a major challenge. This is due to th
Externí odkaz:
http://arxiv.org/abs/2104.03823
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 held at the beginning of each batch, defined by the combination of one se
Externí odkaz:
http://arxiv.org/abs/2102.06007
In this paper, we address a variant of a batch scheduling problem with identical parallel machines and non-anticipatory family setup times to minimize the total weighted completion time. We developed an ILS and a GRASP matheuristics to solve the prob
Externí odkaz:
http://arxiv.org/abs/2010.15059
Vehicle routing algorithms usually reformulate the road network into a complete graph in which each arc represents the shortest path between two locations. Studies on time-dependent routing followed this model and therefore defined the speed function
Externí odkaz:
http://arxiv.org/abs/2004.14473
Publikováno v:
In Journal of Energy Storage 25 December 2023 74 Part B
Recent studies in maritime logistics have introduced a general ship routing problem and a benchmark suite based on real shipping segments, considering pickups and deliveries, cargo selection, ship-dependent starting locations, travel times and costs,
Externí odkaz:
http://arxiv.org/abs/1809.10584
Autor:
Haddad, Matheus Nohra, Martinelli, Rafael, Vidal, Thibaut, Ochi, Luiz Satoru, Martins, Simone, Souza, Marcone Jamilson Freitas, Hartl, Richard
We consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike-sharing systems and inventory re-balancing. This problem is notorious
Externí odkaz:
http://arxiv.org/abs/1802.06318