Cart (Loading....) | Create Account
Close category search window

Common issues in discrete optimization and discrete-event simulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jacobson, S.H. ; Dept. of Mech. & Ind. Eng., Illinois Univ., Urbana, IL, USA ; Yucesan, E.

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

Published in:

Automatic Control, IEEE Transactions on  (Volume:47 ,  Issue: 2 )

Date of Publication:

Feb 2002

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.