A simheuristic algorithm for time-dependent waste collection management with stochastic travel times
DOI10.2436/20.8080.02.103zbMATH Open1472.90013OpenAlexW3152264512MaRDI QIDQ5158698FDOQ5158698
Authors: Aljoscha Gruler, Antoni Perez-Navarro, Laura Calvet, Angel A. Juan 
Publication date: 26 October 2021
Full work available at URL: http://openaccess.uoc.edu/webapps/o2/bitstream/10609/127049/1/44.2.3.Gruler-etal.pdf
Recommendations
- A hybrid metaheuristic for smart waste collection problems with workload concerns
- Vehicle routing-scheduling for waste collection in Hanoi
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- Waste collection vehicle routing problem with time windows
- Metaheuristics with disposal facility positioning for the waste collection VRP with time windows
stochastic optimizationvehicle routing problemcase studywaste collection managementbiased randomizationsimheuristics
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance
- Vehicle dispatching with time-dependent travel times
- A review of dynamic vehicle routing problems
- Recyclable waste collection planning -- a case study
- Dynamic programming based metaheuristics for the dial-a-ride problem
- Waste collection vehicle routing problem with time windows
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- Vehicle routing with stochastic time-dependent travel times
- Time-dependent routing problems: a review
- Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
- Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
- A period vehicle routing case study
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management
- A biased-randomized metaheuristic for the capacitated location routing problem
- A statistical learning based approach for parameter fine-tuning of metaheuristics
- A stochastic inventory routing problem for infectious medical waste collection
Cited In (5)
- Waste collection routing: a survey on problems and methods
- A hybrid metaheuristic for smart waste collection problems with workload concerns
- Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment
- A stochastic inventory routing problem for infectious medical waste collection
- An Optimization Approach for the Crew Scheduling Problem in Waste Management
This page was built for publication: A simheuristic algorithm for time-dependent waste collection management with stochastic travel times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5158698)
