Question

- Does anyone have a decent knowledge of the transportation algorithm?

Answer 1

Post a sample problem, and you'll get realistic answers to the above question. lol

Answer 2

Math, you're correct, but since it's a method which encapsulates so many steps, I'm looking for help with a small specific step, not the entire thing lol. :)

Answer 3

@Asylum15
Perhaps you could post just the step to start, if that makes it easier. If there is a link to the complete problem, it will give a better context.
Math related or engineering related? If latter, you have a better chance posting it under engineering.

Answer 4

It's a mathematical method. Not a complex concept, but very difficult to find people with knowledge of it. I appreciate your advice, will post an example now.

Answer 5

The aim of this problem is to minimise cost.

Answer 6

When you reach a table like the above, EVERY textbook, website etc I've found says the following,

''Because the transportation model seeks to minimize cost, the entering variable is the one having the most positive coefficient''

So in the above table, our most positive value is the 11.

Thats fine.

Answer 7

Or A3.

Answer 8

hmmmmm

Answer 9

However, in another example my lecturer has done, he has chosen the wrong value in my eyes, the NONE most positive, and I can't figure out why!

I'll attach a picture now.

Answer 10

ok

Answer 11

Same type of table.

Answer 12

If we base it off the printed example above, we'd pick the 12 right? Or B2.

But according to my lecturer, we pick the -1, or C1 in the table.

-1 is not the most positive value in the table, and it is still a minimisation problem.

Don't understand it..

Answer 13

To help, our SAVINGS are the numbers in BLACK above.

We must choose the most positive saving value according to the rules.

Answer 14

Probably have you all confused, apologies if so, I can answer any questions to help....

Answer 15

I personally think it would help if we have the context, like the complete problem definition, not necessarily the complete solution.
If the algorithm has a name, please name it. It sounds to me it is related to linear optimization problems, possibly involving graph theory. Each algorithm has specific limitations, e.g. discrete steps, discrete costs, etc.
With the complete problem definition, it is much easier to identify what you're trying to do, and how to arrive at this step.

Answer 16

I understand Math.

A context, and an example.

Answer 17

Problem.

Answer 18

Continued...

Answer 19

Continued... to my point.

Answer 20

What do you get using your method?
I get 930 with a greedy algorithm.

Answer 21

930 is correct Math.

Answer 22

But it doesn't answer your question! lol
I have to look in detail what your method is trying to do, and try to answer your questions.
I have to go, and won't be back before very late tonight.
I hope in the mean time someone has a chance to look into it.

Answer 23

Question, how did you get 930 so quickly? I may be able to check the final solution of this other one, to check if it's incorrect.

Answer 24

argh!!!! My lecturer made a mistake. :'(

Answer 25

I call it a greedy algorithm, but it only resembles the greedy algorithm.
A typical greedy algorithm will first assign least expensive resources, and in that order to complete the problem.
Time out....
Does that mean you found an explanation to your problem?

Answer 26

He chose the wrong coefficient.... The entire problem after is incorrect in my notes.

I understand the issue.

Answer 27

Ok, so your algorithm is working then! :)

Answer 28

Yes. Thank you so much for the help, and your time.

Also to @ganeshie8 who had a watchful eye over this.

Answer 29

No problem, you're welcome! :)

Answer 30

heh barely finished that was a long one

Answer 31

Transport Algorithms can be 10-15 A4 pages!

Answer 32

wow!!!!

Answer 33

What did you get, bro?

Answer 34

525 Units

Answer 35

Sorry, I thought you were asking me Math a haha!

Answer 36

So 525 instead of 930?

Answer 37

No no, 930 is correct.

In the 2nd example where he made an error, 525 is the correct answer, verified.

Answer 38

Whew!

Answer 39

These damn lecturers! :p

Answer 40

Hey, everybody makes mistakes, perhaps it's his first year teaching. Yes, mistakes in notes are annoying, agreed!

Answer 41

Just a light joke! I wouldn't like the responsibility of teaching final year honours biomedical engineering!

Answer 42

Nice talking to you! All the best to your academic career!

Answer 43

You too.

Answer 44

Thank you! ;)