Pages that link to "Item:Q941537"

The following pages link to A deterministic tabu search algorithm for the capacitated arc routing problem (Q941537):

Displaying 26 items.

• A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105) (← links)
• Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
• GRASP with evolutionary path-relinking for the capacitated arc routing problem (Q336740) (← links)
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities (Q342292) (← links)
• Crossover iterated local search for SDCARP (Q489138) (← links)
• A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem (Q506144) (← links)
• The open capacitated arc routing problem (Q716347) (← links)
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
• Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows (Q975995) (← links)
• Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
• Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration (Q1046714) (← links)
• An efficiency-based path-scanning heuristic for the capacitated arc routing problem (Q1634089) (← links)
• Two phased hybrid local search for the periodic capacitated arc routing problem (Q1694314) (← links)
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem (Q1761166) (← links)
• Capacitated arc routing problem with deadheading demands (Q1761173) (← links)
• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition (Q2123554) (← links)
• A guided local search procedure for the multi-compartment capacitated arc routing problem (Q2270452) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• Tour splitting algorithms for vehicle routing problems (Q3114307) (← links)
• An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances (Q5131730) (← links)
• Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems (Q6062003) (← links)
• On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
• Effects of update frequencies in a dynamic capacitated arc routing problem (Q6092644) (← links)
• A parameterized lower bounding method for the open capacitated arc routing problem (Q6491347) (← links)