• Title/Summary/Keyword: heuristic method

Search Result 239, Processing Time 0.175 seconds

Heuristic Method for Collaborative Parcel Delivery with Drone

  • Chung, Jibok
    • Journal of Distribution Science
    • /
    • v.16 no.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.

Oil Tank Location Problem Solving with Mixed Integer Programming & GIS (혼합정수계획법 및 GIS를 활용한 유류저장탱크의 입지선정)

  • 최기주;김숙희;신강원
    • Journal of Korean Society of Transportation
    • /
    • v.19 no.5
    • /
    • pp.99-108
    • /
    • 2001
  • A framework of using and integrating GIS and OR tools for determining the best site selection has been provided. In this research, we demonstrated that both the P-Median heuristic method and MIP method can be successfully applied to the optimum site selection problem of oil tank location selection. Furthermore, the results identified by both approaches are identical. To accomplish this, both GIS road and maritime networks have been constructed and combined to calculated the minimum distance matrix, which is required by both approaches. After the application to the Korean peninsula, the facility locations chosen are Kunsan, Yosu, Busan, and Okgye for each district. As has been shown, the power of GIS and both algorithm have been demonstrated throughout the research and further similar research can also be conducted using the power of GIS and Operations Research tools.

  • PDF

A Heuristic Method for Resolving Circular Shareholdings of Korean Large Business Groups (대규모 기업집단의 순환출자 해소를 위한 휴리스틱 기법)

  • Park, Chan-Kyoo
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.38 no.4
    • /
    • pp.65-78
    • /
    • 2013
  • Circular shareholding is established when at least three member firms in a business group hold stock in other member firms and form a series of ownership in a circular way. Although there have been many studies which investigated a negative effect of circular shareholding on firm's value, few studies have discussed how to resolve the problem given complicated ownership structures of large business groups. This paper is based on a mixed integer programming model, which was proposed in the author's previous research and can identify the ownership share divested in order to resolve circular shareholding. Since the optimization model becomes too complicated for large business groups and requires a sophisticated software to solve it, we propose a simple heuristic method that can find a good approximate solution to the model. Its applications to twelve Korean large business groups show that the heuristic method is not just computationally attractive but also provides near-optimal solutions in most cases.

Optimal Design of Irrigation Pipe Network with Multiple Sources

  • Lyu, Heui-Jeong;Ahn, Tae-Jin
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.39 no.2
    • /
    • pp.9-18
    • /
    • 1997
  • Abstract This paper presents a heuristic method for optimal design of water distribution system with multiple sources and potential links. In multiple source pipe network, supply rate at each source node affects the total cost of the system because supply rates are not uniquely determined. The Linear Minimum Cost Flow (LMCF) model may be used to a large scale pipe network with multiple sources to determine supply rate at each source node. In this study the heuristic method based on the LMCF is suggested to determine supply rate at each source node and then to optimize the given layout. The heuristic method in turn perturbs links in the longest path of the network to obtain the supply rates which make the optimal design of the pipe network. Once the best tree network is obtained, the frequency count of reconnecting links by considering link failure is in turn applied to form loop to enhance the reliability of the best tree network. A sample pipe network is employed to test the proposed method. The results show that the proposed method can yield a lower cost design than the LMCF alone and that the proposed method can be efficiently used to design irrigation systems or rural water distribution systems.

  • PDF

A Study on the Piece Auto-Nesting Using Genetic Algorithm (유전자 알고리즘을 이용한 부재 자동배치에 관한 연구)

  • 조민철;박제웅
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • /
    • pp.65-69
    • /
    • 2001
  • In this paper, consider the three cases of decide for appling point a general Simple Genetic Algorithm about heuristic method(Bottom and Left Sliding) at the piece auto-nesting on the row plate. The 1st case, about only using the Simple Genetic Algorithm. The 2nd case, applied the heuristic method to the genetic operating of the Simple Genetic Algorithm. The 3rd case, applied the heuristic method to the final result of the Simple Genetic Algorirhm. The estimation of final result were proceed to developed simulation program in this research.

  • PDF

A Study on the Job Shop Scheduling Using CSP and SA (CSP와 SA를 이용한 Job Shop 일정계획에 관한 연구)

  • 윤종준;손정수;이화기
    • Journal of the Society of Korea Industrial and Systems Engineering
    • /
    • v.23 no.61
    • /
    • pp.105-114
    • /
    • 2000
  • Job Shop Problem which consists of the m different machines and n jobs is a NP-hard problem of the combinatorial optimization. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. Each machine can process at most one operation at a time. The purpose of this paper is to develop the heuristic method to solve large scale scheduling problem using Constraint Satisfaction Problem method and Simulated Annealing. The proposed heuristic method consists of the search algorithm and optimization algorithm. The search algorithm is to find the solution in the solution space using CSP concept such as backtracking and domain reduction. The optimization algorithm is to search the optimal solution using SA. This method is applied to MT06, MT10 and MT20 Job Shop Problem, and compared with other heuristic method.

  • PDF

A Heuristic Method for Ordering in the Dynamic Inventory System with Quantity Discounts (가격할인이 있는 단일품목 동적 재고모델의 발주정책을 위한 발견적 기법)

  • Lee, Yeong-Jo;Gang, Maeng-Gyu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.12 no.2
    • /
    • pp.77-87
    • /
    • 1986
  • This paper presents a heuristic method for solving the discrete-time ordering problem with quantity discounts and deterministic, time-varying demand. This algorithm utilizes a variation of the incremental cost approach(ICA) to determine a near optimal solution. The ICA is the method which reduces the total cost with reduction of the number of orders by one. In order to reduce the number of orders, if the incremental cost for one of the periods is negative, the demand of the period should be purchased in its immediate preceding period. In order to test the performance of this algorithm, an experiment is conducted that involves a large number of test problems covering a wide variety of situations. The result of the experiment shows that the proposed algorithm has 80.5% better solutions than the adjusted part period algorithm(APPA), which is known to be the best heuristic method.

  • PDF

A Heuristic Method for Resolving Circular Shareholding with the Objective of Voting Rights Maximization (의결권 최대화를 목적으로 하는 순환출자 해소 휴리스틱 방법)

  • Park, Chan-Kyoo
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.39 no.4
    • /
    • pp.97-113
    • /
    • 2014
  • Circular shareholding refers to a situation where at least three member firms in a business group have stock in other member firms and establish a series of ownership in a circular way. Although many studies have focused on the ultimate effect of circular shareholding on firm's value and profitability, there have been few studies which address how to resolve circular shareholding from the perspective of optimization theory. This paper proposes a heuristic method for identifying shareholdings which need to be cleared in order to settle the problem of circular shareholding in a business group. The proposed heuristic tries to maximize the sum of voting rights the controlling family has in its business group firms. The applications results confirm that the heuristic provides near-optimal solutions for most of 16 Korean large business groups involving circular shareholding.

A study on shortest problem between specified nodes with multiple travel time (다수개의 여행시간이 주어진 경우의 지정된 마디간의 최단경로 문제)

  • 이명석;박순달
    • Korean Management Science Review
    • /
    • v.7 no.2
    • /
    • pp.51-57
    • /
    • 1990
  • The purpose of this thesis is to find the shortest path between two nodes on an acyclic network where the arc costs are determined by the starting time at the starting node of the arc. A branch and bound method for optimal solutions and a heuristic method is developed. In heuristic method Dijkstra algorithm is modified to maintain the minimum arrival times of maximum informations in the each time period at each node and is updated by the result with the insertion technique. Expermetal results among two methods are presented with regard to run time and solution qualities.

  • PDF

Recognition of partially occluded objects using maximum curvature points

  • Han, Min-Hong;Jang, Dong-Sig
    • 제어로봇시스템학회:학술대회논문집
    • /
    • /
    • pp.786-789
    • /
    • 1988
  • Partially occluded objects are recognized from a 2-D image through the use of maximum curvature points on the image boundary. The vertices of high curvature on an occluded object are classified by the objects which are hypothesized to be involved in the occlusion. A heuristic method is developed for computational speed. Two typical examples are given to illustrate the accuracy as well as the simplicity of the heuristic method.

  • PDF