Pages that link to "Item:Q953311"

The following pages link to A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311):

Displaying 26 items.

• A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105) (← links)
• A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← 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)
• Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
• Location-arc routing problem: heuristic approaches and test instances (Q336937) (← links)
• Variable neighborhood search for location routing (Q339539) (← links)
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities (Q342292) (← links)
• An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326) (← links)
• Crossover iterated local search for SDCARP (Q489138) (← links)
• A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem (Q506144) (← links)
• Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
• Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← 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)
• Heuristics for routing heterogeneous unmanned vehicles with fuel constraints (Q1717710) (← links)
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← 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)
• A fast metaheuristic for the travelling salesperson problem with hotel selection (Q2342916) (← links)
• New large-scale data instances for CARP and new variations of CARP (Q5882245) (← links)
• Solving vehicle routing problems with intermediate stops using VRPSolver models (Q6179690) (← links)
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)