• 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.

• 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.

• 지능정보연구
• /
• 제13권1호
• /
• pp.49-58
• /
• 2007

공급망의 물류흐름을 최적화하기 위해 여러 차고지를 기점으로 차량들이 다수의 적하와 하역장소를 거쳐 차고지로 돌아오는 최적의 배송경로를 계획하는 기존의 최적화모형 연구는 정수계획법(IP)에 기반을 둔 MDPDPTW(Multi-Depot Pickup and Delivery Problem with Time Windows) 모형이 있다. 이에 관한 연구들은 차고지의 차량들을 대상으로만 배송경로를 계획하기 때문에 운행 중인 차량을 고려할 때보다 효과적인 배송경로계획에 한계가 있다. 본 연구는 효과적인 공급망관리를 위하여 여러 차고지의 차량은 물론, 유비쿼터스 환경에서 배송화물과 운행 중인 차량상황을 포함한 배송상황을 기반으로 최적의 배송경로를 계획하는 IP기반 최적화모형인 u-MDPDPTW 모형을 제안하는데 그 목적이 있다. 또한, 기존 MDPDPTW 모형과 본 연구의 u-MDPDPTW 모형의 비교실험을 통하여 u-MDPDPTW 모형의 효과와 유용성을 보인다.

• 한국항해항만학회지
• /
• 제29권3호
• /
• pp.221-226
• /
• 2005

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

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

• 대한산업공학회지
• /
• 제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.

• 대한안전경영과학회지
• /
• 제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.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2007년도 추계학술대회 및 제23회 정기총회
• /
• pp.207-209
• /
• 2007

본 논문은 내륙 운송 체계 하에서 공 컨테이너의 효율적인 운송관리 문제에 대하여 다루었다. 내부적으론 pickup and delivery 제약조건을 적용하여 특정 pick up 시간을 가지는 화물과 터미널에서의 적 컨테이너을 만족하는 차량의 스케줄링 문제이다. 차량의 내부 운송에서 공 컨테이너의 이동이나 공차의 이동 같은 불필요한 이동을 최소화함으로 효율적 운송을 할 수 있다. 또 한 모든 화물과 수입된 적 컨테이너의 pick up time 의 시간 제약으로 인한 차량의 이동 제약를 만족해야 한다. 이 문제를 해결하기 위해서 휴리스틱과 메타 휴리스틱 방법을 이용하여 근사해를 도출한다.

• 대한산업공학회지
• /
• 제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.

• 산업공학
• /
• 제13권3호
• /
• pp.462-470
• /
• 2000

This paper is concerned with a vehicle routing model to assist in scheduling palletized cargo pickup and delivery so called the pickup and delivery problem with advance requests in a 2-echelon supply-chain system. In this study vehicles is dispatched and routed so that each request is picked up or delivered at its original and to its destination. The model provides point-to-point transportations based on advance requests. The assignment algorithm is developed and designed for using with on-line computers and it immediately provides arrangements to be made at the time requested. This algorithm also provides the best scheduling solutions and alternatives for both to system operators and requesters. According to this algorithm, we developed computer programs and show the sample results.