论文标题

用于分布式采购问题的数学谈判机制和解决方案的混合算法

A Mathematical Negotiation Mechanism for Distributed Procurement Problems and a Hybrid Algorithm for its Solution

论文作者

Kaheh, Zohreh, Kazemzadeh, Reza Baradaran, Masehian, Ellips, Kashan, Ali Husseinzadeh

论文摘要

在本文中,一种数学谈判机制旨在最大程度地减少在汽车供应链的两个梯队的分布式采购问题中的谈判者成本。买方的成本是一项周期合同中的采购成本和短缺罚款。另一方面,供应商打算解决多期的多产品生产计划,以最大程度地降低其成本。这种机制提供了供应商的生产计划和订单分配之间的一致性,还通过考虑供应商的能力来支持与有价值供应商的合作伙伴关系。这种情况是通过双级编程建模的,在该计划中,买方担任领导者,供应商单独出现在较低层次的追随者。为了解决这种非线性双级编程模型,提出了基于搜索的启发式算法,通过将粒子群优化(PSO)算法结合使用粒子群优化(PSO)算法。根据PSO系统粒子(买方的报价请求(RFQ))确定的每个供应商(RFQ)确定的可变值(RFQ)确定的可变值(RFQS),将启发式A算法嵌入以求解每个供应商的混合企业非线性编程(MINLP)子问题。计算分析表明,所提出的称为PSO-A-A的混合算法优于PSO-SA和PSO-Greedy算法。

In this paper, a mathematical negotiation mechanism is designed to minimize the negotiators' costs in a distributed procurement problem at two echelons of an automotive supply chain. The buyer's costs are procurement cost and shortage penalty in a one-period contract. On the other hand, the suppliers intend to solve a multi-period, multi-product production planning to minimize their costs. Such a mechanism provides an alignment among suppliers' production planning and order allocation, also supports the partnership with the valued suppliers by taking suppliers' capacities into account. Such a circumstance has been modeled via bi-level programming, in which the buyer acts as a leader, and the suppliers individually appear as followers in the lower level. To solve this nonlinear bi-level programming model, a hybrid algorithm by combining the particle swarm optimization (PSO) algorithm with a heuristic algorithm based on A search is proposed. The heuristic A algorithm is embedded to solve the mixed-integer nonlinear programming (MINLP) sub-problems for each supplier according to the received variable values determined by PSO system particles (buyer's request for quotations (RFQs)). The computational analyses have shown that the proposed hybrid algorithm called PSO-A outperforms PSO-SA and PSO-Greedy algorithms.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源