Pages that link to "Item:Q1652293"
From MaRDI portal
The following pages link to A fast two-level variable neighborhood search for the clustered vehicle routing problem (Q1652293):
Displaying 14 items.
- Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
- A unified exact approach for clustered and generalized vehicle routing problems (Q2108132) (← links)
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem (Q2147041) (← links)
- Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem (Q2147064) (← links)
- Data-driven optimization and statistical modeling to improve meter reading for utility companies (Q2147136) (← links)
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
- Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
- The clustered team orienteering problem (Q2273693) (← links)
- Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection (Q2331437) (← links)
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
- The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem (Q2668601) (← links)
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
- A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem (Q6088247) (← links)
- Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery (Q6106970) (← links)