Discrete state transition algorithm for unconstrained integer optimization problems
Authors:
- Xiaojun ZhouXZXiaojun Zhou
- David Yang GaoDGDavid Yang Gao
- Chunhua YangCYChunhua Yang
- Weihua GuiWGWeihua Gui
- 1 January 2016
- journal article
- Published by Elsevier in Neurocomputing
- Vol. 173, 864-874
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- China National Funds for Distinguished Young Scientists (61025015)
- Foundation for Innovative Research Groups of the National Natural Science Foundation of China (61321003)
- National Natural Science Foundation of China (61533020)
- National Natural Science Foundation of China (61533021)
- National Natural Science Foundation of China (61503416)
This publication has 22 references indexed in Scilit:
- Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy searchApplied Soft Computing, 2011
- A real coded genetic algorithm for solving integer and mixed integer optimization problemsApplied Mathematics and Computation, 2009
- A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut ProblemComputational Optimization and Applications, 2006
- Developments in linear and integer programmingJournal of the Operational Research Society, 2002
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- Genetic algorithm crossover operators for ordering applicationsComputers & Operations Research, 1995
- TSPLIB—A Traveling Salesman Problem LibraryINFORMS Journal on Computing, 1991
- Cooling Schedules for Optimal AnnealingMathematics of Operations Research, 1988
- Optimization by Simulated AnnealingScience, 1983
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953