Text
Penyelesaian Chinese Postman problem berarah menggunakan metode Northwest Corner Rule dan MODI
Chinese Postman Problem is a problem where a staff of post-office (postman), a
driver, a policeman, etc. is responsible to do their tasks along each block on the route.
They start from a fixed node where the central office is located and must make the rounds
of all the streets in their part of the city at least once during their working day, then they
return to the centred office at the end of the day (Eulerian Circuit). The objectives of
Chinese Postman Problem i"' to find the shortest path from the graph given, where each
intersection denotes as node and the road which connect two intersection denotes as
edge. The problem will represented by a directed graph. North- West Corner Rule method
and Modified Distribution method will used to solve the problem of directed graph.
Keyword: Chinese Postman Problem, North-West Corner Rule method, Modified
Distribution method
Barcode | Tipe Koleksi | Nomor Panggil | Lokasi | Status | |
---|---|---|---|---|---|
127611 | R/DIG - FTIS | Makalah | 511.5 PAD p | Gdg9-Lt3 (KTI/MAKALAH) | Tersedia namun tidak untuk dipinjamkan - No Loan |
Tidak tersedia versi lain