Heuristics for large constrained vehicle routing problems
From MaRDI portal
Publication:1854901
DOI10.1023/A:1009661600931zbMath1064.90508OpenAlexW1540699063MaRDI QIDQ1854901
Yves Caseau, François Laburthe
Publication date: 1999
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009661600931
Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items (10)
The TV-break packing problem ⋮ An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Active guided evolution strategies for large-scale vehicle routing problems with time windows ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ A unified framework for partial and hybrid search methods in constraint programming ⋮ A cooperative parallel meta-heuristic for the vehicle routing problem with time windows ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows ⋮ On not-first/not-last conditions in disjunctive scheduling
Uses Software
This page was built for publication: Heuristics for large constrained vehicle routing problems
