• 산업경영시스템학회지
• /
• 제42권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.

• 한국학교수학회논문집
• /
• 제5권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.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• 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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• 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.

• 한국항해학회지
• /
• 제22권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.

• 산업공학
• /
• 제24권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.

• 한국수학교육학회지시리즈C:초등수학교육
• /
• 제15권2호
• /
• pp.107-134
• /
• 2012

수학적 모델링은 일반적으로 수학적인 방법으로 해석되고 이해되어야 하는 실제적인 문제 상황을 해결하기 위해 상황에 대한 적절한 수학적 모델을 구성하여 문제를 해결하는 일련의 과정이라고 할 수 있다. 문장제는 실제적인 측면과 형식적인 측면, 모두를 포함하고 있으므로 수학적 모델링 활동에 이상적인 도구가 될 수 있다. 이에 본 연구는 실세계의 맥락을 고려해야 하는 진정성있는 문장제를 바탕으로 한 수학적 모델링 학습이 문장제 해결 행동, 문장제 해결에서 실생활 경험을 활용하는 능력, 문장제에 대한 신념 등에 미치는 영향을 조사하였다. 연구 결과 문장제에 대한 수학적 모델링 학습은 직접번역 접근(DTA) 대신에 의미기반 접근(MBA)으로 문장제 해결 행동을 이끄는데 효과적이었으며, 문장제를 해결하는데 있어서 실생활 맥락을 고려하는 태도에 긍정적인 영향을 미쳤다. 또한 수학적 모델링 학습은 문장제에 대한 긍정적인 신념을 형성하는데 중요한 역할을 했음을 알 수 있었다. 이와 같은 연구 결과를 바탕으로 초등학교에서 문장제를 어떻게 다루어야 하는지에 대한 시사점을 살펴보았다.

• 한국항해학회지
• /
• 제24권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.

• 한국감성과학회:학술대회논문집
• /
• 한국감성과학회 2003년도 춘계학술대회 논문집
• /
• 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.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• 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.