• 제목/요약/키워드: Problem Solve

검색결과 11,853건 처리시간 0.04초

Heuristic Method for Collaborative Parcel Delivery with Drone

  • Chung, Jibok
    • 유통과학연구
    • /
    • 제16권2호
    • /
    • pp.19-24
    • /
    • 2018
  • Purpose - Drone delivery is expected to revolutionize the supply chain industry. This paper aims to introduce a collaborative parcel delivery problem by truck and drone (hereinafter called "TDRP") and propose a novel heuristic method to solve the problem. Research design, data, and methodology - To show the effectiveness of collaborative delivery by truck and drone, we generate a toy problem composed of 9 customers and the speed of drone is assumed to be two times faster than truck. We compared the delivery completion times by 'truck only' case and 'truck and drone' case by solving the optimization problem respectively. Results - We provide literature reviews for truck and drone routing problem for collaborative delivery and propose a novel and original heuristic method to solve the problem with numerical example. By numerical example, collaborative delivery is expected to reduce delivery completion time by 12~33% than 'truck only' case. Conclusions - In this paper, we introduce the TDRP in order for collaborative delivery to be effective and propose a novel and original heuristic method to solve the problem. The results of research will be help to develop effective heuristic solution and optimize the parcel delivery by using drone.

연속적으로 공변하는 두 양에 대한 추론의 차이가 문제 해결에 미치는 영향 (How does the middle school students' covariational reasoning affect their problem solving?)

  • 김채연;신재홍
    • 한국수학교육학회지시리즈A:수학교육
    • /
    • 제55권3호
    • /
    • pp.251-279
    • /
    • 2016
  • There are many studies on 'how' students solve mathematical problems, but few of them sufficiently explained 'why' they have to solve the problems in their own different ways. As quantitative reasoning is the basis for algebraic reasoning, to scrutinize a student's way of dealing with quantities in a problem situation is critical for understanding why the student has to solve it in such a way. From our teaching experiments with two ninth-grade students, we found that emergences of a certain level of covariational reasoning were highly consistent across different types of problems within each participating student. They conceived the given problem situations at different levels of covariation and constructed their own quantity-structures. It led them to solve the problems with the resources accessible to their structures only, and never reconciled with the other's solving strategies even after having reflection and discussion on their solutions. It indicates that their own structure of quantities constrained the whole process of problem solving and they could not discard the structures. Based on the results, we argue that teachers, in order to provide practical supports for students' problem solving, need to focus on the students' way of covariational reasoning of problem situations.

A Hybrid Routing Protocol Based on Bio-Inspired Methods in a Mobile Ad Hoc Network

  • Alattas, Khalid A
    • International Journal of Computer Science & Network Security
    • /
    • 제21권1호
    • /
    • pp.207-213
    • /
    • 2021
  • Networks in Mobile ad hoc contain distribution and do not have a predefined structure which practically means that network modes can play the role of being clients or servers. The routing protocols used in mobile Ad-hoc networks (MANETs) are characterized by limited bandwidth, mobility, limited power supply, and routing protocols. Hybrid routing protocols solve the delay problem of reactive routing protocols and the routing overhead of proactive routing protocols. The Ant Colony Optimization (ACO) algorithm is used to solve other real-life problems such as the travelling salesman problem, capacity planning, and the vehicle routing challenge. Bio-inspired methods have probed lethal in helping to solve the problem domains in these networks. Hybrid routing protocols combine the distance vector routing protocol (DVRP) and the link-state routing protocol (LSRP) to solve the routing problem.

A FAST NUMERICAL METHOD FOR SOLVING A REGULARIZED PROBLEM ASSOCIATED WITH OBSTACLE PROBLEMS

  • Yuan, Daming;Li, Xi;Lei, Chengfeng
    • 대한수학회지
    • /
    • 제49권5호
    • /
    • pp.893-905
    • /
    • 2012
  • Kirsi Majava and Xue-Cheng Tai [12] proposed a modified level set method for solving a free boundary problem associated with unilateral obstacle problems. The proximal bundle method and gradient method were applied to solve the nonsmooth minimization problems and the regularized problem, respectively. In this paper, we extend this approach to solve the bilateral obstacle problems and employ Rung-Kutta method to solve the initial value problem derived from the regularized problem. Numerical experiments are presented to verify the efficiency of the methods.

협력 학습을 통한 문제 해결에서 해결 전략의 사용형태에 관한 대화 분석 (A Study on the Pattern of usage of Problem Solving Strategy according to Its Presentation)

  • 정민수;신현성
    • 한국학교수학회논문집
    • /
    • 제4권2호
    • /
    • pp.135-142
    • /
    • 2001
  • The selected questions for this study was their conversation in problem solving way of working together. To achieve its purpose researcher I chose more detail questions for this study as follows. $\circled1$ What is the difference of strategy according to its level \ulcorner $\circled2$ What is the mathematical ability difference in problem solving process concerning its level \ulcorner This is the result of the study $\circled1$ Difference in the strategy of each class of students. High class-high class students found rules with trial and error strategy, simplified them and restated them in uncertain framed problems, and write a formula with recalling their theorem and definition and solved them. High class-middle class students' knowledge and understanding of the problem, yet middle class students tended to rely on high class students' problem solving ability, using trial and error strategy. However, middle class-middle class students had difficulties in finding rules to solve the problem and relied upon guessing the answers through illogical way instead of using the strategy of writing a formula. $\circled2$ Mathematical ability difference in problem solving process of each class. There was not much difference between high class-high class and high class-middle class, but with middle class-middle class was very distinctive. High class-high class students were quick in understanding and they chose the right strategy to solve the problem High class-middle class students tried to solve the problem based upon the high class students' ideas and were better than middle class-middle class students in calculating ability to solve the problem. High class-high class students took the process of resection to make the answer, but high class-middle class students relied on high class students' guessing to reconsider other ways of problem-solving. Middle class-middle class students made variables, without knowing how to use them, and solved the problem illogically. Also the accuracy was relatively low and they had difficulties in understanding the definition.

  • PDF

발견적 해법을 이용한 분산 컴퓨터 시스템 설계 (A Heuristic for the Design of Distributed Computing Systems)

  • 손승현;김재련
    • 산업경영시스템학회지
    • /
    • 제19권40호
    • /
    • pp.169-178
    • /
    • 1996
  • Geographically dispersed computing system is made of computers interconnected by a telecommunications network. To make the system operated efficiently, system designer must determine the allocation of data files to each node. In designing such distributed computing system, the most important issue is the determination of the numbers and the locations where database files are allocated. This is commonly referred to as the file allocation problem (FAP)[3]. The proposed model is a 0/l integer programming problem minimizing the sum of file storage costs and communication(query and update) costs. File allocation problem belongs to the class of NP-Complete problems. Because of the complexity, it is hard to solve. So, this paper presents an efficient heuristic algorithm to solve the file allocation problem using Tabu Search Technique. By comparing the optimal solutions with the heuristic solutions, it is believed that the proposed heuristic algorithm gives good solutions. Through the experimentation of various starting points and tabu restrictions, this paper presents fast and efficient method to solve the file allocation problem in the distributed computing system.

  • PDF

초등 수학 문제해결 과정에 사용되는 표현 방법에 대한 연구 (A Study of the Representation in the Elementary Mathematical Problem-Solving Process)

  • 김유정;백석윤
    • 한국초등수학교육학회지
    • /
    • 제9권2호
    • /
    • pp.85-110
    • /
    • 2005
  • 시각적 표현은 문제해결을 이끄는 안내자의 역할을 수행하며, 문제해결의 결정적 단서를 제공하는 유용한 도구이다. 수학과 교수-학습에서 교사는 시각적 표현의 중요성을 강조하여야 하며, 아동은 문제상황에 대한 감각을 길러야 한다. 따라서 본 연구의 목적은 아동이 문제해결 과정에서 사용하는 시각적 표현의 특징을 분석하고 성공적으로 문제를 해결한 학생들의 표현 유형을 정리하여, 아동이 문제에서 제시하는 여러 가지 조건을 적절한 시각적 표현 방법으로 조직화하게 하는데 시사점을 주고자 하는데 있다. 이러한 연구 목적을 달성하기 위하여 아동의 문제해결지를 분석한 결과, 초등 수학 문제해결 과정에서 대부분의 아동은 다양한 방법으로 조건을 표현하는데 익숙하지 못하였으며 시행착오 단계를 거치지 않고 처음 선택한 전략을 끝까지 사용하는 경향을 보여 문제를 읽고 생긴 처음 이미지가 문제해결에 중요한 영향을 끼친다는 것을 알았다. 또한 성공적으로 문제를 해결한 아동은 계산식에 의존하기보다는 여러 가지 정보를 해결할 수 있는 형태로 표현하여 문제를 해결하였으며, 문제해결 과정을 직관적으로 파악할 수 있을 정도의 명료하고 조직화된 그림을 그린다는 것을 알 수 있었다.

  • PDF

초등학교 4학년 학생들의 수학 문제해결과정에서의 시각적 표현 (The Fourth Graders' Visual Representation in Mathematics Problem Solving Process)

  • 김소희;이광호;구미영
    • 한국수학교육학회지시리즈C:초등수학교육
    • /
    • 제16권3호
    • /
    • pp.285-301
    • /
    • 2013
  • 본 연구는 초등학교 4학년 학생들의 수학 문제해결 과정에서 나타나는 시각적 표현이 어떠한지를 알아보고, 이를 바탕으로 수학 문제해결에 유용한 시각적 표현을 효과적으로 지도하기 위한 방안을 모색한 것이다. 연구문제 해결을 위해 서울D초등학교 4학년 1개 학급을 대상으로 학생들의 문제해결 과정에서의 시각적 표현이 어떠한지에 관한 검사를 실시하고 분석하였으며, 문제해결과정에서의 시각적 표현에 특징을 보이는 학생 4명을 선정 심층면담을 실시한 후 그 결과를 분석하였다. 학생들의 문제해결에 있어서 성취도와 문제해결과정에서의 시각적 표현의 활용사이에 깊은 관계가 있는 것으로 나타났다. 또한, 학생들이 문제해결과정에서 시각적 표현을 이용해 성공적인 문제를 해결하는 경험을 갖도록 함으로써 문제해결과정에서의 시각적 표현의 유용성을 인식할 수 있게 되었다.

조립수율을 고려한 공차할당 및 가공중심 결정 (Tolerance allotment with Design Centering considering Assembly Yield)

  • 이진구
    • 한국생산제조학회지
    • /
    • 제9권1호
    • /
    • pp.45-52
    • /
    • 2000
  • The purpose of this research was developing an integrated way to solve two typical tolerance optimization problem i.e. optimal tolerance allotment and design centering. A new problem definition design centering-tolerance allotment problem (DCTA) was proposed here for the first time and solved. Genetic algorithm and coarse Monte Carlo simulation were used to solve the stochastic optimization problem. Optimal costs were compared with the costs from the previous optimization strategies Significant cost reductions were achieved by DCTA scheme.

  • PDF

New learning algorithm to solve the inverse optimization problems

  • Aoyama, Tomoo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2002년도 ICCAS
    • /
    • pp.42.2-42
    • /
    • 2002
  • We discuss a neural network solver for the inverse optimization problem. The problem is that find functional relations between input and output data, which are include defects. Finding the relations, predictions of the defect parts are also required. The part of finding the defects in the input data is an inverse problem . We consider the meanings to solve the problem on the neural network system at first. Next, we consider the network structure of the system, the learning scheme of the network, and at last, examine the precision on the numerical calculations. In the paper, we proposed the high-precision learning method for plural three-layer neural network system that is series-connect...

  • PDF