Optimization of Transportation Cost for Farm Produce Using Linear Programming

Abstract

Transportation plays a vital role in agricultural distribution, ensuring that farm produce moves efficiently from production centers to markets and consumers. However, in many developing economies like Nigeria, high transportation costs significantly reduce farmers’ profit margins and lead to post-harvest losses. This study aims to optimize the transportation cost of farm produce using Linear Programming (LP) techniques. The objective is to minimize the total cost of transporting goods from multiple farms to various market destinations, considering available supply, demand, and transportation routes. Data were collected from selected farms and markets in Ogun State, and the Simplex Method was used to solve the formulated linear programming problem. The model results demonstrate an optimal transportation schedule that minimizes cost while satisfying both supply and demand constraints. The findings will assist policymakers, logistics managers, and farmers in making data-driven decisions that enhance agricultural profitability and resource utilization.

CHAPTER ONE: INTRODUCTION

1.1 Background of the Study

Efficient transportation of agricultural produce is a crucial factor in promoting food security, reducing post-harvest losses, and improving farmers’ income. In Nigeria, poor road networks, high fuel costs, and inefficient logistics systems have contributed to high distribution expenses, thereby affecting the overall agricultural value chain. Most farmers transport their produce using traditional methods without scientific optimization, resulting in unnecessary cost escalation.

Linear Programming (LP), a branch of Operations Research, provides mathematical tools for decision-making in resource allocation problems. It involves developing a linear objective function subject to linear equality or inequality constraints. In transportation systems, LP models help determine the most economical way to distribute goods from several supply points to multiple demand points. The goal is to minimize the total cost while satisfying the constraints of supply and demand.

Applying LP techniques to agricultural transportation enables stakeholders to identify optimal routes, allocate vehicles efficiently, and reduce waste in logistics operations. By minimizing transportation costs, farmers and marketers can increase profitability and make agricultural trade more competitive in domestic and export markets.

1.2 Statement of the Problem

Transportation inefficiency remains a major challenge in Nigeria’s agricultural sector. Farmers often face increased operational costs due to poor planning and route selection. Many rely on experience or guesswork rather than mathematical models to determine the best way to transport goods. As a result, produce is often transported using suboptimal routes, leading to excessive costs, delays, and losses.

Additionally, fluctuating fuel prices and inadequate storage facilities make cost minimization even more critical. Therefore, this study seeks to develop and apply a Linear Programming model to determine the optimal transportation plan that minimizes cost while ensuring all demand centers are adequately supplied.

1.3 Aim and Objectives of the Study

The primary aim of this study is to optimize the transportation cost of farm produce using linear programming techniques.

The specific objectives are to:

1. Formulate a transportation cost model for distributing farm produce.

2. Apply the linear programming method (Simplex or Transportation algorithm) to determine the optimal cost.

3. Identify the least-cost routes between farms and market destinations.

4. Compare the optimal cost result with the current (actual) cost to determine potential savings.

5. Provide recommendations for improving transportation planning in agricultural logistics.

1.4 Research Questions

1. How can linear programming be used to model the transportation of farm produce?

2. What are the optimal transportation routes and costs that minimize total expenses?

3. How does the optimized transportation cost compare with existing cost structures?

4. What practical steps can be implemented to enhance agricultural logistics efficiency?

1.5 Significance of the Study

This research will be beneficial in several ways:

• For farmers: It provides a systematic approach to minimizing distribution costs, thereby increasing profit margins.

• For government agencies: It offers insights into effective agricultural logistics planning and infrastructure development.

• For researchers and students: It enriches the understanding of how mathematical optimization applies to real-world economic and industrial problems.

• For transport companies: It helps in planning vehicle allocation and route optimization to achieve cost efficiency.

In essence, this study demonstrates how mathematical modeling can bridge the gap between theory and practice in solving real-life agricultural logistics problems.

1.6 Scope of the Study

The study focuses on optimizing the transportation of selected farm produce (such as maize, yam, and cassava) from farms in Ogun State to major urban markets within the state. The research uses Linear Programming techniques, specifically the Transportation Problem model. The data set includes transportation costs per kilometer, supply quantities at each farm, and demand requirements at each market. Other factors such as vehicle type, fuel efficiency, and road condition are assumed constant for simplicity.

1.7 Limitations of the Study

This study faces certain limitations. The accuracy of the results depends on the reliability of available transportation data, which may vary across sources. Some rural roads are inaccessible during rainy seasons, affecting data collection. In addition, the LP model assumes a static environment where supply, demand, and cost remain constant during the study period—an assumption that may differ from real-world situations.

1.8 Definition of Terms

• Linear Programming (LP): A mathematical technique used to determine the best possible outcome in a model with linear relationships, subject to constraints.

• Optimization: The process of finding the most efficient solution to minimize or maximize an objective function.

• Transportation Model: A specific form of LP used to minimize the cost of distributing goods from several sources to multiple destinations.

• Objective Function: A mathematical expression representing the goal of optimization, such as minimizing cost or maximizing profit.

• Constraints: Conditions or restrictions (e.g., supply and demand limits) that the solution must satisfy.

• Simplex Method: An algorithm used to solve linear programming problems efficiently.