| Full text | |
| Author(s): |
Maximo, Vinicius R.
;
Cordeau, Jean-Francois
;
Nascimento, Maria C. V.
Total Authors: 3
|
| Document type: | Journal article |
| Source: | INFORMS JOURNAL ON COMPUTING; v. 36, n. 4, p. 13-pg., 2024-07-29. |
| Abstract | |
A recent study on the classical capacitated vehicle routing problem (CVRP) introduced an adaptive version of the widely used iterated local search paradigm, hybridized with a path-relinking (PR) strategy. The solution method, called adaptive iterated local search (AILS)-PR, outperformed existing meta-heuristics for the CVRP on benchmark instances. However, tests on large-scale instances suggest that PR is too slow, making AILS-PR less advantageous in this case. To overcome this challenge, this paper presents an AILS combined with mechanisms to handle large CVRP instances, called AILS-II. The computational cost of this implementation is reduced, whereas the algorithm also searches the solution space more efficiently. AILS-II is very competitive on smaller instances, outperforming the other methods from the literature with respect to the average gap to the best-known solutions. Moreover, AILS-II consistently outperforms the state of the art on larger instances with up to 30,000 vertices. (AU) | |
| FAPESP's process: | 22/05803-3 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings |
| Grantee: | Reinaldo Morabito Neto |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 19/22067-6 - Learning strategies for heuristic search in combinatorial optimization problems |
| Grantee: | Mariá Cristina Vasconcelos Nascimento Rosset |
| Support Opportunities: | Scholarships abroad - Research |
| FAPESP's process: | 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry |
| Grantee: | Francisco Louzada Neto |
| Support Opportunities: | Research Grants - Research, Innovation and Dissemination Centers - RIDC |