Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
type: Item
instance of: scholarly article
title: Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
zbMATH Open document ID: 1476.90334
author: Mohsen Abdolhosseinzadeh
author: M. M. Alipour
published in: Numerical Algebra, Control and Optimization
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 62K20
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 7443600
zbMATH Keywords: shortest Hamiltonian path
zbMATH Keywords: constrained shortest path
zbMATH Keywords: ant colony optimization
zbMATH Keywords: grid networks
zbMATH Keywords: design of experiments
zbMATH Keywords: response surface method
MaRDI profile type: Publication
full work available at URL: naco.2020028
OpenAlex ID: W3026801591
cites work: Q3056948
cites work: The edge Hamiltonian path problem is NP-complete
cites work: A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
cites work: A stochastic dynamic traveling salesman problem with hard time windows
cites work: The constrained shortest path tour problem
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: Dual hesitant fuzzy matrix games: based on new similarity measure
cites work: Imperfection with inspection policy and variable demand under trade-credit: a deteriorating inventory model
cites work: The edge Hamiltonian path problem is NP-complete for bipartite graphs
cites work: Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
cites work: Color Texture Classification Using Shortest Paths in Graphs
cites work: Q4298260
cites work: A two-echelon inventory model with stock-dependent demand and variable holding cost for deteriorating items
cites work: An integrated inventory model with variable holding cost under two levels of trade-credit policy
cites work: Dynamic Programming Treatment of the Travelling Salesman Problem
cites work: Tuning an Algorithm Using Design of Experiments
cites work: An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
cites work: Problem statements for \(k\)-node shortest path and \(k\)-node shortest cycle in a complete graph
cites work: Running time analysis of ant colony optimization for shortest path problems
cites work: A simple ant colony optimizer for stochastic shortest path problems
cites work: Hybrid metaheuristics for the clustered vehicle routing problem
cites work: A schedule of join operations to reduce I/O cost in spatial database systems
DOI: 10.3934/NACO.2020028
description: scientific article; zbMATH DE number 7443600