Referenced Items are not available for this document.
There are many methods for solving non-differentiable optimization problems, but most of them are too difficult to realize. In this paper, penalty function method is adopted to transform non-differentiable optimization problems to unconstrained differentiable optimization problems. Then, computational experiments are conducted based on the uncertainty analysis of ant colony algorithm (ACA). Numerical results show that ACA can make such a problem simple and easy to calculate.
Published in:
Electronic and Mechanical Engineering and Information Technology (EMEIT), 2011 International Conference on
(Volume:5
)
Date of Conference: 12-14 Aug. 2011
- Page(s):
- 2644 - 2647
- Print ISBN:
- 978-1-61284-087-1
- INSPEC Accession Number:
- 12263278
- Conference Location :
- Harbin, Heilongjiang, China
- Digital Object Identifier :
- 10.1109/EMEIT.2011.6023640
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
