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

Willemse, Elias J.; Joubert, Johannes Willem

doi:10.1016/j.dib.2016.06.067

Cited by 9 publications

(12 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Vehicles must collect all of the waste types. All of the benchmark instances used in this study are available at: http://www.uv.es/belengue/mcarp/ (Willemse and Joubert, 2016c). In this data set, waste types are one.…”

Section: Computational Resultsmentioning

confidence: 99%

A multi-compartment capacitated arc routing problem with intermediate facilities for solid waste collection using hybrid adaptive large neighborhood search and whale algorithm

Mofid-Nakhaee

Barzinpour

2018

Waste Manag Res

View full text Add to dashboard Cite

Municipal solid waste collection is an increasingly difficult task and has the highest operation cost in the solid waste management process; thus, finding the optimal routes for the waste collection is a most tactically significant decision that should be focused on due to the population growth. This research investigated the multi-compartment capacitated arc routing problem with intermediate facilities (MCCARPIF) in the context of solid waste collection. This problem has been researched rarely in the past in the real world. The MCCARPIF develops the capacitated arc routing problem (CARP) by considering both the multi-compartment vehicles and intermediate facilities together. In case of waste separation, the fleet of vehicles should have multiple parts to avoid mixing waste together. In developing countries, the process of separating the wastes is not carried out comprehensively, so this subject is almost new and research about it can improve their waste collection process. Due to the complexity of this model, two algorithms are developed to solve it: an adaptive large neighborhood search algorithm (ALNS) and the hybrid ALNS with whale optimization algorithm. Results showed that hybrid ALNS with whale optimization algorithm got higher quality solutions in comparison to ALNS. A real case study in one of the districts of Tehran municipality has been considered and the results obtained show that the use of multi-compartment vehicles is more cost-effective than the use of single-compartment vehicles, reducing the total distance traveled.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

A multi-compartment capacitated arc routing problem with intermediate facilities for solid waste collection using hybrid adaptive large neighborhood search and whale algorithm

Mofid-Nakhaee

Barzinpour

2018

Waste Manag Res

View full text Add to dashboard Cite

show abstract

“…Two sets of MCAPRTIF benchmark sets developed in [14] were used for our tests. The first set, Lpr-IF, is based on the lpr MCARP set of Belenguer et al [2], and the second set, referred to as Cen-IF, is based on actual road networks and contains some of the largest arc routing instances currently available.…”

Section: Computational Resultsmentioning

confidence: 99%

Splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities

Willemse

Joubert

2016

Operations Research Letters

Self Cite

View full text Add to dashboard Cite

This paper develops optimal and quick near-optimal splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities. Splitting procedures are a key component of giant tour-based solution methods for Arc Routing Problems. The optimal and near-optimal splitting procedures are tested within a multi-start constructive heuristic, and a fixed execution-time limit is imposed. Results on benchmark instances show that the constructive-heuristic linked with the new optimal splitting algorithm performs better than the near-optimal versions.

show abstract

“…A hybrid adaptive search large neighborhood with whale optimization algorithm (ALNS-WOA) was proposed by Mofid-Nakhaee and Barzinpour (2019) to solve homogenous single compartment vehicle (SCV) and multi-compartment vehicle (MCV) with intermediate facilities in WCRP to minimize total cost. The performance of the proposed algorithm was compared to that of adaptive large neighborhood search algorithm (ALNS) and General Algebraic Modeling System software through testing with the benchmark instances adapted from Willemse and Joubert (2016). Results show that ALNS-WOA outperforms ALNS in terms of solution quality while the computational time of ALNS-WOA is higher than ALNS.…”

Section: Literature Review and Wcrp Model Classificationmentioning

confidence: 99%

Waste collection routing problem: A mini-review of recent heuristic approaches and applications

2021

View full text Add to dashboard Cite

The waste collection routing problem (WCRP) can be defined as a problem of designing a route to serve all of the customers (represented as nodes) with the least total traveling time or distance, served by the least number of vehicles under specific constraints, such as vehicle capacity. The relevance of WCRP is rising due to its increased waste generation and all the challenges involved in its efficient disposal. This research provides a mini-review of the latest approaches and its application in the collection and routing of waste. Several metaheuristic algorithms are reviewed, such as ant colony optimization, simulated annealing, genetic algorithm, large neighborhood search, greedy randomized adaptive search procedures, and others. Some other approaches to solve WCRP like GIS is also introduced. Finally, a performance comparison of a real-world benchmark is presented as well as future research opportunities in WCRP field.

show abstract

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

Cited by 9 publications

References 3 publications

A multi-compartment capacitated arc routing problem with intermediate facilities for solid waste collection using hybrid adaptive large neighborhood search and whale algorithm

A multi-compartment capacitated arc routing problem with intermediate facilities for solid waste collection using hybrid adaptive large neighborhood search and whale algorithm

Splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities

Waste collection routing problem: A mini-review of recent heuristic approaches and applications

Contact Info

Product

Resources

About