A cash transportation vehicle routing problem with combinations of different cash denominations
From MaRDI portal
Publication:6088203
DOI10.1111/itor.12640WikidataQ128409568 ScholiaQ128409568MaRDI QIDQ6088203
Unnamed Author, W. Y. Szeto, Jun Li, Yan-Feng Li
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
vehicle routing problemrisk managementcash transportationcash denominationscombined hybrid tabu search
Related Items (1)
Cites Work
- 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
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
- A heuristic approach to the overnight security service problem
- The undirected \(m\)-capacitated peripatetic salesman problem
- A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows
- A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector
- The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
- An adaptive memory programming method for risk logistics operations
This page was built for publication: A cash transportation vehicle routing problem with combinations of different cash denominations