A proposed algorithm for finding the minimum cost of traveling in the Philippines
We propose an algorithm combining the farthest insertion algorithm and Dijkstra's algorithm. This algorithm is an application of the Traveling Salesman Problem in a graph. The vertices of the graphs are the regions of the Philippines. In each vertex, there are sub-vertices representing the vari...
Saved in:
Main Authors: | Cuevas, Arexis Emmanuelle I., Otero, Zindi Nicole D. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2016
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/14914 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
A proposed algorithm for finding the minimum cost of traveling in the Philippines
by: Cuevas, Arexis Emmanuelle I., et al.
Published: (2016) -
Particle swarm optimization-based algorithms for TSP and generalized TSP
by: Shi, X.H., et al.
Published: (2014) -
Solving traveling salesman problems using generalized chromosome genetic algorithm
by: Yang, J., et al.
Published: (2014) -
Solving traveling salesman problems by genetic algorithms
by: Liang, Y., et al.
Published: (2014) -
A Bidirectional Graph Neural Network for Traveling Salesman Problems on Arbitrary Symmetric Graphs
by: Yujiao Hua, et al.
Published: (2021)