#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2001

2019

- This year (2)
- Last 5 years (15)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

Since crossover operator plays a vital role in genetic algorithms (GAs), several crossover operators have been proposed for the travelling salesman problem, which are then modified for the quadratic… (More)

- Zakir Hussain Ahmed, zhahmed
- 2010

The bottleneck traveling salesman problem (BTSP) is a variation of the well-known traveling salesman problem in which the objective is to minimize the maximum lap (arc length) in a tour of the… (More)

Instead of using traditional (two-parent) crossover operator, multi-parent crossover operator is used in genetic algorithms to improve solution quality for many numerical optimization problems.… (More)

- Zakir Hussain Ahmed
- TheScientificWorldJournal
- 2014

The ordered clustered travelling salesman problem is a variation of the usual travelling salesman problem in which a set of vertices (except the starting vertex) of the network is divided into some… (More)

- Zakir Hussain Ahmed
- ACM Trans. Embedded Comput. Syst.
- 2013

The bottleneck traveling salesman problem is to find a Hamiltonian circuit that minimizes the largest cost of any of its arcs in a graph. A simple genetic algorithm (GA) using sequential constructive… (More)

- Zakir Hussain Ahmed
- 38th International Conference on…
- 2015

The quadratic assignment problem (QAP) is a NP-hard combinatorial optimization problem. Genetic algorithm (GA) is one of the best algorithms to deal with such difficult problems. This paper presents… (More)

AbstractLexisearch and genetic algorithms are two different types of methods for solving combinatorial optimization problems. Lexisearch algorithm gives us exact optimal solution, whereas, genetic… (More)