Pages that link to "Item:Q1738815"
From MaRDI portal
The following pages link to Efficiently solving very large-scale routing problems (Q1738815):
Displaying 24 items.
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- A practical heuristic for a large scale vehicle routing problem (Q1197957) (← links)
- Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
- New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
- Heuristics for large constrained vehicle routing problems (Q1854901) (← links)
- Heuristic optimization for multi-depot vehicle routing problem in ATM network model (Q2087124) (← links)
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- Very large-scale vehicle routing: new test problems, algorithms, and results (Q2485169) (← links)
- A review of vehicle routing with simultaneous pickup and delivery (Q2664320) (← links)
- A study on the pickup and delivery problem with time windows: matheuristics and new instances (Q2664415) (← 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)
- Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations (Q2669602) (← links)
- Adjusting the order crossover operator for capacitated vehicle routing problems (Q2676389) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery (Q6106970) (← links)
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots (Q6167324) (← links)
- An improved hybrid genetic search with data mining for the CVRP (Q6541031) (← links)
- Routing one million customers in a handful of minutes (Q6551178) (← links)
- Waste collection routing: a survey on problems and methods (Q6558657) (← links)
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks (Q6602334) (← links)
- Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques (Q6659088) (← links)