The consistent vehicle routing problem considering path consistency in a road network

Yao, Yu; Woensel, Tom Van; Veelenturf, Lucas P.; Mo, Pengli

doi:10.1016/j.trb.2021.09.005

Cited by 17 publications

(6 citation statements)

References 40 publications

(61 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is important to emphasize that layout compositions are required as a basis for applying the methods. Studies on dynamic or consistent routing, where the transport frequency relation between stations varies as described in [28] and [29], use both transport frequency relations (cf. customer-based graph in [29]), as well as transport distance relations (cf.…”

Section: F Routing and Path Planningmentioning

confidence: 99%

“…Studies on dynamic or consistent routing, where the transport frequency relation between stations varies as described in [28] and [29], use both transport frequency relations (cf. customer-based graph in [29]), as well as transport distance relations (cf. road network-based graph in [29]).…”

Section: F Routing and Path Planningmentioning

confidence: 99%

“…customer-based graph in [29]), as well as transport distance relations (cf. road network-based graph in [29]).…”

Section: F Routing and Path Planningmentioning

confidence: 99%

See 2 more Smart Citations

Classified AGV Material Flow and Layout Data Set for Multidisciplinary Investigation

Sperling,

Schulz,

Enke

et al. 2023

IEEE Access

View full text Add to dashboard Cite

Automated Guided Vehicles (AGV) are increasingly used in industry to automate material flow tasks. To efficiently operate systems of AGVs, researchers have proposed many different planning and control methods, e.g., for scheduling, dispatching, and routing. The performance of these methods depends on the characteristics of the system, such as transport distances and station operation frequencies. Even though these characteristics strongly influence the algorithms, no classified collection of layout data was found based on a scientific literature review. In this paper, a data set of 72 material flow and layout compositions from the scientific literature (42) and German industry (30) is presented. Each composition in the data set consists of a transport matrix and a distance matrix. To classify the compositions, a holistic taxonomy was established based on distinguishing criteria for material flow and layout compositions known from the scientific literature. The compositions were classified according to the taxonomy. An analysis of the station operation frequency and transport distance distribution data reveals typical characteristics of the compositions as well as variations between the classified compositions. The aim of this data set is to allow benchmarking of planning and control methods, thus increasing the transparency and traceability of scientific work. Furthermore, the analysis of the layouts and their taxonomy allows to compare the methods of different disciplines. By providing standardized, machine readable formats, automatic testing and optimization will be possible.

show abstract

Section: F Routing and Path Planningmentioning

confidence: 99%

Section: F Routing and Path Planningmentioning

confidence: 99%

See 1 more Smart Citation

Classified AGV Material Flow and Layout Data Set for Multidisciplinary Investigation

Sperling,

Schulz,

Enke

et al. 2023

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The constraint (4) is the capacity constraint of vehicles. The constraints (5)(6)(7)(8) represent the time window constraints of vehicles.…”

Section: A Vrptwmentioning

confidence: 99%

“…This study also pointed out that the Eulerian distance approximation for road networks with time windows may have the consequence that the time windows are not satisfied. Yao et al [6] studied the consistent VRP. The customer based graph miss some road information and therefore cannot handle the path consistency problem properly.…”

Section: Introductionmentioning

confidence: 99%

A Hybrid BSO-ACO for Dynamic Vehicle Routing Problem on Real-World Road Networks

et al. 2022

View full text Add to dashboard Cite

The Dynamic Vehicle Routing Problem With Time Windows (DVRPTW) is an NP-hard problem, which has attracted a lot of attention in the past decades due to its many practical applications in logistics. In order to better describe the actual logistics distribution scenario, this paper studies the DVRPTW based on real road networks and proposes the hybrid BSO-ACO algorithm, which is a combination of Brain Storm Optimization (BSO), Ant Colony Optimization (ACO) and Neighborhood Search (2-opt, relocate, exchange). The algorithm 1) uses ACO to generate new individuals from the same cluster formed by BSO, and increases exploitation by ACO's pheromone accumulation, 2) harnesses the 2-opt, relocate, and exchange to increase exploration to avoid the algorithm from falling into local optima. We construct a test set by extracting the real road networks in Panyu District, Guangzhou, China and compare the hybrid BSO-ACO algorithm with other algorithms on this test set. The computation experiments show the effectiveness and efficiency of the hybrid BSO-ACO algorithm.

show abstract

Mathematical formulations for consistent travelling salesman problems

Díaz-Ríos,

Salazar-González

2024

European Journal of Operational Research

View full text Add to dashboard Cite

The consistent vehicle routing problem considering path consistency in a road network

Cited by 17 publications

References 40 publications

Classified AGV Material Flow and Layout Data Set for Multidisciplinary Investigation

Classified AGV Material Flow and Layout Data Set for Multidisciplinary Investigation

A Hybrid BSO-ACO for Dynamic Vehicle Routing Problem on Real-World Road Networks

Mathematical formulations for consistent travelling salesman problems

Contact Info

Product

Resources

About