Benchmark dataset for undirected and Mixed Capacitated Arc Routing Problems under Time restrictions with Intermediate...

Area of Science:

• Operations Research
• Combinatorial Optimization
• Logistics and Transportation

Background:

• The Capacitated Arc Routing Problem (CARP) is a fundamental problem in vehicle routing.
• Real-world routing scenarios, like waste collection, often involve complexities not captured by basic CARP.
• The Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities (MCARPTIF) addresses these complexities.

Purpose of the Study:

• To introduce and describe novel benchmark datasets for the MCARPTIF.
• To provide a standardized resource for evaluating and comparing solution approaches for MCARPTIF.
• To support research in efficient routing algorithms for practical applications.

Main Methods:

• Development of four distinct test sets for the MCARPTIF.
• Each test set comprises multiple instance files.
• Datasets are publicly available for research use.

Main Results:

• The presented datasets offer a comprehensive basis for benchmarking MCARPTIF algorithms.
• The datasets are designed to represent realistic routing challenges.
• Detailed descriptions of the datasets are available in related publications.

Conclusions:

• The availability of these benchmark datasets is crucial for advancing research in MCARPTIF.
• Standardized testing will accelerate the development of improved routing solutions.
• These datasets will aid in solving complex logistics problems, including waste management.