Pages that link to "Item:Q1041923"
From MaRDI portal
The following pages link to Heuristic methods for the sectoring arc routing problem (Q1041923):
Displaying 18 items.
- The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← 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)
- Metaheuristics with disposal facility positioning for the waste collection VRP with time windows (Q375982) (← links)
- A hybrid hypercube - genetic algorithm approach for deploying many emergency response mobile units in an urban network (Q531449) (← links)
- Towards a stochastic programming modeling framework for districting (Q827113) (← links)
- Visual attractiveness in routing problems: a review (Q1634050) (← links)
- A districting-based heuristic for the coordinated capacitated arc routing problem (Q2273678) (← links)
- The aircraft maintenance base location problem (Q2356276) (← links)
- Arc routing with trip-balancing and attractiveness measures -- a waste collection case study (Q2676339) (← links)
- A novel model for arc territory design: promoting Eulerian districts (Q2811937) (← links)
- Districting for Arc Routing (Q2940070) (← 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)
- Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems (Q6062003) (← links)
- Dynamic community partitioning for e-commerce last mile delivery with time window constraints (Q6068725) (← links)
- Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery (Q6106970) (← links)
- Approximation schemes for districting problems with probabilistic constraints (Q6106979) (← links)