Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
2 views

NetworkFlowExercise

The document contains exercises focused on network flow problems, including shortest path and maximum flow problems using Dijkstra's algorithm and augmenting path algorithm. It also involves formulating these problems as integer programming problems and applying them to real-world scenarios such as production line inspections and job scheduling on parallel machines. Each exercise requires specific problem-solving techniques and implementations using ZIMPL and SCIP.

Uploaded by

Minh Đức Nguyễn
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

NetworkFlowExercise

The document contains exercises focused on network flow problems, including shortest path and maximum flow problems using Dijkstra's algorithm and augmenting path algorithm. It also involves formulating these problems as integer programming problems and applying them to real-world scenarios such as production line inspections and job scheduling on parallel machines. Each exercise requires specific problem-solving techniques and implementations using ZIMPL and SCIP.

Uploaded by

Minh Đức Nguyễn
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Exercises on

Network Flow Problems

Shortest path problem


Exercise 1. Solve the shortest path problem shown in Figure 1 using the Dijk-
stra’s algorithm. Count the number of distance updates.

3
2 4

2 6

s 1 5 6 1 7 4 6

8 2

0
3 5

Figure 1: Network for Exercise 1.

Exercise 2. (i) Given a directed network G = (N, A) with arc length cij associ-
ated with each arc (i, j) ∈ A. Formulate the shortest path problem from a source
node s to a target node t in the network as an integer programming formulation.
(ii) Consider the network given in Exercise 1 with source node s = 1 and target
node t = 5. Implement the formulation obtained in part (i) for this problem
instance by using ZIMPL.

Exercise 3. A production line consists of an ordered sequence of n production


stages, and each stage has a manufacturing operation followed by a potential
inspection. The product enters stage 1 of the production line in batches of size
B ≥ 1. As the items within a batch move through the manufacturing stages,
the operations might introduce defects. The probability of producing a defect at
stage i is αi . We assume that all of the defects are non-repairable, so we must
scrap any defective item. The production line must end with an inspection station

1
2

so that we do not ship any defective units. Our problem is to find an optimal
inspection plan that specifies at which stages we should inspect the items so that
we minimize the total cost of production and inspection.
Using fewer inspection stations might decrease the inspection costs, but will
increase the production costs because we might perform unnecessary manufac-
turing operations on some units that are already defective. The optimal number
of inspection stations will achieve an appropriate trade-off between these two
conflicting cost considerations.
Suppose that the following cost data are available.

• pi : the manufacturing cost per unit in stage i.

• fij : the fixed cost of inspecting a batch after stage j, given that we last
inspected the batch after stage i.

Formulate this inspection problem as a shortest path problem.

Max-flow problem
Exercise 4. Solve the maximum flow problem shown in Figure 2 using augment-
ing path algorithm (the number besides each arc represents the arc capacity).
Specify the residual network before each augmentation.
1
2 4

2 2

1 1 2 1 6
s t
2 1
1
3 5

Figure 2: Network for Exercise 4.

Exercise 5. Given a directed network G = (N, A) with arc capacity cij associated
with each arc (i, j) ∈ A. Formulate the max-flow problem from a source node s
to a sink node t in the network as an integer programming formulation.

Exercise 6. This exercise shows an application of max-flow problem in scheduling


on uniform parallel machines. Consider the problem of scheduling a set J of jobs
on M uniform parallel machines. Each job j ∈ J has

• a processing time pj (denoting the number of days required to complete the


job),
3

• a release date rj (representing the beginning of the day when this job be-
comes available for processing), and

• a due date dj ≥ rj + pj (representing the beginning of the day by which the


job must be completed).

We assume that

• a machine can work on only one job at a time, and

• each job can be processed by at most one machine at a time.

However, we allow preemptions (i.e., we can interrupt a job and process it on


different machines on different days). The scheduling problem is to determine a
feasible schedule that completes all jobs before their due dates or to show that
no such schedule exists.
(i) Formulate the scheduling problem described in Table 1 with M = 3 ma-
chines as a maximum flow problem.

Job(j) 1 2 3 4
Processing time (pj ) 1.5 1.25 2.1 3.6
Release date (rj ) 3 1 3 5
Due date (dj ) 5 4 7 9

Table 1: Parameters for scheduling problem in Exercise 6.

(ii) Solve the maximum flow problem obtained in part (i) by integer program-
ming approach with the use of ZIMPL and SCIP. From the obtained result, give
the schedule of all jobs.

You might also like