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

Liang, Yun-Chia; Minanda, Vanny; Gunawan, Aldy

doi:10.1177/0734242x211003975

Cited by 25 publications

(16 citation statements)

References 58 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Study [2] gives a mini-review of the latest approaches and their application in the collection and transportation of waste. Several meta-heuristic algorithms are considered, such as optimization of ant colonies, simulated annealing, genetic algorithm, search for large neighborhoods, greedy randomized adaptive search procedures, and others.…”

Section: Literature Review and Problem Statementmentioning

confidence: 99%

Optimization of garbage removal within a territorial community

Bihun

Lytvyn

2022

EEJET

View full text Add to dashboard Cite

This paper proposes an algorithm for optimizing the garbage collection route in a local community (or a separate settlement). The study was conducted for one garbage truck. To achieve the maximum efficiency of the algorithm, it has been assumed that the points of discharge of collected waste by a garbage truck could be arranged along the way between the proposed clusters of garbage collection points. The optimization of the built routes has been proven, taking into consideration the above assumptions. The study's results could be used to reduce the budget expenditures by territorial community authorities for the collection and disposal of waste. The reported solutions could significantly shorten the garbage collection time, which would improve the environmental and aesthetic situation within the study area. The use of a new algorithm makes it possible to display the results both in quantitative and qualitative forms. An improved k-means algorithm with a maximum cluster size was selected for clustering. Each cluster was built on the basis of the maximal value of garbage truck tonnage. That means that the size of the cluster would be determined by the value of the maximum amount of waste that can be removed by a garbage truck in one run. A task of the traveling salesman was applied to find the shortest path between representatives of one cluster (garbage collection points) calling at all its points and to establish the optimal path between all the clusters formed for a territorial community. The issue related to efficient waste disposal in local communities tends to aggravate rapidly while the task to optimize garbage collection and removal is becoming increasingly acute. This is because at present, along with the increase in the global population, all types of production are increasing their volumes, which, in turn, leads to an increase in the amount of waste, in particular, household.

show abstract

Section: Literature Review and Problem Statementmentioning

confidence: 99%

Optimization of garbage removal within a territorial community

Bihun

Lytvyn

2022

EEJET

View full text Add to dashboard Cite

show abstract

“…It suggested improving engineering problems through coordinated solid waste management, but life cycle and energy impact assessment is a primary method [42] [43]. Heuristic and metaheuristic approaches seek to solve a realworld problem; therefore, developing this research in the future is potentially considered [44].…”

Section: Content Analysis Findingsmentioning

confidence: 99%

Prospects and challenges of ripple spreading algorithm for waste collection path optimization problem in Indonesia

Miftahadi

Ramadan

Rachman

et al. 2022

IOP Conf. Ser.: Earth Environ. Sci.

View full text Add to dashboard Cite

Nowadays, countering the complexity of waste collection path optimization problems (POP) are reliably solved through evolutionary computation (EC). However, a sustainable collection strategy requires a specific rule and outcome for a given route network. Most waste managers are concerned with expenditure, work hours, and ecological footprints, combined with model flexibility to mimic real-life execution for the specific study case. Contemporary stochastic and deterministic POP methods are every so often confronted with optimality and scalability. Beyond its predecessor, namely the A* and the Dijkstra algorithm, a fundamental nature-based deterministic algorithm called a Ripple-Spreading Algorithm (RSA) had performed a straightforward heuristic evaluation. This study investigates prospects and future challenges in developing the RSA simulation based on Indonesia’s waste management scope. Specific overseas theme literature was employed to explore the possible research setting.

show abstract

“…This work addresses finding the shortest path using the Cohort Intelligence algorithm for BMW management with the consideration of human risk. Finally, the readers are encouraged to study a recent review related to the Waste Collection Routing Problem (WCRP) (Liang et al [27]). This paper provides a mini-review of the latest approaches and their application in collecting and routing waste.…”

Section: State Of the Artmentioning

confidence: 99%

A Mathematical Model for Scheduling and Assignment of Customers in Hospital Waste Collection Routes

2021

View full text Add to dashboard Cite

The collection, transport, and final disposal of hospital waste may cause contamination and disease if improperly handled. Therefore, such residues are hazardous to the health of waste collectors. These wastes are generated by public agencies, such as hospitals, family health centers, dialysis centers, and private healthcare providers. In this study, a mixed-integer linear programming model is proposed for monthly customer scheduling and route assignment. The proposed approach was fulfilled according to customers’ collection frequency, truck capacity, and customer geographical location. The proposed mathematical model successfully balanced the number of customers and the workload during each day. The effectiveness of the proposed model was tested on data obtained from a waste collection company. The model has been implemented in AMPL language, and the performance of commercial solvers, GUROBI and CPLEX, to obtain an optimal solution were tested. The results show the efficiency of the proposed approach to balance the workload concerning previous scheduling is done ad hoc at the company. The use of the formulated model provides an automatic procedure that was previously performed manually. The methodology can be adapted to other companies with similar requirements.

show abstract

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

Cited by 25 publications

References 58 publications

Optimization of garbage removal within a territorial community

Optimization of garbage removal within a territorial community

Prospects and challenges of ripple spreading algorithm for waste collection path optimization problem in Indonesia

A Mathematical Model for Scheduling and Assignment of Customers in Hospital Waste Collection Routes

Contact Info

Product

Resources

About