Enhanced Heuristic Algorithms With a Vehicle Travel Speed Model for Time-Dependent Vehicle Routing: A Waste Collection Problem

Mat, Nur Azriati; Benjamin, Aida Mauziah; Abdul-Rahman, Syariza

doi:10.32890/jict2018.17.1.4

Cited by 3 publications

(4 citation statements)

References 26 publications

(50 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A study from Mat et al (2018b) applied current initial solution (CIS) and DIC to solve WCVRP. The proposed algorithms were applied to solve the benchmark instances from Kim et al (2006) with the objective to minimize total travel distance.…”

Section: Waste Collection Vehicle Routing Problemmentioning

confidence: 99%

“…Similarly to VRP, WCRP has different variations based on the type of waste to be collected, for example, residential waste (usually produced in suburban areas), commercial waste (usually generated by restaurants, shopping malls, and other commercial establishments), and industrial waste (produced by construction sites, large shopping malls, or downtown areas; Golden et al, 2001). There are also variations in WCRP based on the type of constraints considered, such as WCRP with time windows (Campos and Arroyo, 2017; Sackmann et al, 2017), time-dependent WCRP (Mat et al, 2018b), WCRP with lunch-break and driver rest period constraint (Kim et al, 2006), WCRP with different fleet types (Hauge et al, 2014), and WCRP with a fixed dumpsite or with multiple dumpsites (Sackmann et al, 2017), in which, after giving service, the vehicle is not required to return to the depot from where it departed.…”

Section: Introductionmentioning

confidence: 99%

“…Another variation is time-dependent WCRP (Mat et al, 2018b), in which real-world time constraints may imply different traveling speeds due to time-dependent traffic conditions. When time windows constraints are taken into consideration, nodes (customers) can only be visited in a certain period or interval, defined by specific opening and closing hours.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Section: Waste Collection Vehicle Routing Problemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

2021

View full text Add to dashboard Cite

show abstract

“…For example, dataset 102 has two candidate landfill sites. Thus, the nearest greedy (NG) technique adopted from Mat et al, 2018) was executed twice with varied distance and travel time at each execution. In the first run, distance and travel time between the nodes were used based on the coordinate of candidate landfill 1.…”

Section: The New Approachmentioning

confidence: 99%

Nearest Greedy Algorithm for Solving a Single Landfill Site Selection With Resource Requirements

Mat¹,

Benjamin²,

Abdul-Rahman³

2020

J. Sustain. Sci. Manage.

Self Cite

View full text Add to dashboard Cite

Landfill site selection has appeared to be an important waste management issue for future landfill planning. The selection of suitable landfill sites involves several alternative sites, along with evaluation criteria. Previously, most studies solved the landfill site selection problem by using the geographic information systems (GIS) and the multiple criteria decision making (MCDM) methods. GIS is used to identify suitable sites for a new landfill, while MCDM is used to rank the candidate sites based on the score calculated for each site. With that this paper presents a new approach that ranks the related candidate sites. These candidate sites were ranked based on several vital resource requirements, such as total travel distance to transport collected waste to the landfill, number of vehicles/ drivers required for the collection and total working hours of drivers affect the operating cost of the selected landfill. To be precise, all requirements as described above have been provided when a particular site is selected as the new landfill. These resources are identified by using the heuristic technique, namely nearest greedy. This approach was further tested on a benchmark problem set, namely waste collection vehicle routing problem with time windows. The results serve to aid the waste management team to select the most suitable location for landfill siting, besides listing the influential resource requirements for landfill site selection planning in selecting a new landfill site.

show abstract

A multiperiod household waste collection system for a set of rural islands with dynamic transfer port selection

Zambra-Rivera,

Miranda-González,

Blazquez

2023

Optim Eng

View full text Add to dashboard Cite

Enhanced Heuristic Algorithms With a Vehicle Travel Speed Model for Time-Dependent Vehicle Routing: A Waste Collection Problem

Abstract: Rahman (2018). Enhanced heuristic algorithms with a vehicle travel speed model for time-dependent vehicle routing: A waste collection problem.

Cited by 3 publications

References 26 publications

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

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

Nearest Greedy Algorithm for Solving a Single Landfill Site Selection With Resource Requirements

A multiperiod household waste collection system for a set of rural islands with dynamic transfer port selection

Contact Info

Product

Resources

About