FabianBB
commented
1 year ago A simple and effective metaheuristic for the Minimum Latency Problem
very good stuff
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem file:///C:/Users/fabia/Downloads/s10288-011-0153-0.pdf
Different ILP Formulations
NEW FORMULATIONS FOR THE TRAVELING REPAIRMAN PROBLEM https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=ce26cbfdc85eff1e5ea31d52ff925a4aec42089c
New integer programming formulation for multiple traveling repairmen problem https://www.sciencedirect.com/science/article/pii/S2352146517301771
A New Mathematical Model for the Traveling Repairman Problem https://ieeexplore.ieee.org/abstract/document/8978898
A new formulation for the Traveling Deliveryman Problem https://www.sciencedirect.com/science/article/pii/S0166218X08002163
(Meta)Heuristics
B&B Exact algorithms for the minimum latency problem https://www.sciencedirect.com/science/article/pii/S0020019004002662
A simple and effective metaheuristic for the Minimum Latency Problem https://luizsatoru.github.io/conteudo/artigos/EJOR2012-Marcos.pdf
Approximation Schemes for Minimum Latency Problems https://epubs.siam.org/doi/abs/10.1137/S0097539701399654
A GRASP with iterated local search for the traveling repairman problem with profits https://www.sciencedirect.com/science/article/abs/pii/S0360835217304497
An Efficient Evolutionary Metaheuristic for the Traveling Repairman (Minimum Latency) Problem https://www.atlantis-press.com/journals/ijcis/125941267/view
ONLY FOR COMPARISON A Comparison of Exact and Heuristic Algorithms to Solve the Travelling Salesman Problem https://pearl.plymouth.ac.uk/bitstream/handle/10026.1/14184/TPSS-2018-Vol11n2_53-91Chatting.pdf?isAllowed=y&sequence=1 -> use exact algorithm to find termination time of heuristics
A Comparison of Exact and Heuristic Methods for a Facility Location Problem https://www.researchgate.net/publication/332423085_A_Comparison_of_Exact_and_Heuristic_Methods_for_a_Facility_Location_Problem