A New Genetic Algorithm for Time Dependent Combinatorial Optimization Problem
- 22 March 2016
- journal article
- research article
- Published by Springer Nature in National Academy Science Letters
- Vol. 39 (3) , 207-211
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A new optimization method: Big Bang–Big CrunchAdvances in Engineering Software, 2006
- Ant Colony Optimization2004
- Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem2004
- Handbook of Metaheuristics2003
- Ant colonies for the travelling salesman problemBioSystems, 1997