Pages that link to "Item:Q2475858"
From MaRDI portal
The following pages link to Solving an urban waste collection problem using ants heuristics (Q2475858):
Displaying 15 items.
- The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
- Sustainable operations (Q323159) (← links)
- Local search heuristics for sectoring routing in a household waste collection context (Q323486) (← links)
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities (Q342292) (← links)
- The capacitated general windy routing problem with turn penalties (Q433125) (← links)
- Lower bounds for the mixed capacitated arc routing problem (Q1040970) (← links)
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
- ARC: A computerized system for urban garbage collection (Q1804557) (← links)
- A bi-objective modeling approach applied to an urban semi-desirable facility location problem (Q1927006) (← links)
- Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study (Q2001870) (← links)
- (Q2772611) (← links)
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (Q2802246) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- New large-scale data instances for CARP and new variations of CARP (Q5882245) (← links)
- A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms (Q6115587) (← links)