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 |
| Summary: | 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. |
|---|