Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
DOI10.3934/naco.2020028zbMath1476.90334OpenAlexW3026801591MaRDI QIDQ2061347
Mohsen Abdolhosseinzadeh, Mir Mohammad Alipour
Publication date: 13 December 2021
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2020028
design of experimentsant colony optimizationconstrained shortest pathresponse surface methodgrid networksshortest Hamiltonian path
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Response surface designs (62K20)
Cites Work
- Unnamed Item
- Unnamed Item
- Problem statements for \(k\)-node shortest path and \(k\)-node shortest cycle in a complete graph
- Hybrid metaheuristics for the clustered vehicle routing problem
- The constrained shortest path tour problem
- Running time analysis of ant colony optimization for shortest path problems
- A two-echelon inventory model with stock-dependent demand and variable holding cost for deteriorating items
- Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- A stochastic dynamic traveling salesman problem with hard time windows
- The edge Hamiltonian path problem is NP-complete
- The edge Hamiltonian path problem is NP-complete for bipartite graphs
- An integrated inventory model with variable holding cost under two levels of trade-credit policy
- An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
- A simple ant colony optimizer for stochastic shortest path problems
- Imperfection with inspection policy and variable demand under trade-credit: a deteriorating inventory model
- Dual hesitant fuzzy matrix games: based on new similarity measure
- Tuning an Algorithm Using Design of Experiments
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- A schedule of join operations to reduce I/O cost in spatial database systems
- Color Texture Classification Using Shortest Paths in Graphs
This page was built for publication: Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
