Pages that link to "Item:Q1722960"
From MaRDI portal
The following pages link to Knowledge-guided local search for the vehicle routing problem (Q1722960):
Displaying 13 items.
- Efficiently solving very large-scale routing problems (Q1738815) (← links)
- Efficient approximation of the metric CVRP in spaces of fixed doubling dimension (Q2046271) (← links)
- Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension (Q2048811) (← links)
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986) (← links)
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem (Q2147041) (← links)
- A progressive filtering heuristic for the location-routing problem and variants (Q2668599) (← links)
- A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
- Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions (Q2676276) (← links)
- Adjusting the order crossover operator for capacitated vehicle routing problems (Q2676389) (← links)
- In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots (Q6167324) (← links)
- Binary well placement optimization using a decomposition-based multi-objective evolutionary algorithm with diversity preservation (Q6180108) (← links)
- A conceptually simple algorithm for the capacitated location-routing problem (Q6491328) (← links)
