Pages that link to "Item:Q1577774"
From MaRDI portal
The following pages link to Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees (Q1577774):
Displaying 14 items.
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
- Crossover iterated local search for SDCARP (Q489138) (← links)
- A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem (Q613548) (← links)
- A deterministic tabu search algorithm for the capacitated arc routing problem (Q941537) (← links)
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
- Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration (Q1046714) (← links)
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
- A dynamic vehicle routing problem with time-dependent travel times (Q1781571) (← links)
- A guided local search heuristic for the capacitated arc routing problem (Q1873009) (← links)
- Multi-depot rural postman problems (Q2408522) (← links)
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
- A scatter search for the periodic capacitated arc routing problem (Q2570158) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
