• Title/Summary/Keyword: Pickup and delivery

Search Result 37, Processing Time 0.02 seconds

Multi-objective Optimization of Vehicle Routing with Resource Repositioning (자원 재배치를 위한 차량 경로계획의 다목적 최적화)

  • Kang, Jae-Goo;Yim, Dong-Soon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.44 no.2
    • /
    • pp.36-42
    • /
    • 2021
  • This paper deals with a vehicle routing problem with resource repositioning (VRPRR) which is a variation of well-known vehicle routing problem with pickup and delivery (VRPPD). VRPRR in which static repositioning of public bikes is a representative case, can be defined as a multi-objective optimization problem aiming at minimizing both transportation cost and the amount of unmet demand. To obtain Pareto sets for the problem, famous multi-objective optimization algorithms such as Strength Pareto Evolutionary Algorithm 2 (SPEA2) can be applied. In addition, a linear combination of two objective functions with weights can be exploited to generate Pareto sets. By varying weight values in the combined single objective function, a set of solutions is created. Experiments accomplished with a standard benchmark problem sets show that Variable Neighborhood Search (VNS) applied to solve a number of single objective function outperforms SPEA2. All generated solutions from SPEA2 are completely dominated by a set of VNS solutions. It seems that local optimization technique inherent in VNS makes it possible to generate near optimal solutions for the single objective function. Also, it shows that trade-off between the number of solutions in Pareto set and the computation time should be considered to obtain good solutions effectively in case of linearly combined single objective function.

A Study on the e-Document Development of Parcel Service for Reliable Delivery (택배 물류 안전 배송을 위한 전자문서 개발 연구)

  • Ahn, Kyeong Rim;Park, Chan Kwon
    • The Journal of Society for e-Business Studies
    • /
    • v.21 no.2
    • /
    • pp.47-59
    • /
    • 2016
  • Parcel service is to deliver goods from one place to the designated destination requested according to user request. Parcel operations such as sorting, distributing, etc. or the managed information are heterogeneous by the companies. Additionally, it is impossible to support interoperability between companies with unformatted data of manual processing. Most parcel package boxes attached to paper typed waybill is attached is delivered to consignee. So, security problems such as personal information leaking are occurred, or extra processing time and logistics costs are needed due to wrong or the damaged information. Business environment of parcel service is rapidly changed as introducing unmanned delivery or the advanced technology such as Internet of Things. User want to know the accurate status or steps from parcel service request to delivery. To provide these requirements, the unified and integrated waybill information for reliable transportation of parcel service is needed. This information will provide to pickup or delivery carrier, warehouse or terminal, and parcel service user per pickup, transport, and delivery stage of parcel delivery service. Therefore, this paper defines the simplified and unified information model for parcel service waybill by analyzing information systems used for logistics unit processes that is occurred to parcel service, and manual work processes, and developing the relevant information of work flows occurred between business processes or transactions with the collected or processed information by from parcel service's stages. It is possible to share these standard model between business entities, and replacing paper typed waybill will improve national life safety as preventing security threats by paper typed waybill. As a result, it will promote the public interest from the stakeholder's perspective.

Research of the Delivery Autonomy and Vision-based Landing Algorithm for Last-Mile Service using a UAV (무인기를 이용한 Last-Mile 서비스를 위한 배송 자동화 및 영상기반 착륙 알고리즘 연구)

  • Hanseob Lee;Hoon Jung
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.46 no.2
    • /
    • pp.160-167
    • /
    • 2023
  • This study focuses on the development of a Last-Mile delivery service using unmanned vehicles to deliver goods directly to the end consumer utilizing drones to perform autonomous delivery missions and an image-based precision landing algorithm for handoff to a robot in an intermediate facility. As the logistics market continues to grow rapidly, parcel volumes increase exponentially each year. However, due to low delivery fees, the workload of delivery personnel is increasing, resulting in a decrease in the quality of delivery services. To address this issue, the research team conducted a study on a Last-Mile delivery service using unmanned vehicles and conducted research on the necessary technologies for drone-based goods transportation in this paper. The flight scenario begins with the drone carrying the goods from a pickup location to the rooftop of a building where the final delivery destination is located. There is a handoff facility on the rooftop of the building, and a marker on the roof must be accurately landed upon. The mission is complete once the goods are delivered and the drone returns to its original location. The research team developed a mission planning algorithm to perform the above scenario automatically and constructed an algorithm to recognize the marker through a camera sensor and achieve a precision landing. The performance of the developed system has been verified through multiple trial operations within ETRI.

Modeling Vehicle Routing Problem with Pair Pickup-Delivery Operations

  • Kim, Hwan-Seong;Tran-Ngoc, Hoang-Son
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2009.06a
    • /
    • pp.149-150
    • /
    • 2009
  • The problem of vehicle routing problem(VRP) with pair operations of pick up and delivery are well-known in real applications in logistics networks, as in planning the routes for automatic guided vehicles(AGVs) in an automatic container terminal(ACT), warehouses or in some just-in-time services. This paper will present a formulation to modeling the problem mathematically which can be used to generate optimal routes of carried vehicles in the field to reduce the incurred cost of moving goods. This selected model could be used in (semi-)automatic short-term planning systems for vehicle fleet working in ACT, or in modern warehouses which the long list of requests is parted and sorted in preprocessing orders systems.

  • PDF

An Online Personal Rapid Transit Dispatching Algorithm Based on Nearest Neighbor Dispatching Rule (최근린 배차 규칙 기반 온라인 Personal Rapid Transit 배차 알고리즘)

  • Han, Chung-Kyun;Kwon, Bo Bea;Kim, Baek-Hyun;Jeong, Rag-Gyo;Lee, Hoon;Ha, Byung-Hyun
    • Journal of the Korea Society for Simulation
    • /
    • v.23 no.4
    • /
    • pp.97-109
    • /
    • 2014
  • Personal rapid transit (PRT) is a new transportation system, which is energy efficient and brings high quality of customer service. Customers arrive dynamically at stations and request transportation service. In this paper, we propose a new online PRT dispatching algorithm for pickup and delivery of customers. We adopt the nearest neighbor dispatching rule, which is known as performing well in general. We extend the rule with bipartite matching in order to deal with multiple vehicles and customers at the same time. We suggest a systematic way for selecting vehicles that will be considered to be dispatched, since the scope with which vehicles are selected may affect the system performance. We regard the empty travel distance of vehicles and the customer waiting time as the performance measures. By using simulation experiments, it has been examined that the scope of dispatching affects the system performance. The proposed algorithm has been validated by comparing with other dispatching rules for transportation services. We have shown that our algorithm is more suitable for PRT operating environment than other dispatching rules.

Vehicle Routing for Maximizing Interlibrary-Loan Requests under Time Constraints (상호대차 요청 도서 운송량 최대화를 위한 차량 이동 방법 연구)

  • Lim, Heejong;Lee, Sangbok;Park, Sungjae
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.51 no.2
    • /
    • pp.237-253
    • /
    • 2017
  • There are many systematic approaches to manage Interlibrary loan (ILL) efficiently. In this paper, we propose an operating method reducing user-waiting in ILL. Users are usually informed to wait around two to three days in a regional ILL service. The reason of the waiting is that there is inefficiency in running material-delivery vehicles. A mixed integer programming is employed to resolve this issue. It provides an optimal vehicle-route maximizing material-deliveries subject to time availability. We used an actual data of a regional ILL system to provide optimal vehicle routes under different time settings.

The Effect of Service Quality of Convenience Stores on Customer Loyalty Through the Emotional Response of Customers - Focusing on GS Convenience Stores-

  • Yeong-Ae, Ku
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.1
    • /
    • pp.40-55
    • /
    • 2023
  • Currently, convenience stores, which are naturally located within a 1-minute walk, are easily accessible, so customers can easily purchase the items they need, and now they are indispensable places for people. In line with modern society that focuses on buying and selling goods quickly and easily, such as 'convenience' and 'quickness', convenience stores also have been changing by marketing such as home-delivery service and storage of fresh products, not just simply selling goods. In addition, by utilizing application software, we can use everything with one smartphone that we use a lot, in order to provide reservation delivery, pickup, and subscription services. In this study, we conducted experiments focusing on the factors of convenience store service quality and users using convenience stores, and examined how these experiments affect behavioral intentions of customers through their emotional responses. As a result, it was confirmed that empathy had a positive (+) effect on the pleasure of customers, and reliability had a negative (-) effect on arousal. In addition, it was found that empathy had a positive (+) effect on arousal, and responsiveness and empathy had a positive (+) effect on dominance. Finally, it was found that pleasure and dominance had a positive (+) effect on the loyalty of customers. In this study, we intend to provide basic data on existing or future convenience stores.

Effective Route Scheduling for Military Cargo-Plane Operation (군 수송기 운영 효율성 제고를 위한 최적경로 연구)

  • Kim, Seung-Ki;Lee, Moon-Gul;Lee, Hyun-Soo
    • Korean Management Science Review
    • /
    • v.33 no.1
    • /
    • pp.89-99
    • /
    • 2016
  • A scheduled airlift is the most critical part of the air transportation operations in ROK Air Force. The military cargo-plane routing problem is a PDPLS (pickup and delivery problem in which load splits and node revisits are allowed). The cargo which is transported by a military cargo-plane is measured in pallet. The efficiency of pallet needs to be considered with respect to its volume and weight. There are some guidelines about orders of priorities and regulations in the military air transportation. However, there are no methodologies which can raise the efficiency of flight scheduling using Operations Research (OR) theories. This research proposes the effective computing methodology and the related heuristic algorithms that can maximize the effectiveness of the path routing model.

Determination of the Fleet Size for Container-Road Transportation with Dynamic Demand (동적 수송 요구를 고려한 컨테이너 운송 차량 대수 결정)

  • 양천석;고창성;정기호;신재영
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.139-142
    • /
    • 2001
  • This study suggests an approach for determining fleet size for container road transportation with dynamic demand in Korea. With the forecasted monthly container transportation data a year, a heuristic algorithm is developed to determine the number of company-owned trucks, mandated trucks, and rented trucks in order to minimize the expected annual operating cost, which is based on the solution technologies used in the aggregate production planning and the pickup-and-delivery problem. Finally the algorithm is tested for the problem how the trucking company determines the fleet size for transporting containers.

  • PDF

Pickup and Delivery Scheduling with Tine Constraints Using GeoDatabase (GIS를 기반으로 한 시간제약을 가진 주문배달 및 수거운송계획모델)

  • Hwang Heung-Suk;Cho Kyu-Sung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.185-192
    • /
    • 2002
  • 최근의 새로운 정보기술이 발전됨에 따라 대다수 수거 및 배송관련업체들은 효과적인 차량운송계획에 대한 새로운 방법을 모색하고 있다. 본 연구는 주문배달 및 수거를 수행하는 택배시스템 내에서 효과적인 차량운송계획을 수행하기 위한 GIS시스템을 응용한 연구로서, 고객의 요구시간제약과 화물의수거 및 배달을 동시에 고려한 최적운송경로시스템을 개발하였다. 이를 위해 GeoDatabase를 기반으로 항 차량운송계획 프로그램을 개발하고, 이를 GIS시스템(ArcLogistics Route)에 적용하여 물류센터와 고객간의 차량운송계획 및 운송정보시스템을 구현하였으며, 부산지역의 수산물류운송계획에 적용하였다.

  • PDF