Pages that link to "Item:Q1064973"

The following pages link to The fleet size and mix problem for capacitated arc routing (Q1064973):

Displaying 38 items.

• A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105) (← links)
• Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← 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)
• Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
• A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem (Q506144) (← links)
• Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
• A memetic algorithm for the team orienteering problem (Q972625) (← links)
• Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
• A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem (Q1014948) (← links)
• Heuristic methods for the sectoring arc routing problem (Q1041923) (← links)
• An efficiency-based path-scanning heuristic for the capacitated arc routing problem (Q1634089) (← links)
• An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
• Hybrid genetic algorithm for the open capacitated arc routing problem (Q1652524) (← links)
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
• Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities (Q1755810) (← links)
• Capacitated arc routing problem with deadheading demands (Q1761173) (← links)
• Heuristic method for a mixed capacitated arc routing problem: A refuse collection application (Q1887872) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Solving the length constrained \(K\)-drones rural postman problem (Q2030543) (← links)
• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition (Q2123554) (← links)
• Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039) (← links)
• A genetic algorithm for a bi-objective capacitated arc routing problem (Q2496047) (← links)
• Road network monitoring: algorithms and a case study (Q2496049) (← links)
• Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• Tour splitting algorithms for vehicle routing problems (Q3114307) (← links)
• A Decade of Capacitated Arc Routing (Q3564348) (← links)
• Combinatorial optimization and green logistics (Q5900891) (← links)
• Combinatorial optimization and green logistics (Q5925286) (← links)
• An improved multi-objective framework for the rich arc routing problem (Q6047893) (← links)
• Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems (Q6062003) (← links)
• Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems (Q6087523) (← links)
• On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)
• The multi‐purpose <i>K</i>‐drones general routing problem (Q6180030) (← links)
• Solving the large-scale min-max \(k\)-rural postman problem for snow plowing (Q6496352) (← links)