• Industrial Engineering and Management Systems
• /
• v.2 no.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
• /
• v.10 no.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.

• Journal of Intelligence and Information Systems
• /
• v.13 no.1
• /
• pp.49-58
• /
• 2007

MDPDPTW (Multi-Depot Pickup and Delivery Problem with Time Windows) is a typical model among the optimization models based on the pickup and delivery flow in supply chains. It is based on multi-vehicles in multi-depots and does not consider moving vehicles near pickup and delivery locations. In ubiquitous environments, it is possible to obtain information on moving vehicles and their baggage. Providing the proper context from the perspective of moving vehicles and their baggage allows for more effective vehicle routings. This study proposes Integer Programming-based MDPDPTW including the information on moving vehicles and their baggage in a ubiquitous environment: u-MDPDPTW, and shows the viability and effectiveness of u-MDPDPTW through comparative experiments of MDPDPTW and u-MDPDPTW.

• Journal of Navigation and Port Research
• /
• v.29 no.3 s.99
• /
• pp.221-226
• /
• 2005

This paper provides a method to implement IT system for supply chain management problem The fundamental scheduling issues that arise in the pickup delivery system are optimizing the system with the minimum cost, the maximum throughput and the service level. This study is concerned with the development of the customer responsive pickup-delivery system based on e-logistics and demand chain management. Through this study, the pickup-delivery problem of the vehicle using the GIS PDP and GUI- type computer programs are formulated. The computational results show that the proposed method is very effective on a set of test problems.

• IE interfaces
• /
• v.19 no.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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.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.

• Journal of the Korea Safety Management & Science
• /
• v.15 no.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.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2007.12a
• /
• pp.207-209
• /
• 2007

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

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.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.

• IE interfaces
• /
• v.13 no.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.