A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector
From MaRDI portal
Publication:2968486
DOI10.1111/itor.12214zbMath1358.90130OpenAlexW2215964832MaRDI QIDQ2968486
Kenneth Sörensen, Johan Springael, Luca Talarico
Publication date: 16 March 2017
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12214
Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
The secure time-dependent vehicle routing problem with uncertain demands ⋮ Safe and secure vehicle routing: a survey on minimization of risk exposure ⋮ A cash transportation vehicle routing problem with combinations of different cash denominations ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ Bi-objective overlapped links vehicle routing problem for risk minimizing valuables transportation ⋮ Vehicle routing with arrival time diversification ⋮ A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty
Uses Software
Cites Work
- Unnamed Item
- 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
- A GRASP for a difficult single machine scheduling problem
- A heuristic approach to the overnight security service problem
- Multiple criteria decision analysis. State of the art surveys
- Bi-objective stochastic programming models for determining depot locations in disaster relief operations
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- On multiobjective combinatorial optimization and dynamic interim hedging of efficient portfolios
- Enhanced genetic algorithms for a bi‐objective bus driver rostering problem: a computational study
- Variable neighborhood search: Principles and applications
This page was built for publication: A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector