Transportation problem: Difference between revisions

Line 58:

=={{header|1C}}==

<lang>// based on the program of <romix>

<syntaxhighlight lang="text">// based on the program of <romix>

перем m,n; // Table size

Line 445:

Процедура КомандаРассчитать(Команда)

РешениеТранспортнойЗадачи();

КонецПроцедуры</~~lang~~>

КонецПроцедуры</syntaxhighlight>

=={{header|C sharp|C#}}==

<~~lang~~ csharp>using System;

<syntaxhighlight lang="csharp">using System;

using System.Collections.Generic;

using System.IO;

Line 695:

}

}</~~lang~~>

}</syntaxhighlight>

<pre>Optimal solution input1.txt

Line 724:

=={{header|C++}}==

<~~lang~~ cpp>#include <algorithm>

<syntaxhighlight lang="cpp">#include <algorithm>

#include <iomanip>

#include <iostream>

Line 1,029:

return 0;

}</~~lang~~>

}</syntaxhighlight>

<pre>input1.txt

Line 1,085:

=={{header|D}}==

<~~lang~~ d>import std.stdio, std.range, std.algorithm, std.conv, std.math, std.traits;

<syntaxhighlight lang="d">import std.stdio, std.range, std.algorithm, std.conv, std.math, std.traits;

final class Shipment {

Line 1,327:

printResult(fileName, demand, supply, costs, matrix);

}

}</~~lang~~>

}</syntaxhighlight>

<pre>Optimal solution transportation_problem1.txt

Line 1,352:

=={{header|Glagol}}==

<lang>ОТДЕЛ Транспорт+;

<syntaxhighlight lang="text">ОТДЕЛ Транспорт+;

ИСПОЛЬЗУЕТ

Вывод ИЗ "...\Отделы\Обмен\",

Line 1,801:

ВывестиПлан

КОН Транспорт.</~~lang~~>

КОН Транспорт.</syntaxhighlight>

=== Input ===

Line 1,825:

=={{header|Go}}==

<~~lang~~ go>package main

<syntaxhighlight lang="go">package main

import (

Line 2,106:

t.printResult()

}

}</~~lang~~>

}</syntaxhighlight>

Line 2,179:

In other words:

<~~lang~~ J>NB. C's y[m] v= x implemented as x m ndxasgn v y

<syntaxhighlight lang="j">NB. C's y[m] v= x implemented as x m ndxasgn v y

ndxasgn=: conjunction define

:

Line 2,199:

r=. n (<ndxs)} r

end.

)</~~lang~~>

)</syntaxhighlight>

Task data:

<~~lang~~ J>need=: 20 30 10

<syntaxhighlight lang="j">need=: 20 30 10

supply=: 25 35

cost=:3 5 7,:3 2 5</~~lang~~>

cost=:3 5 7,:3 2 5</syntaxhighlight>

Task example:

<~~lang~~ J> need cost trans supply

<syntaxhighlight lang="j"> need cost trans supply

20 0 5

0 30 5</~~lang~~>

0 30 5</syntaxhighlight>

=={{header|Java}}==

<~~lang~~ java>import java.io.File;

<syntaxhighlight lang="java">import java.io.File;

import java.util.*;

import static java.util.Arrays.stream;

Line 2,438:

}

}</~~lang~~>

}</syntaxhighlight>

<pre>input1.txt

Line 2,496:

=={{header|Julia}}==

Code taken from [https://github.com/dylanomics/transportation_problem here] using [https://jump.dev/JuMP.jl/stable/ JuMP].

<~~lang~~ julia>using JuMP, GLPK

<syntaxhighlight lang="julia">using JuMP, GLPK

# cost vector

Line 2,528:

λ = [JuMP.dual(C1[1]),JuMP.dual(C1[2])]

μ = [JuMP.dual(C2[1]),JuMP.dual(C2[2]),JuMP.dual(C2[3])]

</syntaxhighlight>

</lang>

Line 2,536:

=={{header|Kotlin}}==

<~~lang~~ scala>// version 1.1.51

<syntaxhighlight lang="scala">// version 1.1.51

import java.io.File

Line 2,740:

}

}</~~lang~~>

}</syntaxhighlight>

Line 2,749:

=={{header|Nim}}==

<~~lang~~ ~~Nim~~>import fenv, lists, math, sequtils, strformat, strutils

<syntaxhighlight lang="nim">import fenv, lists, math, sequtils, strformat, strutils

type

Line 2,943:

tr.northWestCornerRule()

tr.steppingStone()

tr.printResult()</~~lang~~>

tr.printResult()</syntaxhighlight>

Line 2,999:

=={{header|Pascal}}==

<~~lang~~ pascal>Program transport;

<syntaxhighlight lang="pascal">Program transport;

{ based on the program of <Svetlana Belashova> }

Line 3,481:

GotoXY(40,1);

l1: d:=ReadKey;

END.</~~lang~~>

END.</syntaxhighlight>

=={{header|Perl}}==

Just re-using the code from [[Vogel's_approximation_method#Perl|Vogel's approximation method]], tweaked to handle specific input:

<~~lang~~ perl>use strict;

<syntaxhighlight lang="perl">use strict;

use warnings;

use feature 'say';

Line 3,521:

}

say my $result = "cost $cost\n\n" . $table =~ s/[A-Z]{2}/--/gr;</~~lang~~>

say my $result = "cost $cost\n\n" . $table =~ s/[A-Z]{2}/--/gr;</syntaxhighlight>

<pre>cost 170

Line 3,532:

The simplest solution I could think of.

Assumes 0 cost is not allowed, but using say -1 as the "done" cost instead should be fine.

with javascript_semantics

procedure solve(sequence needs, avail, costs)

Line 3,565:

solve({20,30,10},{25,35},{{3,5,7},{3,2,5}})

<pre>

Line 3,574:

Obviously I did not really quite understand the problem when I rattled out the above... this does much better.

-- demo\rosetta\Transportation_problem.exw

with javascript_semantics

Line 3,830:

?"done"

{} = wait_key()

(Obviously the other eight tests all work fine and produce similar output.)

Line 3,868:

Using <code>lpSolve::lp.transport</code>.

<~~lang~~ R>library(lpSolve)

<syntaxhighlight lang="r">library(lpSolve)

# cost matrix

Line 3,887:

rownames(sol) <- c("Supplier 1", "Supplier 2")

colnames(sol) <- c("Customer 1", "Customer 2", "Customer 3")

sol </~~lang~~>

sol </syntaxhighlight>

<pre>Success: the objective function is 180

Line 3,901:

Using <code>typed/racket</code>, to keep track of Vectors of Vectors of data.

<~~lang~~ racket>#lang typed/racket

<syntaxhighlight lang="racket">#lang typed/racket

;; {{trans|Java}}

(define-type (V2 A) (Vectorof (Vectorof A)))

Line 4,127:

30 40 35 45

$

1000))</~~lang~~>

1000))</syntaxhighlight>

Output of: <code>raco test Transportation-problem.rkt</code>:

Line 4,157:

Using [[Vogel's_approximation_method#Raku|Vogel's approximation method]]:

<lang ~~perl6~~>my %costs = :S1{:3C1, :5C2, :7C3}, :S2{:3C1, :2C2, :5C3};

<syntaxhighlight lang="raku" line>my %costs = :S1{:3C1, :5C2, :7C3}, :S2{:3C1, :2C2, :5C3};

my %demand = :20C1, :30C2, :10C3;

my %supply = :25S1, :35S2;

Line 4,212:

print "\n";

}

say "\nTotal cost: $total";</~~lang~~>

say "\nTotal cost: $total";</syntaxhighlight>

<pre> C1 C2 C3

Line 4,220:

=={{header|REXX}}==

<~~lang~~ rexx>/* REXX ***************************************************************

<syntaxhighlight lang="rexx">/* REXX ***************************************************************

* Solve the Transportation Problem using the Northwest Corner Method

Default Input

Line 4,598:

Nop

End

Exit 12</~~lang~~>

Exit 12</syntaxhighlight>

<pre>F:\>rexx tpx2 input1.txt

Line 4,665:

Use network solver in SAS/OR:

<~~lang~~ sas>/* create SAS data sets */

<syntaxhighlight lang="sas">/* create SAS data sets */

data cost_data;

input from $ to $ cost;

Line 4,705:

print _OROPTMODEL_NUM_['OBJECTIVE'];

print flow;

quit;</~~lang~~>

quit;</syntaxhighlight>

Output:

Line 4,719:

=={{header|Visual Basic .NET}}==

<~~lang~~ vbnet>Module Module1

<syntaxhighlight lang="vbnet">Module Module1

Class Shipment

Line 4,975:

End Sub

End Module</~~lang~~>

End Module</syntaxhighlight>

<pre>Optimal solution input1.txt

Line 5,009:

<~~lang~~ ecmascript>import "/dynamic" for Struct

<syntaxhighlight lang="ecmascript">import "/dynamic" for Struct

import "/ioutil" for FileUtil, File

import "/math" for Nums

Line 5,206:

t.steppingStone()

t.printResult()

}</~~lang~~>

}</syntaxhighlight>