A bi-level model and memetic algorithm for arc interdiction location-routing problem
Author:
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Link
http://link.springer.com/content/pdf/10.1007/s40314-021-01453-2.pdf
Reference94 articles.
1. Afshari Rad M, Kakhki HT (2013) Maximum dynamic network flow interdiction problem: new formulation and solution procedures. Comput Ind Eng 65(4):531–536
2. Akgün İ, Tansel BÇ, Kevin Wood R (2011) The multi-terminal maximum-flow network-interdiction problem. Eur J Oper Res 211(2):241–251
3. Aksen D, Aras N (2012) A bilevel fixed charge location model for facilities under imminent attack. Comput Oper Res 39(7):1364–1381
4. Aksen D, Şengül Akca S, Aras N (2014) A bilevel partial interdiction problem with capacitated facilities and demand outsourcing. Comput Oper Res 41:346–358
5. Aliakbarian N, Dehghanian F, Salari M (2015) A bi-level programming model for protection of hierarchical facilities under imminent attacks. Comput Oper Res 64:210–224
Cited by 10 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Competing for the Most Profitable Tour: The Orienteering Interdiction Game;2024
2. Locating and deploying essential goods and equipment in disasters using AI-enabled approaches: A systematic literature review;Progress in Disaster Science;2023-10
3. A tri-level optimization model for facility location-protection problem considering design and redesign decisions under disruption;Kybernetes;2023-06-12
4. Multi Objective Optimization Management Model of Dynamic Logistics Network Based on Memetic Algorithm;Cyber Security Intelligence and Analytics;2023
5. Bounded rational real‐time charging pricing strategy under the traffic‐grid coupling network;IET Electrical Systems in Transportation;2022-09-14
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3