Travelling within Malaysia (West Malaysia)

Real LifeProblem

The following map shows West Malaysia with 12 small countries.

Information

Johor Bahru to Perlis

Nodes: 12 small countries.

Our Network Flow Problem (NFP)

Problem 1

Syarikat perlancongan berpangkalan di Johor menyediakan perkhidmatan

perlancongan kepada pelancong asing. Foreign tourists want to travel around
city in each West Malaysia and tour busses travel only in the direction show in
NFP. The capacities (arcs) indicate the number of bus per hour along each
section (arc). At least one bus per hour must travel along each section of track
(route). A bus can carry 80 passengers. Find the maximum number of
passengers which can flow from A (Johor) to flow B (Perlis). The number of bus
(kalau plural macam mana) in the system must always remain constant.
Suppose we want to flow a maximum amount of passenger (resource) from
the source node (Johor) to the sink node (Perlis). So the following network can
use maximum flow problem.
Decision Variable: Passenger
Objective Value: Maximum passenger
Constraint:
Solver Parameter: Maximise.

Problem 2

Syarikat kita (Alishazzat) is a leding company brand in Malaysia’s

perlancongan industry. They have 12 stesen bas perlancongan in all over West
Malaysia. From that whole 12 stesen bas, let we find the optimal path of their
route using Chinese Post Problem.
With the same network flow problem. The arc will present the distance.