Fuzzy Math Tames Uncertainty in Multi-Modal Freight and Disaster Logistics

Every logistics planner knows the frustration: the model says a route is cheapest, then fuel prices spike, a storm delays the trucks, and the supposedly optimal plan collapses into expensive improvisation. A new study published in Discover Informatics by Govind Suryawanshi and Aniket Muley of Swami Ramanand Teerth Marathwada University and Madhav Fegade of Digambarao Bindu Arts, Commerce and Science College tackles precisely this fragility. The researchers have built a fuzzy multi-objective solid transportation model, or FMOSTP, that plans freight movements across multiple transport modes while explicitly embracing the uncertainty that plagues real-world supply chains, rather than pretending it does not exist.

The classical transportation problem, first formulated by F. L. Hitchcock in 1941, asks a deceptively simple question: what is the cheapest way to ship a product from several sources to several destinations while respecting supply and demand limits? For decades, extensions of this model have underpinned routing decisions in manufacturing, retail, and humanitarian relief. But the classical formulation demands precise numbers: exact unit costs, exact capacities, exact demands. In reality, fuel prices fluctuate, weather and congestion stretch transit times, demand forecasts are educated guesses, and route safety is a matter of expert judgment rather than a measured constant. Deterministic models fed with point estimates produce plans that are optimal only for one idealized version of the world and can become infeasible or unexpectedly costly when reality deviates.

The new framework departs from that tradition by representing every imprecise quantity, including costs, capacities, supplies, demands, transit times, and security levels, as trapezoidal fuzzy numbers. Each such number is defined by four values: a lower support marking the smallest plausible value, a core interval of most-likely values, and an upper support marking the largest plausible value. Instead of forcing an expert to name a single figure for the cost of shipping a pallet by rail, the model accepts a range with graded confidence, mirroring how human judgment actually works. The authors argue this is a deliberate choice: logistics quantities are imprecise but not necessarily random, so they are naturally described by possibility distributions rather than the probability distributions that stochastic programming presupposes. Compared with robust optimization, which protects against a worst case defined by an uncertainty set that is itself hard to specify, the fuzzy formulation occupies a pragmatic middle ground.

Three features distinguish the model from prior fuzzy transportation research, and the authors present them as a package whose combined properties had not previously been established. First, it retains the full solid, three-dimensional structure of the problem, meaning decisions span sources, destinations, and conveyance modes simultaneously, so multi-modal trade-offs between road, rail, air, and sea are captured directly rather than aggregated away. A mode-exclusivity constraint ensures that at most one conveyance mode serves any origin-destination pair, eliminating a semantic ambiguity in earlier formulations in which several modes could implicitly serve the same link and over-count delivery times. Second, it optimizes three conflicting objectives at once: minimizing total cost, minimizing total transit time, and maximizing route security, where security is defined as the reliability of delivering cargo intact and on schedule, quantified on a normalized scale from zero to one and aggregated from incident rates, infrastructure quality, and expert assessment. To the authors’ knowledge, no prior fuzzy solid transportation model treats route reliability as a first-class optimization target rather than a hard constraint or an afterthought.

Third, and crucially for computation, the framework converts fuzzy data into crisp equivalents using centroid defuzzification, which for a trapezoidal number simply averages its four defining values. The choice is not arbitrary. Centroid defuzzification is a linear operator: the expected value of a sum equals the sum of expected values, and scaling a fuzzy number scales its centroid proportionally. Substituting expected values therefore keeps every objective and constraint linear, preserving the model as a mixed-integer linear program solvable to global optimality with standard solvers. Non-linear or rank-dependent defuzzification methods would destroy this linearity and, with it, the convexity guarantees the authors establish. For symmetric fuzzy data, the centroid coincides with the signed-distance and graded-mean methods, making the optimal plan invariant to the choice among them; for asymmetric data, preliminary checks showed the dominant flow structure of the Pareto front remains unchanged.

To handle the three competing objectives, the study employs the weighted Tchebycheff scalarization method. Each objective is normalized between its ideal value, obtained by optimizing it alone, and its nadir value, estimated from a payoff table. The scalarized problem then minimizes the largest weighted deviation from the ideal points. Unlike simple weighted-sum approaches, the Tchebycheff method can recover Pareto-optimal solutions lying on non-convex regions of the trade-off surface, and by systematically sweeping the weights over the unit simplex, the method traces out a well-distributed Pareto front. The authors go beyond numerics to prove analytical properties: the constraint polytope is non-empty after balancing, the feasible region is convex for any fixed mode selection, the expected-value operator is Lipschitz-continuous in the fuzzy parameters so small data perturbations produce proportionally bounded changes in the optimum, and with strictly positive weights every solution of the scalarized sub-problem is Pareto optimal, with the complete front recoverable as the weight grid is refined.

Two hypothetical numerical examples demonstrate the framework in action. The first models a manufacturing supply chain with three suppliers, three distribution centers, and two modes, road and rail. After defuzzification revealed total supply exceeding total demand, a dummy destination with zero cost restored balance. The resulting plan cost roughly $1,250 less than a plan built under deterministic assumptions, kept transit times within acceptable limits, and maintained high security across all selected routes. Benchmarking against a classical deterministic cost-minimizing program, a single-objective fuzzy cost model, and a two-objective fuzzy goal program proved revealing: the deterministic model achieved the lowest nominal cost, but when unit costs were increased by fifteen percent its plan became the most expensive of the four. The proposed model accepted a cost premium of about five percent in exchange for explicit security optimization and demonstrably more robust plans.

The second example turns to disaster-relief logistics, a domain where uncertainty is not a nuisance but the defining condition. Two supply depots serve three affected districts using air, land, and sea transport, with all parameters modeled as fuzzy numbers to reflect the chaos of crisis environments. The optimal plan, costing about $3,400 with transit times around six hours and security levels above 0.85, prioritized air transport for the most urgent and insecure region while assigning cheaper sea and land modes to less critical destinations. The authors emphasize that decision-makers can adjust the objective weights, for instance raising security and time weights during a disaster, to obtain faster and safer plans at a quantified cost premium, with the model producing revised plans that still respect the fuzzy constraints.

Sensitivity analysis reinforced the theoretical claims. When the fuzzy cost parameters were perturbed systematically, the optimal cost responded almost linearly, with no abrupt jumps, confirming the Lipschitz-stability result numerically. Sweeping the cost weight traced the cost-time-security trade-off continuously, and a ten percent demand growth required only reallocation rather than wholesale re-planning, indicating that plans degrade gracefully. Computationally, the approach is practical: for instances up to three sources, three destinations, and three modes, each scalarized linear program solved in well under a second, and a full Pareto front over a twenty-one-point weight grid was generated in a few seconds. A larger synthetic instance with 120 route triples still terminated in seconds using branch-and-cut, and because the continuous relaxation retains the network structure of the classical transportation problem, the authors expect the formulation to scale gracefully to hundreds of nodes.

The study is not without acknowledged limitations: defuzzification inevitably discards some information, and genuinely large-scale benchmark instances and hybrid fuzzy-stochastic extensions remain future work. Yet the contribution stands as a template for decision-making under ambiguity. Rather than issuing a single prescriptive plan, the model hands managers a menu of Pareto-optimal options, each defensible in the trade-off it makes between money, speed, and safety. For a relief agency weighing lives against budgets, or a manufacturer hedging against volatile fuel prices, that transparency may prove as valuable as the mathematics behind it.

Subject of Research: Fuzzy multi-objective optimization of multi-modal transportation and logistics planning under uncertain cost, time, and security parameters

Article Title: Fuzzy multi objective solid transportation model for optimal distribution

Article References: Suryawanshi, G., Muley, A., & Fegade, M. (2026). Fuzzy multi objective solid transportation model for optimal distribution. Discover Informatics, 1(1), Article 24. https://doi.org/10.1007/s44564-026-00026-x

Image Credits: AI Generated

DOI: 10.1007/s44564-026-00026-x

Keywords: fuzzy optimization, solid transportation problem, multi-objective optimization, supply chain management, logistics, trapezoidal fuzzy numbers, defuzzification, Pareto front, disaster relief logistics, route security, weighted Tchebycheff method, linear programming