Finding the shortest pick-up route problem of a bus service
The study involves the problem of finding the optimal route of a school bus service. The travelling salesman problem in graph theory was considered in the solution of the problem and hamiltonian cycles starting from the school to each of the student's house and back were sought. A computer prog...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1991
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/15942 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-16455 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-164552022-01-23T15:07:32Z Finding the shortest pick-up route problem of a bus service Acasio, Anne Marie P. See, Daisy C. The study involves the problem of finding the optimal route of a school bus service. The travelling salesman problem in graph theory was considered in the solution of the problem and hamiltonian cycles starting from the school to each of the student's house and back were sought. A computer program was developed to determine this path based on a working algorithm. Factors such as time and mileage were also considered to come up with the recommended economical routes. 1991-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/15942 Bachelor's Theses English Animo Repository Route surveying Bus lines Graph theory Problem solving |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Route surveying Bus lines Graph theory Problem solving |
| spellingShingle |
Route surveying Bus lines Graph theory Problem solving Acasio, Anne Marie P. See, Daisy C. Finding the shortest pick-up route problem of a bus service |
| description |
The study involves the problem of finding the optimal route of a school bus service. The travelling salesman problem in graph theory was considered in the solution of the problem and hamiltonian cycles starting from the school to each of the student's house and back were sought. A computer program was developed to determine this path based on a working algorithm. Factors such as time and mileage were also considered to come up with the recommended economical routes. |
| format |
text |
| author |
Acasio, Anne Marie P. See, Daisy C. |
| author_facet |
Acasio, Anne Marie P. See, Daisy C. |
| author_sort |
Acasio, Anne Marie P. |
| title |
Finding the shortest pick-up route problem of a bus service |
| title_short |
Finding the shortest pick-up route problem of a bus service |
| title_full |
Finding the shortest pick-up route problem of a bus service |
| title_fullStr |
Finding the shortest pick-up route problem of a bus service |
| title_full_unstemmed |
Finding the shortest pick-up route problem of a bus service |
| title_sort |
finding the shortest pick-up route problem of a bus service |
| publisher |
Animo Repository |
| publishDate |
1991 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/15942 |
| _version_ |
1772834940355870720 |