Optimal Path Searching through Specified Routes using different Algorithms
To connect different electrical, network and data devices with the minimum cost and shortest path, is a complex job. In huge buildings, where the devices are placed at different locations on different floors and only some specific routes are available to pass the cables and buses, the shortest path...
Main Author: | Farooq, Farhan |
---|---|
Format: | Others |
Language: | English |
Published: |
Högskolan Dalarna, Datateknik
2009
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:du-4530 |
Similar Items
-
Model Penentuan Rute Terpendek Penjemputan Sampah Menggunakan Metode MTSP dan Algoritma Genetika
by: Aswandi, et al.
Published: (2021-06-01) -
Dynamic Shortest Paths Methods for the Time-Dependent TSP
by: Christoph Hansknecht, et al.
Published: (2021-01-01) -
Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem
by: Mohammed Zia, et al.
Published: (2018-03-01) -
A Multi-Stage Metaheuristic Algorithm for Shortest Simple Path Problem With Must-Pass Nodes
by: Zhouxing Su, et al.
Published: (2019-01-01) -
Land Leveling Using Optimal Earthmoving Vehicle Routing
by: McInvale, Howard D.
Published: (2014)