Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining
From MaRDI portal
Publication:6070880
DOI10.1111/itor.12774arXiv1908.10705OpenAlexW3004405540MaRDI QIDQ6070880
Isabel Rosseti, Alexandre Plastino, Ítalo Santana
Publication date: 24 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.10705
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid data mining GRASP with path-relinking
- Two improved formulations for the minimum latency problem
- The delivery man problem with time windows
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A new formulation for the traveling deliveryman problem
- Variable neighborhood search
- Making a state-of-the-art heuristic faster with data mining
- A branch-and-price algorithm for the minimum latency problem
- Greedy randomized adaptive search procedures
- A simple and effective metaheuristic for the minimum latency problem
- Variable neighborhood search for the travelling deliveryman problem
- TTT plots: a perl program to create time-to-target plots
- Hybridization of GRASP metaheuristic with data mining techniques
- The minimum latency problem
- The complexity of the travelling repairman problem
- P-Complete Approximation Problems
- The Delivery Man Problem and Cumulative Matroids
- Timing problems and algorithms: Time decisions for sequences of activities
- Time‐dependent traveling salesman problem–the deliveryman case
- A hybrid data mining metaheuristic for the p‐median problem
- The traveling salesman problem with cumulative costs
This page was built for publication: Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining
