Sequential Steps for Optimal Cost Solutions
Translated by
ScribdTranslationsSequential Steps for Optimal Cost Solutions
Translated by
ScribdTranslationsMETHOD OF SEQUENTIAL STEPS
Use the current solution (MEN, MAV, or MCM) to create a unique step trajectory.
sequential. Use these trajectories to calculate the marginal cost of introducing to the
solution each unused route.
2. If all marginal costs are equal to or greater than zero, finish; it will have
the optimal solution. If not, choose the cell that has the most negative marginal cost.
(ties are resolved arbitrarily)
3. Using the sequential step trajectory, determine the maximum number of
items that can be assigned to the chosen route in point 2 and adjust the
adequately distribution.
4.4. Go back to step 1
EXERCISE 1
DESTINOS
ORIGIN 1 2 3 4 OFFER
A 3 2 5 7 400
B 6 4 8 3 900
C 9 1 5 4 1500
DEMAND 300 500 400 600
M.E.N
DESTINOS
ORIGIN 1 2 3 4 OFFER
A 300 100 5 7 400
3 2
B 6 400 400 100 900
4 8 3
C 9 1 5 500 1500
4
DEMAND 300 500 400 600
DESTINOS
ORIGIN 1 2 3 4 OFFER
A 300 400 5 7 400
3 2
B 6 300 8 600 900
4 3
C 9 100 400 4 1500
1 5
DEMAND 300 500 400 600
4A: -1
7A: 6
1B: 1
2C: -4
3C: -4
4A: 6
1B: 1
3B: 4
2C: -4
Z= 6200
EXERCISE 2
DESTINATIONS
ORIGIN 1 2 3 4 OFFER
A 17 20 13 12 70
B 15 21 26 25 90
C 17 115
15 14 15
DEMAND 50 60 70 95 275
M.E.N
DESTINATIONS
ORIGIN 1 2 3 4 OFFER
A 50 20 13 12 70
17
B 15 40 50 25 90
21 26
C 20 20 95 115
15 14 15 17
DEMAND 50 60 70 95 275
DESTINATIONS
ORIGIN 1 2 3 4 OFFER
A 17 20 13 70 70
12
B 50 40 26 25 90
1521
C 20 70 25 115
15 14 15 17
DEMAND 50 60 70 95 275
1= -12 -15 -2 4 -38
2= 3 -3 11 4 -7
3 = 7 3 -12 -3
4= 7 -3 11 -9