Learning Hybrid Algorithms for Vehicle Routing Problems
| dc.creator | Caseau, Yves | |
| dc.creator | Silverstein, Glenn | |
| dc.creator | Laburthe, Francois | |
| dc.date | 2004-05-24 | |
| dc.date.accessioned | 2026-07-07T03:21:21Z | |
| dc.date.available | 2026-07-07T03:21:21Z | |
| dc.description | This paper presents a generic technique for improving hybrid algorithms through the discovery of and tuning of meta-heuristics. The idea is to represent a family of push/pull heuristics that are based upon inserting and removing tasks in a current solution, with an algebra. We then let a learning algorithm search for the best possible algebraic term, which represents a hybrid algorithm for a given set of problems and an optimization criterion. In a previous paper, we described this algebra in detail and provided a set of preliminary results demonstrating the utility of this approach, using vehicle routing with time windows (VRPTW) as a domain example. In this paper we expand upon our results providing a more robust experimental framework and learning algorithms, and report on some new results using the standard Solomon benchmarks. In particular, we show that our learning algorithm is able to achieve results similar to the best-published algorithms using only a fraction of the CPU time. We also show that the automatic tuning of the best hybrid combination of such techniques yields a better solution than hand tuning, with considerably less effort. | |
| dc.description | Appeared in Theory and Practice of Logic Programming, vol. 1, no. 6, 2001 | |
| dc.identifier | https://arxiv.org/abs/cs/0405092 | |
| dc.identifier | http://arxiv.org/abs/cs/0405092 | |
| dc.identifier | Theory and Practice of Logic Programming, vol. 1, no. 6, 2001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32162 | |
| dc.subject | Programming Languages | |
| dc.subject | D.1.6; D.3.2 | |
| dc.title | Learning Hybrid Algorithms for Vehicle Routing Problems | |
| dc.type | text |