Pages that link to "Item:Q375990"

The following pages link to A multi-space sampling heuristic for the vehicle routing problem with stochastic demands (Q375990):

Displaying 12 items.

• Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs (Q895762) (← links)
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← links)
• A relax-and-repair heuristic for the swap-body vehicle routing problem (Q1695791) (← links)
• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation (Q2003563) (← links)
• The doubly open park-and-loop routing problem (Q2147024) (← links)
• Combined maintenance and routing optimization for large-scale sewage cleaning (Q2178360) (← links)
• Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption (Q2361135) (← links)
• A survey on matheuristics for routing problems (Q2513752) (← links)
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (Q2664372) (← links)
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem (Q5963105) (← links)
• An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup (Q6164581) (← links)
• An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands (Q6167539) (← links)