.png){kind=icon}
返回
Common issues in discrete optimization and discrete-event simulation
.png){kind=icon}
PRE
AI
DOI：10.1109/9.983377.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This note studies and exploits common issues between discrete-event simulation models and algorithms for discrete optimization problems to prove that two discrete-event simulation search problems are NP-hard. More specifically, NEIGHBORHOOD, seeks a sequence of events such that two distinct states can be accessed, one state after executing all but the last k events and another state after executing all the events, while INITIALIZE seeks a sequence of events such that executing the sequence with one particular initial event results in a particular state being reached, while for a second initial event, that particular state cannot be reached. Implications of these results for discrete-event simulation modeling and analysis (e.g., assessing when steady state, termination conditions have been reached, or optimal input parameters values for simulation optimization have been established) as well as for discrete optimization problems (e.g., assessing a priori the effectiveness of a neighborhood for simulated annealing or tabu search) are discussed.
Keyword:
computational complexity
discrete-event simulation
discrete optimization
NP-hard
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
暂无机构信息
引用论文
Investigation of morphologies and characterization of rare earth metal samarium hexacyanoferrate and its composite with surfactant intercalated graphene oxide for sensor applications.png)
RSC Adv.
RSC Adv.IF0
PREAI
分享收藏
分享收藏分享收藏Protecting effect of Cistanche extracts on MPP+-induced injury of the Parkinson's disease cell model
PREAI
分享收藏
查看更多内容