A Competitive Bilevel Programming Model for Green, CLSCs in Light of Government Incentives

IF 1.3 4区 数学 Q1 MATHEMATICS Journal of Mathematics Pub Date : 2024-02-23 DOI:10.1155/2024/4866890
Arsalan Rahmani, Meysam Hosseini, Amir Sahami
{"title":"A Competitive Bilevel Programming Model for Green, CLSCs in Light of Government Incentives","authors":"Arsalan Rahmani, Meysam Hosseini, Amir Sahami","doi":"10.1155/2024/4866890","DOIUrl":null,"url":null,"abstract":"The growth of world population has fueled environmental, legal, and social concerns, making governments and companies attempt to mitigate the environmental and social implications stemming from supply chain operations. The state-run Environmental Protection Agency has initially offered financial incentives (subsidies) meant to encourage supply chain managers to use cleaner technologies in order to minimize pollution. In today’s competitive markets, using green technologies remains vital. In the present project, we have examined a class of closed-loop supply chain competitive facility location-routing problems. According to the framework of the competition, one of the players, called the Leader, opens its facilities first. The second player, called the Follower, makes its decision when Leader’s location is known. Afterwards, each customer chooses an open facility based on some preference huff rules before returning the benefits to one of the two companies. The follower, under the influence of the leader’s decisions, performs the best reaction in order to obtain the maximum capture of the market. So, a bilevel mixed-integer linear programming model is formulated. The objective function at both levels includes market capture profit, fixed and operating costs, and financial incentives. A metaheuristic quantum binary particle swarm optimization (PSO) is developed via Benders decomposition algorithm to solve the proposed model. To evaluate the convergence rate and solution quality, the method is applied to some random test instances generated in the literature. The computational results indicate that the proposed method is capable of efficiently solving the model.","PeriodicalId":54214,"journal":{"name":"Journal of Mathematics","volume":"96 1","pages":""},"PeriodicalIF":1.3000,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1155/2024/4866890","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

The growth of world population has fueled environmental, legal, and social concerns, making governments and companies attempt to mitigate the environmental and social implications stemming from supply chain operations. The state-run Environmental Protection Agency has initially offered financial incentives (subsidies) meant to encourage supply chain managers to use cleaner technologies in order to minimize pollution. In today’s competitive markets, using green technologies remains vital. In the present project, we have examined a class of closed-loop supply chain competitive facility location-routing problems. According to the framework of the competition, one of the players, called the Leader, opens its facilities first. The second player, called the Follower, makes its decision when Leader’s location is known. Afterwards, each customer chooses an open facility based on some preference huff rules before returning the benefits to one of the two companies. The follower, under the influence of the leader’s decisions, performs the best reaction in order to obtain the maximum capture of the market. So, a bilevel mixed-integer linear programming model is formulated. The objective function at both levels includes market capture profit, fixed and operating costs, and financial incentives. A metaheuristic quantum binary particle swarm optimization (PSO) is developed via Benders decomposition algorithm to solve the proposed model. To evaluate the convergence rate and solution quality, the method is applied to some random test instances generated in the literature. The computational results indicate that the proposed method is capable of efficiently solving the model.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
从政府激励机制看绿色社区服务中心的竞争性双级编程模型
世界人口的增长加剧了对环境、法律和社会的担忧,使政府和公司试图减轻供应链运营对环境和社会的影响。国家环境保护局(Environmental Protection Agency)最初提供财政奖励(补贴),旨在鼓励供应链管理者使用更清洁的技术,以最大限度地减少污染。在当今竞争激烈的市场中,使用绿色技术仍然至关重要。在本项目中,我们研究了一类闭环供应链竞争性设施选址问题。根据竞争框架,其中一个参与者(称为 "领导者")首先开放其设施。第二个参与者(称为 "跟随者")在知道 "领导者 "的位置后做出决定。之后,每个客户根据一些偏好规则选择一个开放设施,然后将利益返还给两家公司中的一家。追随者在领导者决策的影响下,做出最佳反应,以最大限度地占领市场。因此,制定了一个双层混合整数线性规划模型。两个层次的目标函数都包括市场占领利润、固定成本、运营成本和经济激励。通过 Benders 分解算法开发了一种元启发式量子二元粒子群优化算法(PSO)来求解所提出的模型。为了评估收敛速度和求解质量,该方法被应用于文献中生成的一些随机测试实例。计算结果表明,所提出的方法能够高效地求解模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Mathematics
Journal of Mathematics Mathematics-General Mathematics
CiteScore
2.50
自引率
14.30%
发文量
0
期刊介绍: Journal of Mathematics is a broad scope journal that publishes original research articles as well as review articles on all aspects of both pure and applied mathematics. As well as original research, Journal of Mathematics also publishes focused review articles that assess the state of the art, and identify upcoming challenges and promising solutions for the community.
期刊最新文献
An Unconditionally Stable Numerical Method for Space Tempered Fractional Convection-Diffusion Models On the Exterior Degree of a Finite-Dimensional Lie Algebra Study of Hybrid Problems under Exponential Type Fractional-Order Derivatives Hankel Determinants for the Logarithmic Coefficients of a Subclass of Close-to-Star Functions Characterizing Topologically Dense Injective Acts and Their Monoid Connections
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1