Skip to content

Optimization Techniques for Solving Multi-Objective Transportation Problem: A Comparative Analysis

Jul 2026 · International Journal of Innovation and Multidisciplinary Research · 0 citations

Abstract

Efficient transportation planning requires balancing economic performance, operational efficiency, and environmental responsibility. In real-life transportation systems, transportation planner frequently need to include more than one conflicting factors like minimizing transportation cost, minimizing transportation time, and environmental impact. Traditional single-objective models are not sufficient to handle these complex requirements. Therefore, the need for efficient multi-objective optimization techniques has become increasingly significant. The proposed study focuses to solve a "Multi-Objective Transportation Problem (MOTP)” by different optimization techniques namely, Weighted Sum Method and Goal Programming Method. For each method, the mathematical models have been formulated and solved using secondary data in similar scenarios for fair comparison of methods. For each method, the solutions vary based on the prioritization of objectives. The results show that the Weighted Sum Method gives different results when the weights vary, which means it is sensitive to weight selection. Goal Programming proves to be more flexible and consistent by assigning prioritization and targets. A comparative analysis has been performed by focusing on the ability to find compromise solution, effectiveness of each method, efficiency in getting optimal results and practical applicability of the methods. As seen from the analysis, the multi-objective optimization offers more realistic solution as compared to single-objective optimization techniques. This could help decision makers in transportation and logistic planning.

View source

Similar papers

Open access Jul 2026

Data-Driven Route Optimization for Large-Scale Transportation Systems

The findings demonstrate that metaheuristic techniques consistently outperform traditional algorithms in complicated, constraint-rich situations and emphasize the need of cost-effective, data-driven metaheuristic optimization in current logistics planning.

K. Khaw, C. Tan · 0 citations
Open access Aug 2026

Enhanced linear programming model for optimizing unbalanced transportation problems

This study develops improved approaches to solving freight transportation problems by considering three distinct transportation cases using real-world data. The main objective is to minimize total transportation costs from supply sources to demand destinations while determining optimal shipment quantities. The proposed...

L. J. Mohammed, M. Zeidan, E. M. Nori Mahmood · 0 citations
Open access 2026

From Feasibility to Multi-Criteria Optimization in Service Team Transport Scheduling: A Declarative and Metaheuristic Perspective

The scalability of a multi-criteria optimization for the Service Team Transport Scheduling (STTS) problem is investigated, minimizing total travel time, maximum vehicle worktime, and total vehicle engagement time to define scale-aware algorithmic boundaries essential for real-time decision support systems.

Jarosław Rudy, G. Radzki · 0 citations
Open access Aug 2026

A Heuristic Modification of the Zero Point Method for Solving Time-Minimizing Transportation Problem

Commonly used in math to discover the optimal solution to a problem with straight-line goals and limits is the technique of linear programming (LP). One of its first and most important applications is the Transport Problem (TP), which aims to find the best distribution strategy that meets supply and demand without sacr...

Farhana Rashid, Naeem Hossain, Jannatul Ferdous Jeba et al. · 0 citations
Review Open access Jul 2026

Real-World Applications of the Assignment Problem: A Case Study Approach

The assignment problem is one of the most fundamental optimization models in operations research, focusing on the efficient allocation of limited resources to specific tasks while minimizing total cost or maximizing overall effectiveness. Because of its mathematical simplicity and computational efficiency, the model ha...

Karunasree Padala, Vijaya Sree Vignatha Vangala · 0 citations
Conference Jul 2026

Fairness-Aware Energy-Effective Electricity Technician Dispatch Problem

Combinatorial optimization problems involve identifying the best solution from a wide set of alternatives; these often arise in logistics, scheduling, and resource allocation. These problems, such as the Traveling Salesman Problem (TSP) and the Multi-Depot Vehicle Routing Problem (MDVRP), are generally NP-hard, with so...

H. Zaidi, Sifat E. Jahan, Malek Mouhoub · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.