• Journal of applied mathematics & informatics
• /
• 제41권2호
• /
• pp.311-320
• /
• 2023

In this article, a new penalty and different ranking algorithms are used to find the lowest transportation costs for the fuzzy transportation problem. This approach utilises different ranking techniques when dealing with triangular fuzzy numbers. Also, we find that the fuzzy transportation solution of the proposed method is the same as the Fuzzy Modified Distribution Method (FMODI) solution. Finally, examples are used to show how a problem is solved.

• 대한교통학회지
• /
• 제5권1호
• /
• pp.47-58
• /
• 1987

A commodity distribution problem with intertemporal storage facilities and dynamic transportation networks is proposed. mathematical integer programming methods and multiobjective programming techniques are used in the model formulation. Dynamic characteristics of commodity distribution problems are taken into account in the model formulation. storage facility location problems and transportation link addition problems are incorporated into the intertemporal multicommodity distribution problem. The model is capable of generating the most efficient and rational commodity distribution system. Therefore it can be utilized to provided the most effective investment plan for the transportation infrastructure development as well as to evaluate the existing commodity distribution system. The model determines simultaneously the most efficient locations, sizes, and activity levels of storage facilities as well as new highway links. It is extended to multiobjective planning situations for the purpose of generating alternative investment plans in accordance to planning situations. sine the investment in transportation network improvement yields w\several external benefits for a regional economy, the induced benefit maximization objective is incorporated into the cost minimization objective. The multiobjective model generates explicitly the trade-off between cost savings and induced benefits of the investment in transportation network improvement.

• 산업경영시스템학회지
• /
• 제30권3호
• /
• pp.12-19
• /
• 2007

This paper is to determine the transportation size and the location of distribution centers to minimize logistics cost in a distribution system where products are transported from the distribution centers to the retailers. Logistics cost consists of the fixed cost of distribution centers, the transportation cost from the distribution centers to the retailers and the inventory holding cost in the retailers. The logistics cost is affected by the transportation size and the location of distribution centers. The transportation size affects transportation cost and inventory holding cost. The location of distribution centers affects the transportation cost. A mathematical model is formulated and the algorithm is developed. A numerical example is shown to explain the problem.

• 산업경영시스템학회지
• /
• 제27권4호
• /
• pp.23-32
• /
• 2004

This paper addresses a model for the transportation planning that determines the transportation cycle time and the vehicle size to minimize the cost in a distribution system. The vehicle routing to minimize the transportation distance of the vehicles is also determined. A distribution system is consisted of a distribution center and many retailers. Products are transported from distribution center to retailers according to transportation planning. A model is assumed that the time horizon is continuous and infinite, and the demand of retailers is constant and deterministic. Cost factors are the transportation cost and the inventory cost, which the transportation cost is proportional to the transportation distance of vehicle when products are transported from distribution center to retailers, and the inventory cost is proportional to inventory amounts of retailers. A transportation cycle time and a vehicle size are selected among respective finite alternatives. The problem is analyzed, and a illustrative example is shown.

• 유통과학연구
• /
• 제14권2호
• /
• pp.41-45
• /
• 2016

Purpose - Finding an optimal path is an essential component for the design and operation of smart transportation or logistics network. Many applications in navigation system assume that travel time of each link is fixed and same. However, in practice, the travel time of each link changes over time. In this paper, we introduce a new transportation problem to find a latest departing time and delivery path between the two nodes, while not violating the appointed time at the destination node. Research design, data, and methodology - To solve the problem, we suggest a mathematical model based on network optimization theory and a backward search method to find an optimal solution. Results - First, we introduce a dynamic transportation problem which is different with traditional shortest path or minimum cost path. Second, we propose an algorithm solution based on backward search to solve the problem in a large-sized network. Conclusions - We proposed a new transportation problem which is different with traditional shortest path or minimum cost path. We analyzed the problem under the conditions that travel time is changing, and proposed an algorithm to solve them. Extending our models for visiting two or more destinations is one of the further research topics.

• Industrial Engineering and Management Systems
• /
• 제11권2호
• /
• pp.183-187
• /
• 2012

In this paper, we study the fixed charge transportation problem with uncertain variables. The fixed charge transportation problem has two kinds of costs: direct cost and fixed charge. The direct cost is the cost associated with each source-destination pair, and the fixed charge occurs when the transportation activity takes place in the corresponding source-destination pair. The uncertain fixed charge transportation problem is modeled on the basis of uncertainty theory. According to inverse uncertainty distribution, the model can be transformed into a deterministic form. Finally, in order to solve the uncertain fixed charge transportation problem, a numerical example is given to show the application of the model and algorithm.

• 한국컴퓨터정보학회논문지
• /
• 제6권4호
• /
• pp.163-167
• /
• 2001

물적분배시스템의 운영에 있어서 발생하는 품절에 대한 대처방법으로서 동일단계의 측면 재공급 허용을 통한 시스템 운영방안을 제안함으로써 최적물류비용을 갖는 물적분배시스템을 설계하였으며, 또한 본 연구의 고려 대상인 중앙분배센터와 지역분배센터 사이의 수송비용관계, 지역분배센터 상호간 보충허용 하의 물적분배시스템 운영에 관한 연구를 통하여 다중공급원 알고리즘을 개발하고, 기존의 단일 공급원 가정하의 분배시스템과의 총운용비용에 대한 비교분석을 통하여 본 연구에서 개발된 알고리즘의 효율성을 입증하고, 또한 수치 예를 통하여 본 연구의 타당성을 검토하였다.

• 산업경영시스템학회지
• /
• 제21권48호
• /
• pp.37-52
• /
• 1998

In many distribution systems important cost reductions and/or service improvements may be achieved by adopting an efficient inventory policy and proper selection of facilities. These efficiency improvements and service enhancements clearly require an integrated approach towards various logistical planning functions. The areas of inventory control and transportation planning need to be closely coordinated. The purpose of this paper is to construct an integrated model that can minimize the total cost of the transportation and inventory systems between multiple origin and destination points, where in origin point i has the supply of commodities and in destination point j requires the commodities. In this case, demands of the destination points are assumed random variables which have a known probability distribution. Using the lot-size reorder-point policy and the safety stock level that minimize total cost we find optimal distribution centers which transport the commodities to the destination points and suggest an optimal inventory policy to the selected distribution center. We also show if a demand greater than one unit will occur at a particular time, we describe the approximate optional replenishment policy from computational results of this lot-size reorder-point policy. This model is formulated as a 0-1 nonlinear integer programming problem. To solve the problem, this paper proposes heuristic computational procedures and a computer program with UNIX C language. In the usefulness review, we show the meaning and validity of the proposed model and exhibit the results of a comparison between our approach and the traditional approach, respectively.

• Journal of applied mathematics & informatics
• /
• 제42권3호
• /
• pp.647-661
• /
• 2024

This study aims to determine the optimal solution to transportation problems. We proposed a novel approach for tackling the initial basic feasible solution. This is a critical step toward achieving an optimal or near-optimal solution. The transportation issue is an issue of distributing goods from several sources to several destinations. The literature demonstrates many ways to improve IBFS. In this work, to solve the IBFS, we suggested a new method based on the statistical formula called cumulative distribution function (CDF) in exponential distribution, and inverse contra-harmonic mean (ICHM). The spreadsheet converts transportation cost values into exponential cost cell values. The stepping-stone method is used to identify an optimum solution. The results are compared with other existing methodologies, the suggested method incorporates balanced, and unbalanced, maximizing the profits, random values, and case studies which produce more effective outcomes.

• 대한교통학회지
• /
• 제7권2호
• /
• pp.45-52
• /
• 1989

The network equilibrium theory is to estimate the travel choices on a transportation network when the resulting travel times and costs are one basis for the choices. Increasing use of this principle on travel assignment problem lead to develop the combined choice models including not only travel options such as mode and route, but location options like trip distribution problems. This paper, first, reviews earlier developments of variable demand network equilibrium models, combined modeles of trip distribution and assignment, and entropy constrained combined models. Then various model structures of combining travel choice models based on network equilibrium theory and entropy constraints are discussed.