A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
DOI10.1016/j.cor.2016.04.003zbMath1391.90092OpenAlexW2254600013MaRDI QIDQ1652128
Luca Talarico, Johan Springael, Fabio Talarico, Kenneth Sörensen
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/10067/1223790151162165141
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (8)
Uses Software
Cites Work
- Unnamed Item
- The \(k\)-dissimilar vehicle routing problem
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
- Finding minimum and equitable risk routes for hazmat shipments
- Routing of a hazmat truck in the presence of weather systems
- A GRASP for a difficult single machine scheduling problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A heuristic approach to the overnight security service problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Record breaking optimization results using the ruin and recreate principle
- On the Theory of Dynamic Programming—A Warehousing Problem
This page was built for publication: A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem