no code implementations • 11 Feb 2021 • Davi Mecler, Victor Abu-Marrul, Rafael Martinelli, Arild Hoff
New upper bounds are also provided for some instances within this set.
Optimization and Control
no code implementations • 18 Feb 2018 • Matheus Nohra Haddad, Rafael Martinelli, Thibaut Vidal, Luiz Satoru Ochi, Simone Martins, Marcone Jamilson Freitas Souza, Richard Hartl
The core of the metaheuristic consists of a new large neighborhood search, which reduces the problem of finding the best insertion combination of a pickup and delivery pair into a route (with possible splits) to a resource-constrained shortest path and knapsack problem.
