• 제목/요약/키워드: pickup problem

검색결과 56건 처리시간 0.021초

A Pickup and Delivery Problem Based on AVL and GIS

  • Hwang, Heung-Suk
    • Industrial Engineering and Management Systems
    • /
    • 제2권1호
    • /
    • pp.28-34
    • /
    • 2003
  • The fundamental design issues that arise in the pickup and delivery system planning are optimizing the system with minimum cost and maximum throughput and service level. This study is concerned with the development of pickup and delivery system with customer responsive service level, DCM(Demand Chain Management). The distribution process and service map are consisted of manufacturing, warehousing, and pickup and delivery. First we formulated the vehicle pickup and delivery problem using GIS-VRP method so as to satisfy the customer service requests. Second, we developed a GUI-type computer program using AVL, automated vehicle location system. The computational results show that the proposed method is very effective on a set of test problems.

A Hybrid Genetic Algorithm for the Location-Routing Problem with Simultaneous Pickup and Delivery

  • Karaoglan, Ismail;Altiparmak, Fulya
    • Industrial Engineering and Management Systems
    • /
    • 제10권1호
    • /
    • pp.24-33
    • /
    • 2011
  • In this paper, we consider the Location-Routing Problem with simultaneous pickup and delivery (LRPSPD) which is a general case of the location-routing problem. The LRPSPD is defined as finding locations of the depots and designing vehicle routes in such a way that pickup and delivery demands of each customer must be performed with same vehicle and the overall cost is minimized. Since the LRPSPD is an NP-hard problem, we propose a hybrid heuristic approach based on genetic algorithms (GA) and simulated annealing (SA) to solve the problem. To evaluate the performance of the proposed approach, we conduct an experimental study and compare its results with those obtained by a branch-and-cut algorithm on a set of instances derived from the literature. Computational results indicate that the proposed hybrid algorithm is able to find optimal or very good quality solutions in a reasonable computation time.

Pickup Point 최적입지선정을 위한 Greedy Heuristic Algorithm 개발 및 적용: 서울 대도시권 지하철 시스템을 대상으로 (Greedy Heuristic Algorithm for the Optimal Location Allocation of Pickup Points: Application to the Metropolitan Seoul Subway System)

  • 박종수;이금숙
    • 한국경제지리학회지
    • /
    • 제14권2호
    • /
    • pp.116-128
    • /
    • 2011
  • 서울 수도권 지하철 승객이 인터넷으로 구매한 채소 등의 신선 식품을 퇴근하는 도중에 이동 경로상의 지하철역 구내의 서비스 시설물에서 배달 받는다고 가정하면, 제기되는 문제는 어떤 지하철역에 서비스 시설물을 설치하면 얼마나 많은 승객들이 이용하는 가를 파악하는 것이다. 이러한 문제는 픽업 문제로 알려져 있고, 픽업 문제를 풀려면 교통 흐름을 설명하는 교통 네트워크가 있어야 되고 각 교통 흐름의 이동 경로도 알 수 있어야 된다. 서울 수도권 교통카드 시스템의 교통카드 트랜잭션 데이터베이스로부터 지하철 승객의 출발역에서 도착역까지 움직이는 이동 경로인 승객 흐름을 구할 수 있으므로, 서울 수도권 지하철 교통 시스템에서 픽업 문제는 승객 흐름을 최대한 많이 포착하는 서비스 시설물들을 설치할 지하철역들을 선정하는 것이다. 본 논문에서 서울 수도권 지하철 시스템과 지하철 승객들의 흐름을 픽업 문제의 모델에 맞추어 수식화하였고, 이를 기반으로 하여 지하철 승객들의 흐름을 기종점 통행 행렬을 만들어 단계별로 가장 많은 통과 승객수를 갖는 픽업 역을 계산해내는 빠른 휴리스틱 알고리즘을 제안하였다. 대용량 교통 네트워크와 교통 흐름에 해당되는 약 400여 개의 지하철역을 가진 서울 수도권 지하철 네트워크와 약 500만 명의 지하철 교통카드 트랜잭션들을 입력으로 하여 제안된 알고리즘으로 선정된 픽업 역들을 빠른 시간 내에 얻었고, 그 중에서 상위 10개 픽업 역들을 지하철 안내 지도에 표시하여 설명하였다. 그리고, 그 결과가 거의 최적해와 같음을 추가 실험을 통하여 검증하였다.

  • PDF

동일경로 제약을 갖는 집배송 차량 경로 수립 문제의 최적화 해법 (An Optimization Algorithm for The Pickup and Delivery Problem With Time Windows)

  • 강자영;장희정;강장하;박성수
    • 대한산업공학회지
    • /
    • 제33권1호
    • /
    • pp.33-43
    • /
    • 2007
  • The pickup and delivery problem with time windows generally involves the construction of optimal routeswhich satisfy a set of transportation requests under pairing, precedence, time window, vehicle capacity, andavailability constraints. In this paper, we added some constraints to the problem and adopted an objectivefunction based on number of used vehicles, total travel distance and total schedule duration to consider morerealistic problems. A branch and price algohthm for the problem is proposed and an enumeration method is usedfor the subproblems. The algorithm was tested on randomly generated instances and computational results werereported.

Blu-ray Disc 대응 Pickup 개발 (The Development of Optical Pickup System for Blu-ray Disc)

  • 정호섭;김도환;김형진;정수진;김성현;박재혁;장인철
    • 정보저장시스템학회논문집
    • /
    • 제1권1호
    • /
    • pp.42-47
    • /
    • 2005
  • We developed an optical pickup system which is used fer Blu-ray Disc. A liquid crystal element was used to make compensation for spherical aberration. Spherical aberration is a difficult problem in the optical pickup system for Blu-ray Disc. To reduce the effects of wavelength variation from the laser source, we designed a diffraction optical element. We took a measurement of all of the parts used to make a pickup system and validated the performance of each part. Then, we made a performance test fur the optical pickup system which we developed for Blu-ray Disc and the results were satisfactory.

  • PDF

유한요소 해석을 통한 전기 어쿠스틱 기타의 음질향상 (Improvement of Sound Quality for an Electro-Acoustic Guitar Using Finite Element Analysis)

  • 이재민;박영우;임경빈
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2005년도 추계학술대회 논문집
    • /
    • pp.857-860
    • /
    • 2005
  • A guitar pickup transforms the vibration of strings to the electric signals, and deliveres them to an amplifier. A piezo pickup has interference problem between strings. The paper aims to improve sound quality for an electro-acoustic guitar through the finite element analysis. Firstly the conventional pickup is modeled and analyzed with a commercial program called ANSYS. It is obvious that there exists interference between the strings. The structural modification of the pickup is performed, based on the beam theory The modified structures are suggested, modeled and analyzed. Then the result are compared with those in the conventional pickup. It can be concluded that the interferences with the modified structures are much less than those with the conventional structure.

  • PDF

수배송 서비스를 위한 운송계획 최적화 시스템 개발 (Development of a Planning System for the Routing and Scheduling of Vehicles in Pickup and Delivery Services)

  • 최지영;이태한;임재민
    • 산업공학
    • /
    • 제19권3호
    • /
    • pp.202-213
    • /
    • 2006
  • In this paper, we develop a planning system for the routing and scheduling of vehicles in pickup and delivery service such as door-to-door parcel service. Efficient routing and scheduling of vehicles is very important in pickup and delivery service. The routing and scheduling problem is a variation of vehicle routing problem which has various realistic constraints. We develop a heuristic algorithm based on tabu search to solve the routing and scheduling problem. We develop a routing and scheduling system installed the algorithm as a planning engine. The system manage the basic data and uses GIS data to make a realistic route plan.

다단계 물류 네트워크에서 A/S 부품 집화 및 배송이 연속적으로 발생하는 문제에 관한 사례연구 -자동차 부품 물류 프로세스를 중심으로- (Case Study on the continuous pickup and delivery vehicle routing problem in Multi-level Logistic Network based on S automobile Part Logistics Process)

  • 송준우;김경섭;정석재
    • 대한안전경영과학회지
    • /
    • 제15권2호
    • /
    • pp.193-204
    • /
    • 2013
  • The growing logistics strategy of a company is to optimize their vehicle route scheduling in their supply chain system. It is very important to analyze for continuous pickups and delivery vehicle scheduling. This paper is a computational study to investigate the effectiveness of continuous pickups and delivery vehicle routing problems. These scheduling problems have 3 subproblems; Inbound Vehicle Routing Problem with Makespan and Pickup, Line-haul Network Problem, and Outbound Vehicle Routing Problem with Delivery. In this paper, we propose 5 heuristic Algorithms; Selecting Routing Node, Routing Scheduling, Determining Vehicle Type with Number and Quantity, and Modification Selecting Routing Node. We apply these Algorithms to S vehicle company. The results of computational experiments demonstrate that proposed methods perform well and have better solutions than other methods considering the basic time and due-date.

컨테이너 운송체계 개선을 위한 화물수거-배송계획 시스템 개발 (GIS-based Pickup-Delivery Scheduling Model for Container Transportation)

  • 윤항묵;황흥석;김형보
    • 한국항해항만학회지
    • /
    • 제29권3호
    • /
    • pp.221-226
    • /
    • 2005
  • 본 연구는 화물 운송 문제에 GIS 기법을 응용하여 화물의 수거 및 배송문제를 개선한 논문이다. 최근 국내 물류업체들은 인터넷을 기반으로 주문, 검색 및 화물의 추적 등을 온라인상에서 실행토록 하는 방법을 중시하게 되었다. 국내외 배송 관련 기업들은 빠른 서비스를 요 구하는 긴급주문의 비중이 커 가는 시장변환에 대처해서, 서비스 능력의 향상과 효율적인 차량관리를 위해서 GPS와 TRS 등의 정보통신기술을 이용하여, 기업의 배차업무를 개선하려고 노력하고 있다. 하지만 아직까지 배차 담당자의 의사결정을 지원할 수 있는 배차기법에 대한 연구는 거의 이루어지지 않고 있는 것이 현 실정이다, 본 연구에서는 GIS기반 하에서의 거리산정방법을 제안하고 이를 이용하여 차량운송 및 수거계획 알고리즘을 개발하였다. 또한 본 연구에서는 차량 및 화물정보를 GIS환경에서 실시간으로 조회해 볼 수 있도록 하였으며, 입출력자료와 차량 및 화물정보 조회결과를 GIS환경에서 구현하도록 하였다. 사용자들을 위하여 GUI-type 프로그램을 개발하고 실 예제를 통하여 Sample 출력을 보였다. 본 연구의 결과는 추후 약간의 수정 보완을 통하여 실제 물류센터에서의 운송계획 작성시 바로 적용할 수 있을 것이라고 판단된다.

동적 차량배차 환경에서의 차량 대수 결정 (Fleet Sizing under Dynamic Vehicle Dispatching)

  • 구평희;서정대
    • 대한산업공학회지
    • /
    • 제28권3호
    • /
    • pp.256-263
    • /
    • 2002
  • This paper addresses a planning problem in a pickup-delivery transportation' system under dynamic vehicle dispatching. We present a procedure to determine a fleet size in which stochastic characteristics of vehicle travels are considered. Statistical approach and queueing theory are applied to estimate vehicle travel time and vehicle waiting time, based on which an appropriate fleet size is determined. Simulation experiments are performed to verify the proposed procedure.