惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

V
Vulnerabilities – Threatpost
P
Proofpoint News Feed
The Hacker News
The Hacker News
Know Your Adversary
Know Your Adversary
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
T
Tenable Blog
AWS News Blog
AWS News Blog
S
Securelist
T
Threatpost
C
Cybersecurity and Infrastructure Security Agency CISA
IT之家
IT之家
腾讯CDC
WordPress大学
WordPress大学
Spread Privacy
Spread Privacy
C
Check Point Blog
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
Engineering at Meta
Engineering at Meta
Latest news
Latest news
A
About on SuperTechFans
The Register - Security
The Register - Security
L
LINUX DO - 热门话题
T
The Exploit Database - CXSecurity.com
C
Cisco Blogs
T
Tailwind CSS Blog
Simon Willison's Weblog
Simon Willison's Weblog
阮一峰的网络日志
阮一峰的网络日志
MyScale Blog
MyScale Blog
大猫的无限游戏
大猫的无限游戏
T
Tor Project blog
L
Lohrmann on Cybersecurity
G
GRAHAM CLULEY
B
Blog RSS Feed
Scott Helme
Scott Helme
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
NISL@THU
NISL@THU
P
Privacy International News Feed
Security Latest
Security Latest
Recorded Future
Recorded Future
L
LangChain Blog
Cyberwarzone
Cyberwarzone
C
Cyber Attacks, Cyber Crime and Cyber Security
C
CXSECURITY Database RSS Feed - CXSecurity.com
博客园 - 聂微东
Google DeepMind News
Google DeepMind News
Last Week in AI
Last Week in AI
Apple Machine Learning Research
Apple Machine Learning Research
F
Fortinet All Blogs
O
OpenAI News
T
Threat Research - Cisco Blogs
Blog — PlanetScale
Blog — PlanetScale

博客园 - 正怒月神

windows 安装 openclaw docker-compose 启动 elk linux mysql 备份 maven 打包时优先选择本地仓库 nginx 部署2个相同的vue minio 设置IP MapStruct-plus cannot find converter from jenkins pipeline 发布 jar并运行 MapperStruct 嵌套模型中 List<> 转 List<String> Easy es问题总结 Logstash docker发布 Docker 无法拉取 springmvc 多事务提交和回滚 springMvc 配置 UReport2 java 通过 microsoft graph 调用outlook(三) JPA Example 默认 join jackson.dataformat.xml 反序列化 对象中包含泛型 解决JIRA、Confluence自动注销登录的问题 java 通过 microsoft graph 调用outlook(二)
OR-TOOL 背包算法
正怒月神 · 2024-04-12 · via 博客园 - 正怒月神

起因:最近公司要发票自动匹配,

比如财务输入10000W块,找到发票中能凑10000的。然后可以快速核销。

废话不多,

一 官方文档

https://developers.google.cn/optimization/pack/knapsack?hl=zh-cn

二 POM文件

        <!--google 算法包-->
        <dependency>
            <groupId>com.google.ortools</groupId>
            <artifactId>ortools-java</artifactId>
            <version>9.9.3963</version>
        </dependency>
        <!--google 算法包-->

三 代码

1 查询业务数据

说明:根据条件查询List<FsBill>,

由于发票金额的匹配,只有一个维度,所以设置values=amount,

capacities是需要匹配的金额大小。

然后调用knapsackSolver_invoice背包核心算法。

    @Override
    public List<FsBill> solverBill(CheckingBill_Req req) {
        List<FsBill> fsBills = findCheckingBill(req);
        //背包算法只支持Long,所以amount*1000转换
        //由于不需要考虑价值因素,所以设置values=amount.这样可以匹配正好的金额。
        long[] values = fsBills.stream().mapToLong(x -> x.getTotalRateAmount().multiply(new BigDecimal(1000)).longValue()).toArray();
        //金额:小数*1000,作整数处理。
        long[][] amount = {values};
        //总金额*1000,作整数处理。
        long[] capacities = {req.getTotalAmount().multiply(new BigDecimal(1000)).longValue()};
        List<Integer> fsBillIndexs = knapsackSolver_invoice(values, amount, capacities);
        List<FsBill> solverBill = new ArrayList<>();
        if (!CollectionUtils.isEmpty(fsBillIndexs)) {
            for (Integer i : fsBillIndexs) {
                solverBill.add(fsBills.get(i));
            }
        }
        return solverBill;
    }

2 背包核心算法

说明:

values:代表物品价值(发票只有一个金额维度,所以values=weights)

weights:物品重量(此处可以传递发票金额amount)

capacities:背包容量

返回的是List<Integer>数组下标,可以对应到List<FsBill>的对象。

@Override
    public List<Integer> knapsackSolver_invoice(long[] values, long[][] weights, long[] capacities) {
        //加载OR-TOOL本地库
        Loader.loadNativeLibraries();
        //开始业务
        System.out.println("=========Begin : 匹配发票");
        KnapsackSolver solver = new KnapsackSolver(
                KnapsackSolver.SolverType.KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER, "test");
 
        solver.init(values, weights, capacities);
        final long computedValue = solver.solve();
 
        ArrayList<Integer> packedItems = new ArrayList<>();
        ArrayList<Long> packedWeights = new ArrayList<>();
        int totalWeight = 0;
        for (int i = 0; i < values.length; i++) {
            if (solver.bestSolutionContains(i)) {
                packedItems.add(i);
                packedWeights.add(weights[0][i]);
                totalWeight = (int) (totalWeight + weights[0][i]);
            }
        }
        //匹配金额
        System.out.println("Target amounts: " + capacities[0]);
        //总价值
        System.out.println("Total values: " + computedValue);
        //总重量
        System.out.println("Total amounts: " + totalWeight);
        //装载项的下标,可对应List<发票>的下标
        System.out.println("Packed items: " + packedItems);
        //装载项的重量
        System.out.println("Packed amounts: " + packedWeights);
        System.out.println("=========End : 匹配发票");
        //如果没有完全匹配金额,则清空packedItems
        if (capacities[0] != totalWeight) {
            packedItems.clear();
        }
        return packedItems;
    }