Pages that link to "Item:Q2099500"
From MaRDI portal
The following pages link to An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500):
Displaying 13 items.
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- Combination of local search and CLP in the vehicle-fleet scheduling problem (Q1278727) (← links)
- Using global search heuristics for the capacity vehicle routing problem. (Q1406639) (← links)
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
- A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
- Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
- Efficiently solving very large-scale routing problems (Q1738815) (← links)
- Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem (Q2331412) (← links)
- On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem (Q2467480) (← links)
- A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
- Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach (Q3087842) (← links)
- A generalized exchange heuristic for the capacitated vehicle routing problem (Q4697853) (← links)
- Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning (Q5111126) (← links)
