• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.51-58
• /
• 2015

This paper suggests assignment-swap algorithm with time complexity O(mn) to obtain the optimal solution for large-scale of transportation problem (TP) with incomplete cost lists. Generally, the TP with complete cost lists can be solved with TSM (Transportation Simplex Method). But, we can't be solved for large-scale of TP with TSM. Especially. It is hard to solve for large-scale TP with incomplete cost lists using TSM. Therefore, experts simply using commercial linear programming package. Firstly, the proposed algorithm applies assignment strategy of transportation quantity to ascending order of transportation cost. Then, we reassign from surplus of supply to shortage of demand. Secondly, we perform the 2-opt and 1-opt swap optimization to obtain the optimal solution. Upon application to $31{\times}15$ incomplete cost matrix problem, the proposed assignment-swap algorithm more improves the solution than LINGO of commercial linear programming.

• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.254-266
• /
• 2010

This study dealt with Traffic Problem to Cheonan city. This study ran parallel literature investigation and actual proof investigation. Questionnaires 394 enforce frequency analysis in SPSS 15.0 versions. Traffic Problem to Cheonan city include the discomfort of public transportation, parking problem, pollution of automobile, traffic accident. By improvement of traffic problem, first, improvement plan of transportation system by administration of logical traffic demand should be readied. Second, because Cheonan city is many an university student who is use target of public transportation, public transportation utilization ratio must raise through discount application. Third, solution of traffic jam need to the improvement and strengthening of system of public transit. Fourth, Cheonan city must push ahead with supplies of traffic facility, modify of transportation network, and improvement of operating system. In particular, Cheonan city need to modify old road and improvement of accessibility though road network briefly. Fifth, Cheonan city need fixing of van traffic culture such as solution of parking problem and traffic order consciousness fostering of users.

• Journal of applied mathematics & informatics
• /
• v.42 no.4
• /
• pp.831-854
• /
• 2024

The transportation problem (TP) is one of the earliest and the most significant implementations of linear programming problem (LPP). It is a specific type of LPP that mostly works with logistics and it is connected to day-to-day activities in our everyday lives. Nowadays decision makers (DM's) aim to reduce the transporting expenses and simultaneously aim to reduce the transporting time of the distribution system so the bi-objective transportation problem (BOTP) is established in the research. In real life, the transportation parameters are naturally uncertain due to insufficient data, poor judgement and circumstances in the environment, etc. In view of this, neutrosophic bi-objective transportation problem (NBOTP) is introduced in this paper. By introducing single-valued trapezoidal neutrosophic numbers (SVTrNNs) to the co-efficient of the objective function, supply and demand constraints, the problem is formulated. The DM's aim is to determine the optimal compromise solution for NBOTP. The extended weighted possibility mean for single-valued trapezoidal neutrosophic numbers based on [40] is proposed to transform the single-valued trapezoidal neutrosophic BOTP (SVTrNBOTP) into its deterministic BOTP. The transformed deterministic BOTP is then solved using the dripping method [10]. Numerical examples are provided to illustrate the applicability, effectiveness and usefulness of the solution approach. A sensitivity analysis (SA) determines the sensitivity ranges for the objective functions of deterministic BOTP. Finally, the obtained optimal compromise solution from the proposed approach provides a better result as compared to the existing approaches and conclusions are discussed for future research.

• Journal of the military operations research society of Korea
• /
• v.10 no.2
• /
• pp.43-49
• /
• 1984

This paper deals with a transportation problem with two objectives, that is, transportation cost and vital-route shipment. In the transportation problem minimizing cost is sometimes conflicting minimizing vital-route shipment. This paper develops an algorithm finding paneto-optimal solutions in minimizing vital-route shipment and cost, and also presents theoretical backgrounds for developing an algorithm.

• Proceedings of the Safety Management and Science Conference
• /
• 2008.04a
• /
• pp.345-360
• /
• 2008

The analytic hierarchy process is known as a useful tool for the group decision making methods. This tool has been area such as investment, R&D management, manufacturing, production and marketing. Typically, transportation problems have addressed by mathematical programming. In this paper, an optimal solution of transportation problem was determined by the analytic hierarchy process.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.3
• /
• pp.11-25
• /
• 2006

Space may be a scarce resource in manufacturing shops, warehouses, freight terminals, and container terminals. This Paper discusses how to locate temporary storage Inventories In limited storage areas. A typical inventory is delivered from the location of the preceding process to the storage area and stored In the storage area during the certain period of time. And it may be relocated from the storage position to another. Finally. it is delivered from the final storage area to the location of the next process. Because this logistic process for an inventory requires handling activities, transportation activities, and storage spaces, the limitation in capacities of handling equipment, transportation equipment, and storage space must be considered when allocating spaces to the inventory. This problem Is modeled as a multicommodity minimal cost flow problem. And a heuristic algorithm for the Problem is proposed. Numerical experiments are presented to validate the mathematical model and the heuristic algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.4
• /
• pp.63-80
• /
• 1999

In the container transportation of inland depots the empty container is an important issue. The truck dispatching problem in this paper is considered under restriction about empty containers. When a full container arrives in a depot by truck, after unloading operation the full container is changed to an empty container. After loading operation an empty container is changed to a full container. We suggest an integrated approach to the problem of simultaneously managing empty truck and container movements. We suggest an integrated approach to the problem of simultaneously managing empty truck and container movements. We would like to find the truck dispatching method minimizing empty truck movements and empty container movements. In this paper, a mixed integer programming model is developed to obtain the optimal truck dispatching in container transportation and heuristic is developed to give a good solution in much shorter time. The numerical examples are studied and the proposed heuristic is also compared with the result of numerical examples.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.1
• /
• pp.105-111
• /
• 2002

When transporting multiple items by trucks of various size, one needs to assign a group of items to each truck so as to minimize the total cost, while meeting the weight and volume constraint of each truck. In this paper, we formulate the problem as an integer programming problem and propose four heuristic algorithms for the problem. Computer simulation is used to evaluate the average performance of the four heuristic algorithms for the consolidated transportation problem.

• Journal of the Korean Society of Industry Convergence
• /
• v.13 no.1
• /
• pp.5-13
• /
• 2010

Industrialization and urbanization occurred-traffic delay, traffic accident and parking problem etc.-variety of transportation problems. Parking problem is one of the transportation problem then transportation engineers would get involved in trying to solve parking problem. A way to overcome a variety of parking problems needs preliminary data for conditions of parking but it lacks the preliminary data to do so. Thus this study analyzed a characteristic of a parking through a field survey for parking in Daegu Metropolitan City. This study analyzed parking characteristic of parking operation method. This study result reveals difference between a toll parking and a no charge parking characteristic. Thus a close examination for a toll parking characteristic and a no charge parking characteristic is a prerequisite for a rational parking policy.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.4
• /
• pp.53-61
• /
• 2008

Recently, Ertogral et al.[2] suggested two models considering the transportation cost based on single-vendor single-buyer integrated production-inventory problem. Although their problem-solving algorithm guarantees solutions obtained are optimal, a limitation is revealed that its performance can be inefficient due to complete enumeration search in a certain range. In this paper, a more efficient algorithm in finding optimal solutions is suggested for the same problem suggested by Ertogral et at.[2]. Numerical examples are presented for illustrative purpose.