• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.16-22
• /
• 2019

After Dantzig and Rasmer introduced Vehicle Routing Problem in 1959, this field has been studied with numerous approaches so far. Classical Vehicle Routing Problem can be described as a problem of multiple number of homogeneous vehicles sharing a same starting node and having their own routes to meet the needs of demand nodes. After satisfying all the needs, they go back to the starting node. In order to apply the real world problem, this problem had been developed with additional constraints and pick up & delivery model is one of them. To enhance the effectiveness of pick up & delivery, hub became a popular concept, which often helps reducing the overall cost and improving the quality of service. Lots of studies have suggested heuristic methods to realize this problem because it often becomes a NP-hard problem. However, because of this characteristic, there are not many studies solving this problem optimally. If the problem can be solved in polynomial time, optimal solution is the best option. Therefore, this study proposes a new mathematical model to solve this problem optimally, verified by a real world problem. The main improvements of this study compared to real world case are firstly, make drivers visit every nodes once except hub, secondly, make drivers visit every nodes at the right time, and thirdly, make drivers start and end their journey at their own homes.

• Journal of the Korean School Mathematics Society
• /
• v.5 no.1
• /
• pp.13-19
• /
• 2002

In this experiment we emphasized the cooperative small group learning and the members of my group worked together to succeed and communicate their mathematics ideas freely. The researcher(teacher) became an observer and facilitator of small group interaction, paying attention to the ongoing learning process, Sometimes the researcher suggested some investigation approach(or discovery)being written by computer software or papers. In this experiment we provided 6 activities as follows : (1) changing the conditions in given problem. (2) operating the meaningful heuristics with the problem sets. (3) creating the problem situations related to understanding (4) creating the Modeling situations. (5) creating the problem related to combinatorial thinking in real world. (6) posing some real problem from real world. we could observed several conjectures First, Attitude and chility to interpret the problem setting is highly important to pose the problem effectively. Second, Generating the understanding can be a great tool to pose the problem effectively. Third, Sometimes inquiry approach represented by software or programmed book could be some motivation to enhance the posing activities. Forth, The various posing activities relate to one concept could give the students some opportunity to be adaptable and flexible in the their approach to unfamiliar problem sets.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.195-204
• /
• 2003

Network optimization is being increasingly important and fundamental issue in the fields such as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. Networks provide a useful way to modeling real world problems and are extensively used in practice. Many real world applications impose on more complex issues, such as, complex structure, complex constraints, and multiple objects to be handled simultaneously and make the problem intractable to the traditional approaches. Recent advances in evolutionary computation have made it possible to solve such practical network optimization problems. The invited talk introduces a thorough treatment of evolutionary approaches, i.e., hybrid genetic algorithms approach to network optimization problems, such as, fixed charge transportation problem, minimum cost and maximum flow problem, minimum spanning tree problem, multiple project scheduling problems, scheduling problem in FMS.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1248-1251
• /
• 2002

Logistics optimization problems related with vehicle routing such as warehouse locating, track scheduling, customer order delivery, wastage pickup etc. are very interesting and important issues to date. Many Vehicle Routing and Scheduling Systems (VRSS) have been developed/proposed to optimize the logistics problems. But majority of them are dedicated to a particular problem and are unable to handle the real world spatial data directly. The system developed for one problem may not be suitable for others due to inter-problem constraint variations. The constraints may include geographical, environmental and road traffic nature of the working region along with other constraints related with the problem. So the developer always needs to modify the original routing algorithm in order to fulfill the purpose. In our study, we propose a general-purpose platform by combining GIS road map and Database Management System (DBMS), so that VRSS can interact with real world spatial data directly to solve different kinds of vehicle routing problems. Using the features of our developed system, the developer can frequently modify the existing algorithm or create a new one to serve the purpose.

• Journal of the Korean Institute of Navigation
• /
• v.22 no.4
• /
• pp.15-19
• /
• 1998

This paper concerns a bulk or semibulk cargo ship scheduling problem with a single loading port. This type of ship scheduling problem is frequently needed in real world for carrying minerals or agricultural produce from a major single production zone to many destinations scattered over a large area of the world. The first optimization model for this problem was introduced by Ronen (1986) as a nonlinear mixed integer program. The model developed in this paper is an improvement of his model in the sense that nonlinearities and numerous unnecessary integer variables have been eliminated. By this improvement we could expect real world instances of moderate sizes to be solved optimal solutions by commercial integer programming software. Similarity between the ship scheduling model and the capacitated facility location model is also discussed.

• IE interfaces
• /
• v.24 no.1
• /
• pp.51-57
• /
• 2011

The traveling purchaser problem (TPP) is a generalization of the well-known traveling salesman problem (TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. In the last decade, TPP has received some attention of the researchers in the operational research area. However, all of the past researches for TPP are restricted on a single purchaser (vehicle). It could be the limitation to solve the real world problem. The purpose of this paper is to suggest the capacitated multiple TPP (CMTPP). It could be used in inbound logistics optimization in supply chain management area and many others. Since TPP is known as NP-hard, we also developed the heuristic algorithm to solve the CMTPP.

• Education of Primary School Mathematics
• /
• v.15 no.2
• /
• pp.107-134
• /
• 2012

The purpose of this study is to investigate the effectiveness of two teaching methods of word problems, one based on mathematical modeling learning(ML) and the other on traditional learning(TL). Additionally, the influence of mathematical modeling learning in word problem solving behavior, application ability of real world experiences in word problem solving and the beliefs of word problem solving will be examined. The results of this study were as follows: First, as to word problem solving behavior, there was a significant difference between the two groups. This mean that the ML was effective for word problem solving behavior. Second, all of the students in the ML group and the TL group had a strong tendency to exclude real world knowledge and sense-making when solving word problems during the pre-test. but A significant difference appeared between the two groups during post-test. classroom culture improvement efforts. Third, mathematical modeling learning(ML) was effective for improvement of traditional beliefs about word problems. Fourth, mathematical modeling learning(ML) exerted more influence on mathematically strong and average students and a positive effect to mathematically weak students. High and average-level students tended to benefit from mathematical modeling learning(ML) more than their low-level peers. This difference was caused by less involvement from low-level students in group assignments and whole-class discussions. While using the mathematical modeling learning method, elementary students were able to build various models about problem situations, justify, and elaborate models by discussions and comparisons from each other. This proves that elementary students could participate in mathematical modeling activities via word problems, it results form the use of more authentic tasks, small group activities and whole-class discussions, exclusion of teacher's direct intervention, and classroom culture improvement efforts. The conclusions drawn from the results obtained in this study are as follows: First, mathematical modeling learning(ML) can become an effective method, guiding word problem solving behavior from the direct translation approach(DTA) based on numbers and key words without understanding about problem situations to the meaningful based approach(MBA) building rich models for problem situations. Second, mathematical modeling learning(ML) will contribute attitudes considering real world situations in solving word problems. Mathematical modeling activities for word problems can help elementary students to understand relations between word problems and the real world. It will be also help them to develop the ability to look at the real world mathematically. Third, mathematical modeling learning(ML) will contribute to the development of positive beliefs for mathematics and word problem solving. Word problem teaching focused on just mathematical operations can't develop proper beliefs for mathematics and word problem solving. Mathematical modeling learning(ML) for word problems provide elementary students the opportunity to understand the real world mathematically, and it increases students' modeling abilities. Futhermore, it is a very useful method of reforming the current problems of word problem teaching and learning. Therefore, word problems in school mathematics should be replaced by more authentic ones and modeling activities should be introduced early in elementary school eduction, which would help change the perceptions about word problem teaching.

• Journal of the Korean Institute of Navigation
• /
• v.24 no.5
• /
• pp.361-371
• /
• 2000

This paper treats a genetic algorithm for ship scheduling problem in set packing formulation. We newly devised a partition based representation of solution and compose initial population using a domain knowledge of problem which results in saving calculation cost. We established replacement strategy which makes each individual not to degenerate during evolutionary process and applied adaptive mutate operator to improve feasibility of individual. If offspring is feasible then an improve operator is applied to increase objective value without loss of feasibility. A computational experiment was carried out with real data and showed a useful result for a large size real world problem.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2003.05a
• /
• pp.65-69
• /
• 2003

The concept of connector is introduced as mediator between virtual environment and real environment. A connector has interest on usefulness in real world while previous interfaces of virtual reality system have focus on virtual world. A functional connector among connectors gives solution if disorientation problem in virtual environment and helps user to take out the knowledge experienced through virtual reality system in real environment. An example of a functional connector is designed and developed. Evaluation of designed and developed. Evaluation of connector will be executed later.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.52-58
• /
• 2005

In this paper, we address a real-world periodic vehicle routing problem with time windows (PVRPTW). In addition to the general requirements of single-day vehicle routing problem, each stop has required number of visits within a cycle period in PVRPTW. Thus, we need to determine optimized days of visit for each stop with consideration of the cycle-period days together. The problem also requires consistent vehicle assignment to the stops. We developed a clustering based 3-phase approach for this problem: 1) stop-route assignment, 2) stop-day assignment, and 3) stop sequencing within a single-day route. Using the approach, we could reduce the number of routes and improve the routing efficiency for several real-world problems.