Application of a Modified Ant Colony Imitation Algorithm for the Traveling Salesman Problem with Time Windows When Designing an Intelligent Assistant

Kuznetsova, Larisa; Zhigalov, Arthur; Yanishevskaya, Natalia; Parfenov, Denis; Bolodurina, Irina

doi:10.1007/978-3-030-39216-1_31

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Processing time is taken into account. Sniedovich [13] proposed a relationship between DP(dynamic programming ) and DA. Management science and operations research will pay more attention to this.…”

Section: Introductionmentioning

confidence: 99%

A Novel Optimized Travel Planner

Srivastava

Singh

2022

J. Infor. Electr. Electron. Eng.

View full text Add to dashboard Cite

In 1959, Dijkstra announced a method for determining the shortest path between two nodes in a network. This algorithm has received much attention because it can deal with various real-life problems. The algorithm is a greedy type. Other types of algorithms are also created and compared. Application-related changes are made to the original algorithm. The time complexity of the algorithm increases at the expense of space complexity. Space is more complex with modern hardware so you can implement such an algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%