Pages that link to "Item:Q323105"

The following pages link to A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105):

Displaying 18 items.

• Scheduling of maintenance work of a large-scale tramway network (Q724038) (← links)
• Heuristic search to the capacitated clustering problem (Q1622798) (← links)
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
• An efficiency-based path-scanning heuristic for the capacitated arc routing problem (Q1634089) (← links)
• A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection (Q1652522) (← links)
• Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (Q1652699) (← links)
• Two phased hybrid local search for the periodic capacitated arc routing problem (Q1694314) (← 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)
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints (Q1754303) (← links)
• Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
• Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← links)
• The commodity-split multi-compartment capacitated arc routing problem (Q2664322) (← links)
• A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection (Q2668646) (← links)
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)
• An updated annotated bibliography on arc routing problems (Q6496350) (← links)
• Integrating parcel delivery schedules with public transport networks in urban co-modality systems (Q6568470) (← links)
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery (Q6659827) (← links)