... solutions **by** swapping parts of a solution with ..."mutated" **by** making a small change to a single element of the ...(GA), **Evolutionary** Programming (EP), **Evolutionary** Strategy (ES), ...

6

... search **algorithm** which provides a **method** of searching which does not need to explore every possible solution in the feasible region to obtain a good ...a **problem** **by** first ’guessing’ solutions ...

6

... efficient **evolutionary** computing techniques that seem to be effective to handle optimization problems in many practical ...(EDE) **algorithm** **by** integrating excited arbitrary confined search (EACS) to ...

5

... Routing **Problem** (VRP) in terms of their objectives, their characteristics and the types of proposed algorithms to solve ...multi-objective **evolutionary** algorithms was proposed **by** Zhou et ...

14

... competitive **algorithm** (ICA) Imperialist competitive **algorithm** (ICA) is a new population-based meta-heuristic **algorithm** proposed **by** Atashpaz-Gargari and Lucas (2007), inspired from the ...

13

... for **solving** a concrete type of **problem**, but they describe general **algorithm** in that, they show only the way, how to apply some procedures to become solution of the ...descriptively, **by** ...

5

... and-bound **algorithm**, named after the work of [20], has become the most commonly used tool for **solving** NP-hard optimization ...branch-and-bound **method** consists of a systematic enumeration of candidate ...

8

... guided **by** the principal of natural genetic system and natural evolution ...applied **by** a GA to a **problem** **by** first ‘guessing’ the possible solutions of the related **problem** and then ...

8

... proposed **by** Nagata and Kobayashi in ...edges **by** applying a greedy **method**, analogous to a minimal spanning ...greedy **method** to merge these distinct sub tours ...

4

... Generalized **Traveling** **Salesman** **Problem** in programming pro- cesses of machines in industries, postal routing and layout of ...Generalized **Traveling** **Salesman** **Problem** and their ...

18

... Abstract—The **Traveling** **Salesman** **Problem** (TSP) is a well known Nondeterministic Polynomial (NP) ...an **alternative** way of **solving** TSP with parallelism **by** modifying Prim’s ...

4

... the **problem** cost structure and includes consideration of repositioning empty ...design **problem** considered **by** Agarwal and Ergun [1] generate multiple services and handles transhipments, a bender’s and ...

4

... Adding new constraints to the master **problem** modifies its structure. For the subproblem to identify new attractive columns for the modified master **problem**, those modifications must be accounted for in the ...

6

... **algorithm**. A set of eligible channels E(k) is determined in order to assign a possible channel upon a new call requests in cell k. In this case E(k) = S – (O(k) P(k)), where S is the entire set of available ...

6

... the **algorithm** considers a growing set of potential exchanges (starting with r = ...Lin-Kernighan **algorithm** belongs to the class of so-called local optimiza- tion algorithms [17, ...The **algorithm** is ...

71

... Knapsack **Problem** (0-1 KP) is a special case of general 0-1 linear **problem** in which the allocation of items to a knapsack is ...knapsack **problem** and proved that the complexity of this **problem** ...

16

... To remove or reduce noise and effects from other unexpected sources and further enhance signal components of interest, a reconstruction approach is used to filter and assemble the frequency components to reconstruct ...

9

... The aim of this article is to perform a computational study to analyze the impact of formulations, and the solution strategy on the algorithmic performance of two clas- sical optimization problems: the **traveling** ...

12

... Optimization problems with or without constraints arise in various fields such as science, engineering, economics, management sciences, etc., where numerical information is processed. In recent times, many problems in ...

12

... in **algorithm** later, we consider the vertex first which come in the matrix notation ...the **algorithm** complexity **by** adding the logic, to start the tour from the vertex which has out-degree is ...the ...

5