Path and Speed Optimization for Conflict-Free Pickup and Delivery Under Time Windows

Adamo, Tommaso; Bektaş, Tolga; Ghiani, Gianpaolo; Guerriero, Emanuela; Manni, Emanuele

doi:10.1287/trsc.2017.0816

Cited by 31 publications

(12 citation statements)

References 21 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here we consider a uniform roadmap layout in which the distance between any two adjacent nodes is equal, as illustrated in Figure 1. This layout can be frequently found in a warehouse and a container terminal 18 . A connected path between any two adjacent nodes is regarded as an arc.…”

Section: Modelingmentioning

confidence: 99%

“…To quantify the performance of the proposed RHP method, a benchmark system is considered. The benchmark system consists of a uniform roadmap layout used in the warehouse application suggested by the work 18 . The roadmap contains m × m nodes and 2 m × ( m − 1) arcs.…”

Section: Cases Studiesmentioning

confidence: 99%

“…In each experiment, the pickup point and the delivery point of a particular task are given randomly in advance. The distance S ( i , j ) is set to 10 m for an indoor inventory system 18 . The unit time Δ T is considered to 10 seconds.…”

Section: Cases Studiesmentioning

confidence: 99%

See 2 more Smart Citations

Receding horizon path planning of automated guided vehicles using a time‐space network model

Xin

Wei

Wang

et al. 2020

Optim Control Appl Methods

View full text Add to dashboard Cite

Summary Time‐space network (TSN) models have been widely used for collision‐free path planning of automated guided vehicles. However, existing TSN models are planned globally. The global method suffers from computational complexity and uncertainties cannot be dealt with in the dynamic environment. To address these limitations, this article proposes a new methodology to decompose the global planning problem into smaller local planning problems, which are planned in a receding horizon way. For the local problem, new decision variables and constraints are incorporated into the TSN framework. Extensive simulation experiments are carried out to show the potential of the proposed methodology. Simulation results show that the proposed method obtains competitive performances and computational times are considerably reduced, compared with the global method.

show abstract

Section: Modelingmentioning

confidence: 99%

Section: Cases Studiesmentioning

confidence: 99%

See 1 more Smart Citation

Receding horizon path planning of automated guided vehicles using a time‐space network model

Xin

Wei

Wang

et al. 2020

Optim Control Appl Methods

View full text Add to dashboard Cite

show abstract

“…Urrutia and De Werra [2] considered both limited and unlimited capacity stacks and allowed some transformations on the delivery route. Adamo et al [3] studied the optimization of delivery routes and speeds of goods with time window constraints. Haddad et al [4] studied the problem of batch pickup and delivery of goods.…”

Section: Overview Of Previousmentioning

confidence: 99%

Shunting Strategy for Placing-In and Taking-Out Wagons on Branch-Shaped Freight Operation Network with Simulation Method

Xuan

et al. 2020

Journal of Advanced Transportation

View full text Add to dashboard Cite

Because of China’s vast territory, large population, and huge demand for bulk materials, the railway transportation mode has always received considerable attention. For long-haul transportation, railway transportation can provide a scheduled-based transport plan, all-weather transport service, and cheaper carry instead of other transport modes. The study described in this paper attempts to develop a simulation platform for optimizing the placing-in and taking-out wagons system on the branch-shaped freight operation network (PTWS-BSFON). The operation process of PTWS is thoroughly analyzed from three aspects of decoupling-coupling wagons subsystem, placing-in local wagons subsystem, and taking-out local wagons subsystem. And then the simulation platform encompassing two typically shunting modes of PTWS are developed by Arena software. Under scenarios of PTWS-SO and PTWS-SSMS, the hierarchical structure of the shunting strategies is, respectively, outlined in the simulation platform. Finally, the shunting strategies based on the simulation platform are carried out by concrete examples, which prove the rationality of the methodology in applying different strategies and enhancing the performances of the PTWS-BSFON.

show abstract

“…The first category of methods relies on centralized collisionavoidance path planning. For instance, the time-window based technology can be applied to coordinate trajectories of the vehicles to avoid vehicle conflicts [25]. However, due to the dynamics and uncertainty of the AGVS, vehicle delays and failures are likely to happen [26].…”

Section: Introductionmentioning

confidence: 99%

A Collision and Deadlock Prevention Method With Traffic Sequence Optimization Strategy for UGN-Based AGVS

Xiao

Qin

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Due to the advantages of high efficiency and flexibility, the Automatic Guided Vehicle System (AGVS) has been more and more widely used in many industries. However, one of the main challenges in AGVS control is how to prevent collision and deadlock between vehicles. Although many collision and deadlock prevention algorithms have been proposed, they are inefficient for the AGVS based on a unidirectional guide-path network (UGN). In order to solve this problem, this paper proposes a collision and deadlock prevention method with a traffic sequence optimization strategy for the UGN-based AGVS. First, a vehicle coordination method based on the semaphore theory and Internet of Things (IoT) positioning technology is proposed to prevent collisions and intersection congestion deadlocks. Then, to avoid cycle deadlocks, a cycle deadlock search and avoid algorithm based on the digraph theory is developed. After that a bidding mechanism-based strategy is developed to optimize the vehicle traffic sequence in each path intersection. Finally, extensive simulation tests are conducted to verify the performance of the proposed methods and strategy. Simulation results show that, compared to the zone controlled (ZC) methods, the average travel time of the proposed methods is reduced by 6.2%-29.6%, and the average throughput is increased by 3.5%-27.4%. Also, the bidding mechanism-based traffic sequence optimization strategy can not only increase the average throughput of the processing subsystem but also reduce the congestion and deadlock risk of the logistics transportation subsystem. The proposed method is suitable for an UGN-based AGVS in the manufacturing application environment. INDEX TERMS Automatic guided vehicle system, collision and deadlock prevention, traffic sequence optimization, unidirectional guide-path network.

show abstract

Path and Speed Optimization for Conflict-Free Pickup and Delivery Under Time Windows

Cited by 31 publications

References 21 publications

Receding horizon path planning of automated guided vehicles using a time‐space network model

Receding horizon path planning of automated guided vehicles using a time‐space network model

Shunting Strategy for Placing-In and Taking-Out Wagons on Branch-Shaped Freight Operation Network with Simulation Method

A Collision and Deadlock Prevention Method With Traffic Sequence Optimization Strategy for UGN-Based AGVS

Contact Info

Product

Resources

About