fork download
copy 
  1. import java.util.Arrays;
  2. import java.util.Random;
  3.  
  4. class LogisticsOptimizer {
  5.  
  6.     public static void main(String[] args) {
  7.         // Randomly generated problem data
  8.         String[] factories = {"Seattle", "Portland", "Denver"};
  9.         String[] stores = {"Los_Angeles", "Phoenix", "Dallas", "Chicago"};
  10.  
  11.         Random rand = new Random();
  12.         int[] production = {
  13.             rand.nextInt(100) + 50,  // 50-150 units
  14.             rand.nextInt(120) + 60,  // 60-180 units
  15.             rand.nextInt(80) + 70    // 70-150 units
  16.         };
  17.  
  18.         int[] requirements = {
  19.             rand.nextInt(90) + 40,   // 40-130 units
  20.             rand.nextInt(70) + 50,   // 50-120 units
  21.             rand.nextInt(110) + 30,  // 30-140 units
  22.             rand.nextInt(60) + 60    // 60-120 units
  23.         };
  24.  
  25.         // Balance demand if needed
  26.         int totalSupply = Arrays.stream(production).sum();
  27.         int totalDemand = Arrays.stream(requirements).sum();
  28.         if (totalSupply != totalDemand) {
  29.             requirements[0] += totalSupply - totalDemand;
  30.         }
  31.  
  32.         // Randomized cost matrix (per unit)
  33.         int[][] shippingCosts = new int[factories.length][stores.length];
  34.         for (int i = 0; i < factories.length; i++) {
  35.             for (int j = 0; j < stores.length; j++) {
  36.                 shippingCosts[i][j] = rand.nextInt(500) + 200; // $200-$700
  37.             }
  38.         }
  39.  
  40.         // Solve using Northwest Corner Method
  41.         int[][] allocations = solveNorthwestCorner(production, requirements);
  42.  
  43.         // Display results
  44.         printSolution(factories, stores, production, requirements, 
  45.                      shippingCosts, allocations);
  46.     }
  47.  
  48.     private static int[][] solveNorthwestCorner(int[] supply, int[] demand) {
  49.         int[][] solution = new int[supply.length][demand.length];
  50.         int[] remainingSupply = Arrays.copyOf(supply, supply.length);
  51.         int[] remainingDemand = Arrays.copyOf(demand, demand.length);
  52.  
  53.         int i = 0, j = 0;
  54.         while (i < supply.length && j < demand.length) {
  55.             int amount = Math.min(remainingSupply[i], remainingDemand[j]);
  56.             solution[i][j] = amount;
  57.             remainingSupply[i] -= amount;
  58.             remainingDemand[j] -= amount;
  59.  
  60.             if (remainingSupply[i] == 0) i++;
  61.             if (remainingDemand[j] == 0) j++;
  62.         }
  63.         return solution;
  64.     }
  65.  
  66.     private static void printSolution(String[] sources, String[] destinations,
  67.                                     int[] supply, int[] demand,
  68.                                     int[][] costs, int[][] solution) {
  69.         System.out.println("=== Logistics Optimization Report ===");
  70.         System.out.println("\nSources:");
  71.         for (int i = 0; i < sources.length; i++) {
  72.             System.out.printf("- %-10s: %d units%n", sources[i], supply[i]);
  73.         }
  74.  
  75.         System.out.println("\nDestinations:");
  76.         for (int j = 0; j < destinations.length; j++) {
  77.             System.out.printf("- %-10s: %d units%n", destinations[j], demand[j]);
  78.         }
  79.  
  80.         System.out.println("\nOptimal Allocation Plan:");
  81.         int totalCost = 0;
  82.         for (int i = 0; i < solution.length; i++) {
  83.             for (int j = 0; j < solution[0].length; j++) {
  84.                 if (solution[i][j] > 0) {
  85.                     int cost = solution[i][j] * costs[i][j];
  86.                     System.out.printf("%-10s → %-10s: %4d units x $%3d = $%6d%n",
  87.                             sources[i], destinations[j],
  88.                             solution[i][j], costs[i][j], cost);
  89.                     totalCost += cost;
  90.                 }
  91.             }
  92.         }
  93.         System.out.printf("%nTotal Transportation Cost: $%,d%n", totalCost);
  94.     }
  95. }
Success #stdin #stdout 0.11s 56168KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
=== Logistics Optimization Report ===

Sources:
- Seattle   : 112 units
- Portland  : 143 units
- Denver    : 78 units

Destinations:
- Los_Angeles: 106 units
- Phoenix   : 65 units
- Dallas    : 87 units
- Chicago   : 75 units

Optimal Allocation Plan:
Seattle    → Los_Angeles:  106 units x $615 = $ 65190
Seattle    → Phoenix   :    6 units x $644 = $  3864
Portland   → Phoenix   :   59 units x $682 = $ 40238
Portland   → Dallas    :   84 units x $490 = $ 41160
Denver     → Dallas    :    3 units x $684 = $  2052
Denver     → Chicago   :   75 units x $352 = $ 26400

Total Transportation Cost: $178,904
https://ideone.com/vll86R
language:
Java (12.0.1)
created:
11 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!