Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks (Q2061347): Difference between revisions

Latest revision as of 22:16, 16 December 2024

scientific article

Language	Label	Description	Also known as
English	Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks	scientific article

Statements

instance of

scholarly article

0 references

title

Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks (English)

0 references

author

Mohsen Abdolhosseinzadeh

0 references

Mir Mohammad Alipour

0 references

published in

Numerical Algebra, Control and Optimization

0 references

publication date

13 December 2021

0 references

zbMATH Keywords

shortest Hamiltonian path

0 references

constrained shortest path

0 references

ant colony optimization

0 references

grid networks

0 references

design of experiments

0 references

response surface method

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.3934/naco.2020028

0 references

cites work

Q3056948

0 references

The edge Hamiltonian path problem is NP-complete

0 references

A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem

0 references

A stochastic dynamic traveling salesman problem with hard time windows

0 references

The constrained shortest path tour problem

0 references

A Dynamic Programming Approach to Sequencing Problems

0 references

Dual hesitant fuzzy matrix games: based on new similarity measure

0 references

Imperfection with inspection policy and variable demand under trade-credit: a deteriorating inventory model

0 references

The edge Hamiltonian path problem is NP-complete for bipartite graphs

0 references

Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem

0 references

Color Texture Classification Using Shortest Paths in Graphs

0 references

Q4298260

0 references

A two-echelon inventory model with stock-dependent demand and variable holding cost for deteriorating items

0 references

An integrated inventory model with variable holding cost under two levels of trade-credit policy

0 references

Dynamic Programming Treatment of the Travelling Salesman Problem

0 references

Tuning an Algorithm Using Design of Experiments

0 references

An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses

0 references

Problem statements for \(k\)-node shortest path and \(k\)-node shortest cycle in a complete graph

0 references

Running time analysis of ant colony optimization for shortest path problems

0 references

A simple ant colony optimizer for stochastic shortest path problems

0 references

Hybrid metaheuristics for the clustered vehicle routing problem

0 references

A schedule of join operations to reduce I/O cost in spatial database systems

0 references

Identifiers

zbMATH Open document ID

1476.90334

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2061347

@@ Property / DOI @@
-.3934/naco.2020028
@@ Property / DOI: 10.3934/naco.2020028 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.3934/naco.2020028
+Normal rank
@@ Property / OpenAlex ID @@
+W3026801591
@@ Property / OpenAlex ID: W3026801591 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+The edge Hamiltonian path problem is NP-complete
@@ Property / cites work: The edge Hamiltonian path problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A stochastic dynamic traveling salesman problem with hard time windows
+Normal rank
@@ Property / cites work @@
+The constrained shortest path tour problem
@@ Property / cites work: The constrained shortest path tour problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Dual hesitant fuzzy matrix games: based on new similarity measure
+Normal rank
@@ Property / cites work @@
+Imperfection with inspection policy and variable demand under trade-credit: a deteriorating inventory model
+Normal rank
@@ Property / cites work @@
+The edge Hamiltonian path problem is NP-complete for bipartite graphs
+Normal rank
@@ Property / cites work @@
+Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Color Texture Classification Using Shortest Paths in Graphs
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+A two-echelon inventory model with stock-dependent demand and variable holding cost for deteriorating items
+Normal rank
@@ Property / cites work @@
+An integrated inventory model with variable holding cost under two levels of trade-credit policy
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Treatment of the Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Tuning an Algorithm Using Design of Experiments
@@ Property / cites work: Tuning an Algorithm Using Design of Experiments / rank @@
+Normal rank
@@ Property / cites work @@
+An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
+Normal rank
@@ Property / cites work @@
+Problem statements for \(k\)-node shortest path and \(k\)-node shortest cycle in a complete graph
+Normal rank
@@ Property / cites work @@
+Running time analysis of ant colony optimization for shortest path problems
+Normal rank
@@ Property / cites work @@
+A simple ant colony optimizer for stochastic shortest path problems
+Normal rank
@@ Property / cites work @@
+Hybrid metaheuristics for the clustered vehicle routing problem
+Normal rank
@@ Property / cites work @@
+A schedule of join operations to reduce I/O cost in spatial database systems
+Normal rank
@@ Property / DOI @@
+.3934/NACO.2020028
@@ Property / DOI: 10.3934/NACO.2020028 / rank @@
+Normal rank