ILP-Genetic-and-Exhaustive-Solutions-to-the-ATM-Cash-Replenishment-Optimization-Problem
索引说明：本页内容为本站爬虫自动索引的第三方平台公开页面元信息，本平台不存储、不缓存任何资源文件。点击下方按钮将跳转至第三方网站平台访问，访问第三方资源链接需要 VIP 权限。
资源简介
The ATM Cash Replenishment Optimization problem is a well known problem for the banking industry. Banks want to keep their ATM’s loaded at all times, while minimizing the amount of idle cash that is in an ATM, since they can not make any interest money out of idle cash. However, loading itself also has a cost due to factors like transportation and security. This proposes an interesting game theoretic situation, where we have two conflicting costs that we want to optimize. We want to load an ATM as frequently as possible to minimize the interest loss while at the same time we want to load as seldom as possible to minimize the loading cost.
- 资源类型
- 软件
- 第三方域名
- github.com
- 索引时间
- 2026-08-04 05:25
开通 VIP 后访问第三方资源
访问第三方资源链接需要 VIP 权限。注册与搜索永久免费，VIP 仅用于访问第三方链接。