• Title/Summary/Keyword: Vehicle dispatching and routing

Search Result 10, Processing Time 0.02 seconds

Efficiently Solving Dispatching Process Problems in Nurseries by Heuristic Techniques

  • Erhan, Kozan
    • Industrial Engineering and Management Systems
    • /
    • v.1 no.1
    • /
    • pp.10-18
    • /
    • 2002
  • A more comprehensive analytical framework for examining the relative merits of alternative dispatching process policies for nurseries is developed in this paper. The efficiency of the dispatch process of plants in a nursery is analysed using a vehicle routing model. The problem then involves determining in what order each vehicle should visit its locations. The problem is NP-hard. Several heuristic techniques are used to solve a real life nursery sequencing problem. The results obtained by these heuristic techniques are compared with each other and the current sequencing of orders. The model with some minor alterations can be also used to minimise the dispatching and collecting process in different agricultural plants.

A Dispatching and Routing Algorithm for Personal Rapid Transit by Considering Congestion (정체를 고려한 Personal Rapid Transit 배차 및 경로 계획 알고리즘)

  • Han, Chung-Kyun;Kim, Baek-Hyun;Jeong, Rag-Gyo;Ha, Byung-Hyun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.64 no.11
    • /
    • pp.1578-1586
    • /
    • 2015
  • Personal rapid transit (PRT) is getting attention as a new form of transportation. It is energy efficient and provides the high level of passenger service. In this study, the dynamic PRT dispatching and routing problem is dealt with. Passengers request transportation service on a complex network, and an operating system monitors passenger arrivals and coordinates vehicles in real time. A new online dispatching and routing algorithm is proposed, which minimizes the total travel distance of vehicles and the waiting time of passengers. The algorithm dispatches vehicles by considering multiple vehicles' state and multiple passengers at the same time. In particular, finding the shortest-time path is attempted by taking into account the future congestion on lanes. Discrete-event simulation is employed to validate the performance of the proposed algorithm. The results show the algorithm in this study outperforms others.

A Practical Method for Designing Vehicle Routing with Time Windows in Warehouse (정시배송체계의 실용적 설계를 위한 방법론)

  • Byeon, Eui-Seok
    • IE interfaces
    • /
    • v.13 no.3
    • /
    • pp.455-461
    • /
    • 2000
  • Logistics systems can be evaluated by how productively distribution center operates, how promptly transportation vehicle dispatches, how efficiently facility layout is, and so on. In this paper, a practical vehicle routing scheme with fixed delivery time and fixed vehicle routes is introduced. The method helps the distribution center reduce logistics cost with respect to dispatching vehicles, and satisfy the customer with pre-determined delivery time window constraints. A case study has shown that the proposed scheme not only generates a feasible schedule with time windows, but also balances material flow in warehouse.

  • PDF

A Study on Multi-Stage Dispatching Rule for Efficient AGVS (Automated Guided Vehicle System) (효율적인 AGVS의 운용을 위한 다단계 차량 발주 방식에 관한 연구)

  • 박대희
    • Journal of the Korea Society for Simulation
    • /
    • v.6 no.1
    • /
    • pp.41-52
    • /
    • 1997
  • It is essential to construct an efficient material flow system for the successful introduction of automated manufacturing systems. Automated Guided Vehicle System (AGVS) plays a significant role more and more in modern manufacturing environments, because of the flexibility and the precision they offer. However, as the size and the complexity of systems increase, the problems of dispatching, routing and scheduling of AGVs become complicated due to their independent and asynchronous demands. In this paper, we review relevant papers, and provide a new and more efficient method for dispatching AGV, named MEVTT (Minimum Empty Vehicle Travel Time) and demonstrate its performance and efficiency using simulation.

  • PDF

Intelligent Vehicle Management Using Location-Based Control with Dispatching and Geographic Information

  • Kim Dong-Ho;Kim Jin-Suk
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.249-252
    • /
    • 2004
  • The automatic determination of vehicle operation status as well as continuous tracking of vehicle location with intelligent management is one of major elements to achieve the goals. Especially, vehicle operation status can only be analyzed in terms of expert experiences with real-time location data with scheduling information. However the scheduling information of individual vehicle is very difficult to be interpreted immediately because there are hundreds of thousand vehicles are run at the same time in the national wide range workplace. In this paper, we propose the location-based knowledge management system(LKMs) using the active trajectory analysis method with routing and scheduling information to cope with the problems. This system uses an inference technology with dispatching and geographic information to generate the logistics knowledge that can be furnished to the manager in the central vehicle monitoring and controlling center.

  • PDF

Locating Idle Vehicles in Tandem-Loop Automated Guided Vehicle Systems to Minimize the Maximum Response Time

  • Lee, Shiwoo
    • Industrial Engineering and Management Systems
    • /
    • v.6 no.2
    • /
    • pp.125-135
    • /
    • 2007
  • An automated guided vehicle (AGV) system is a group of collaborating unmanned vehicles which is commonly used for transporting materials within manufacturing, warehousing, or distribution systems. The performance of an AGV system depends on the dispatching rules used to assign vehicles to pickup requests, the vehicle routing protocols, and the home location of idle vehicles, which are called dwell points. In manufacturing and distribution environments which emphasize just-in-time principles, performance measures for material handling are based on response times for pickup requests and equipment utilization. In an AGV system, the response time for a pickup request is the time that it takes for the vehicle to travel from its dwell point to the pickup station. In this article, an exact dynamic programming algorithm for selecting dwell points in a tandem-loop multiple-vehicle AGV system is presented. The objective of the model is to minimize the maximum response time for all pickup requests in a given shift. The recursive algorithm considers time restrictions on the availability of vehicles during the shift.

A Model for Determining Time Windows for Vehicles of Suppliers in a Supply Chain (공급사슬환경하에서 차량의 도착시각 시간창 결정을 위한 모델)

  • Kim, Ki-Young;Kim, Kap-Hwan
    • IE interfaces
    • /
    • v.14 no.4
    • /
    • pp.365-373
    • /
    • 2001
  • It is discussed how to determine time windows for pickups and deliveries, which have been assumed to be given in all most of previous studies on traveling salesman problems with time window, vehicle routing problems with time window, vehicle scheduling and dispatching problems, and so on. First, time windows are classified into four models (DR, DA, AR, and AA) by customers‘ polices. For each model, it is shown how a time window is related to various cost terms of suppliers and customers. Under the assumption of collaborative supplier-customer relationship, an integrated cost model for both supplier and customer is constructed for determining boundaries of time windows. The cost models in this paper consists of cost terms that depend on waiting time, early arrival time, late arrival time, and rejection of receipt. A numerical example is provided and results of the sensitivity analysis for some parameters are also provided to help intuitive understanding about the characteristics of the suggested models.

  • PDF

A Study on a Congestion-free Design of AGV System (무혼잡 무인 운반 차량 시스템의 설계에 관한 연구)

  • Park, Yun-Sun;Park, Dae-Hee
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.23 no.3
    • /
    • pp.559-580
    • /
    • 1997
  • It is essential to construct on efficient material flow system for the successful introduction of automated manufacturing systems. Automated Guided Vehicle System(AGVS) ploys a significant role more and more in modern manufacturing environments, because of the flexibility and the precision they offer. However, as the size and the complexity of systems increase, the problems of dispatching, routing and scheduling of AGVs became complicated due to their independent and asynchronous demands. In this paper, we review relevant papers, and provide a new and more efficient method for partitioning the AGV system by introducing the concept of Central Path. This method named Central Path design has advantages, since each partitioned workstation group is served by one AGV and the material handling between groups is performed by special AGV that is used for the Central Path. Therefore the congestion problems never occur. Furthermore Central Path Design has a high flexibility for alteration and extension of system. Finally, we demonstrate its efficiency using simulation.

  • PDF

Inter-loop Stocker Automated Material Handling Systems (Inter-loop Stocker 자동 물류시스템)

  • Jo, Min-Ho
    • IE interfaces
    • /
    • v.10 no.1
    • /
    • pp.57-65
    • /
    • 1997
  • Less researches on AGV(Automated Guided Vehicle) path configurations have been conducted so far while more studies have been placed in determining AGV guide path directions and pick-up/drop-off station locations, and routing/dispatching/scheduling strategies. In practice plenty of concerns fall in preventing deadlock and simplifying AGV system control through an appropriate AGV path configuration. In order to meet those requirements, a new AGV path configuration, inter-loop stocker type is introduced here. The stocker serves as relaying material between loops as well as stocking material. Automated material handling systems using AGVs play an important role in semiconductor industry including TFT LCD and memory/non-memory chip. A practical example of implementing the inter-loop stocker concept successfully in the TFT LCD fab is presented in this paper.

  • PDF

A Simulation Model for an ALV System at a Container Terminal (컨테이너 터미널의 ALV 시스템을 위한 시뮬레이션 모형)

  • Bae, Jong-Wook;Choi, Sang-Hee;Kim, Chang-Hyun;Park, Soon-O
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.4
    • /
    • pp.29-39
    • /
    • 2008
  • Recently, an ALV (Automated Lifting Vehicle) is studied as an efficient transporter, which can reduce the waiting time during ship operation in a container terminal. There are little of studies on an ALV system considering dynamic factors after analysing the cooperation between equipments. The performance of an ALV depends on self-loading & unloading of an ALV, vehicle’s interference, and occupancy of an available transfer point under dynamic environment. So, it is very difficult to evaluate the productivity of a container terminal with an ALV system. Therefore the simulation model with operational rules that be apt for an ALV system must be developed. Also the model has to consider the characteristics of interface operations and vehicle traffic. Supposing an container terminal with perpendicular layout, this study analyses the process of container handling operation and proposes operational rules such as the ALV dispatching, routing algorithm and so on for a model. We developed a simulation model for a container terminal with an ALV system using object-oriented simulation software, Anylogic.

  • PDF