• 산업공학
• /
• 제11권1호
• /
• pp.183-190
• /
• 1998

This paper is concerned with the bicriteria vehicle routing problems with time window constraints(BVRPTW). The BVRPTW is to determine the most favorable vehicle routes that minimize the total vehicle travel time and the total customer wait time which are, more often than not, conflicting. We construct a linear goal programming (GP) model for the BVRPTW and propose a heuristic algorithm to relieve a computational burden inherent to the application of the GP model. The heuristic algorithm consists of a parallel insertion method for clustering and a sequential linear goal programming procedure for routing. The results of computational experiments showed that the proposed algorithm finds successfully more favorable solutions than the Potvin an Rousseau's method that is known as a very good heuristic for the VRPs with time window constraints, through the change of target values and the decision maker's goal priority structure.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2000년도 추계학술대회 및 정기총회
• /
• pp.161-164
• /
• 2000

A cyclic shop is a production system that repeatedly produces identical sets of jobs, called minimal part sets, in the same loading and processing sequence. We consider a version of cyclic shop where the operations are processed and unloaded within time limits, so called a time window. We model the shop using an event graph model, a class of Petri nets. To represent the time window constraint, we introduce places with negative time delays. From the shop modeling graph, we develop a linear system model based on the max- plus algebra and characterize the conditions on the existence of a stable schedule.

• 대한전자공학회논문지SP
• /
• 제37권3호
• /
• pp.57-69
• /
• 2000

본 논문에서는 주행차량에 장착된 CCD 카메라를 통하여 획득되어진 영상으로부터 moving window를 사용하여 차선을 인식하고 장애물을 감지하는 방법을 제안한다 입력되는 동영상을 실시간에 처리하기 위해서는 하드웨어적으로 상당히 많은 제약을 초래한다. 이러한 문제점을 극복하고 영상을 사용하여 실시간에 차선 인식 및 장애물을 감지하기 위해, 도로조건과 차량상태에 바탕을 둔 최적의 window 크기를 결정하고 그 window 영상만을 처리하여 차선 인식 및 장애물 감지를 실시간에 가능하게 하는 기법을 제안한다 영상의 각 프레임에 대하여 moving window는 칼만필터에 의해 정확성이 향상된 예측방향으로 옮겨진다. 제안된 알고리즘의 효용성을 고속도로 주행영상을 사용한 실험을 통해 보여준다

• 전기학회논문지
• /
• 제60권2호
• /
• pp.389-397
• /
• 2011

The global dynamic window approach (DWA) is widely used to generate the shortest path of mobile robots considering obstacles and kinematic constraints. However, the dynamic constraints of robots should be considered to generate the minimum-time path. We propose a modified global DWA considering the dynamic constraints of robots. The reference path is generated using A* algorithm and smoothed by cardinal spline function. The trajectory is then generated to follows the reference path in the minimum time considering the robot dynamics. Finally, the local path is generated using the dynamic window which includes additional terms of speed and orientation. Simulation and experimental results are presented to verify the performance of the proposed method.

• Journal of Astronomy and Space Sciences
• /
• 제11권2호
• /
• pp.308-319
• /
• 1994

현재의 기술 수준으로 인공위성의 발사는 입의의 시간에 자유홉게 행해지지 못하고 톡정한 조건을 만족시켰을 때만 가능하다. 발사를 제한하는 조건에는 식 지속시간, 태양 앙각, 자세제어 조건, 발사장 및 발사체에 의한 조건 등이 었으며 본 논문에서는 이런 모든 조건을 만족시키는 최척발사시간대롤 구하였다. 이때 가장 중요한 개념은 태양-지구-위생의 상대적 위치 및 운동상태흘 계산하는 부분이며 이를 토대로 각 위생에 맞는 기하학척 고찰이 필요하다. 최척발사시간대를 구하는 프로그램을 작성하여 저고도위생인 우리벌 2호와 지구 정치위성인 무궁화호를 대상으로 각 위생의 최척발사시간대를 구하였다. 구해진 결과는 날짜를 X축으로, 그날의 시간올 y축으로 하여 나타내었다. 연구 수행중 발사장과 발사체에 관한 종합적으로 정리된 자료의 필요성을 절감하여 이후 참고자료로 사용할 수 있도록 정리하였다.

• 산업경영시스템학회지
• /
• 제29권4호
• /
• pp.75-82
• /
• 2006

The main objective of this study is to find out the shortest path of the vehicle routing problem with time window constraints by using both genetic algorithm and heuristic. Hard time constraints were considered to the vehicle routing problem in this suggested algorithm. Four different heuristic rules, modification process for initial and infeasible solution, 2-opt process, and lag exchange process, were applied to the genetic algorithm in order to both minimize the total distance and improve the loading rate at the same time. This genetic algorithm is compared with the results of existing problems suggested by Solomon. We found better solutions concerning vehicle loading rate and number of vehicles in R-type Solomon's examples R103 and R106.

• 한국경영과학회지
• /
• 제30권4호
• /
• pp.45-60
• /
• 2005

We consider a vehicle routing problem with time window and dock capacity constraints (VRPTD). In most traditional models of vehicle routing problems with time window (VRPTW), each customer must be assigned to only one vehicle route. However demand of a customer may exceed the capacity of one vehicle, hence at least two vehicles may need to visit the customer We assume that each customer has Its own dock capacity. Hence, the customer can be served by only a limited number of vehicles simultaneously. Given a depot, customers, their demands, their time windows and dock capacities, VRPTD is to get a set of feasible routes which pass the depot and some customers such that all demands of each customer are satisfied Since VRPTD is NP-hard, a meta-heuristic algorithm is developed. The algorithm consists of two Procedures : the route construction procedure and the route scheduling procedure. We tested the algorithm on a number of instances and computational results are reported.

• Industrial Engineering and Management Systems
• /
• 제9권2호
• /
• pp.178-194
• /
• 2010

To improve the ship operation in automated container terminals, it is important to schedule different types of handling equipment to operate synchronously. For example, a vehicle with container receiving and lifting capabilities is used to transport containers from a storage yard to a vessel and vice versa, while a triple quay crane (QC) can handle up to three 40-ft containers simultaneously. This paper discusses the manner in which vehicles should be assigned to containers to support such multi-lifts of QCs by using information about the locations and times of deliveries. A mixed-integer programming model is introduced to optimally assign delivery tasks to vehicles. This model considers the constraint imposed by the limited buffer space under each QC. A procedure for converting buffer-space constraints into time window constraints and a heuristic algorithmfor overcoming the excessive computational time required for solving the mathematical model are suggested. A numerical experiment is conducted to compare the objective values and computational times of the heuristic algorithm with those of the optimizing method to evaluate the performance of the heuristic algorithm.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.889-893
• /
• 2000

In this paper, a method to detect lanes and obstacles from the images captured by a CCD camera fitted in an automobile is proposed, and a new terminology “Moving Window” is defined. Processing the input dynamic images in real time can cause quite a few constraints in terms of hardware. In order to overcome these problems and detect lanes and obstacles in real time using the images, the optimal size of “Moving Window” is determined, based upon road conditions and automobile states. The real time detection is made possible through the technique. For each image frame, the moving window is moved in a predicted direction, the accuracy of which is improved by the Kalman filter estimation. The feasibility of the proposed algorithm is demonstrated through the simulated experiments of freeway driving.

• 산업경영시스템학회지
• /
• 제46권4호
• /
• pp.294-303
• /
• 2023

During wartime, the operation of engineering equipment plays a pivotal role in bolstering the combat prowess of military units. To fully harness this combat potential, it is imperative to provide efficient support precisely when and where it is needed most. While previous research has predominantly focused on optimizing equipment combinations to expedite individual mission performance, our model considers routing challenges encompassing multiple missions and temporal constraints. We implement a comprehensive analysis of potential wartime missions and developed a routing model for the operation of engineering equipment that takes into account multiple missions and their respective time windows of required start and completion time. Our approach focused on two primary objectives: maximizing overall capability and minimizing mission duration, all while adhering to a diverse set of constraints, including mission requirements, equipment availability, geographical locations, and time constraints.