Pages that link to "Item:Q702720"

The following pages link to Competitive memetic algorithms for arc routing problems (Q702720):

Displaying 48 items.

• A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105) (← links)
• Local search heuristics for sectoring routing in a household waste collection context (Q323486) (← 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)
• Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
• Crossover iterated local search for SDCARP (Q489138) (← links)
• A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem (Q506144) (← links)
• A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (Q609809) (← links)
• Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
• An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems (Q841604) (← 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)
• Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions (Q964850) (← links)
• A memetic algorithm for the team orienteering problem (Q972625) (← links)
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem (Q976006) (← links)
• A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
• An improved heuristic for the capacitated arc routing problem (Q1010273) (← links)
• Heuristic methods for the sectoring arc routing problem (Q1041923) (← links)
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands (Q1043246) (← 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)
• The dynamic bowser routing problem (Q1711454) (← links)
• Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities (Q1722978) (← 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)
• Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities (Q1755810) (← 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)
• Evolutionary algorithms for periodic arc routing problems (Q1772855) (← links)
• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition (Q2123554) (← links)
• Integration of routing into a resource-constrained project scheduling problem (Q2175371) (← links)
• A guided local search procedure for the multi-compartment capacitated arc routing problem (Q2270452) (← links)
• A memetic algorithm with dynamic population management for an integrated production-distribution problem (Q2378412) (← links)
• Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039) (← links)
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
• A genetic algorithm for a bi-objective capacitated arc routing problem (Q2496047) (← links)
• A scatter search for the periodic capacitated arc routing problem (Q2570158) (← links)
• The commodity-split multi-compartment capacitated arc routing problem (Q2664322) (← links)
• A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands (Q2668800) (← links)
• A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW (Q2942382) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• Tour splitting algorithms for vehicle routing problems (Q3114307) (← links)
• New Notation and Classification Scheme for Vehicle Routing Problems (Q5247680) (← links)
• A variable neighborhood descent algorithm for a real waste collection problem with mobile depots (Q5488252) (← links)
• Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems (Q6062003) (← links)
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)
• Solving the large-scale min-max \(k\)-rural postman problem for snow plowing (Q6496352) (← links)