Pages that link to "Item:Q975995"
From MaRDI portal
The following pages link to Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows (Q975995):
Displaying 9 items.
- Transshipment service through crossdocks with both soft and hard time windows (Q763197) (← links)
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem (Q1634089) (← links)
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
- The windy rural postman problem with a time-dependent zigzag option (Q1751757) (← links)
- Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach (Q2356026) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands (Q6092639) (← links)
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)