D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm.
Poria PirozmandAli Asghar Rahmani HosseinabadiMaedeh Jabbari ChariFaezeh PahlavanSeyedsaeid MirkamaliGerhard-Wilhelm WeberSummera NosheenAjith AbrahamPublished in: IEEE Access (2023)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- metaheuristic
- ant colony optimization
- simulated annealing
- harmony search
- cost function
- combinatorial optimization problems
- optimization problems
- dynamic programming
- optimal solution
- variable neighborhood search
- minimum spanning tree
- aco algorithm
- memetic algorithm
- benchmark instances
- path relinking
- vehicle routing problem
- hybrid algorithm
- combinatorial problems
- tabu search
- branch and bound
- objective function
- search space
- optimization algorithm
- branch and bound algorithm
- particle swarm optimization
- ant colony algorithm
- exact algorithms
- heuristic methods
- energy function
- search procedure
- np hard
- genetic algorithm
- benchmark problems
- quadratic assignment problem
- greedy randomized adaptive search procedure
- hill climbing
- traveling salesman
- ant colony optimization algorithm
- scatter search
- beam search
- max min
- evolutionary algorithm
- multi objective
- computational complexity
- knapsack problem
- swarm intelligence
- job shop scheduling problem