Pages that link to "Item:Q2564754"
From MaRDI portal
The following pages link to Heuristic approaches to vehicle routing with backhauls and time windows (Q2564754):
Displaying 15 items.
- A deterministic iterated local search algorithm for the vehicle routing problem with backhauls (Q301395) (← links)
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints (Q319021) (← links)
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries (Q707138) (← links)
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem (Q709128) (← links)
- A unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) (← links)
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up (Q859684) (← links)
- Self-organizing feature maps for the vehicle routing problem with backhauls (Q880535) (← links)
- Comparing backhauling strategies in vehicle routing using ant colony optimization (Q926337) (← links)
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries (Q927194) (← links)
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls (Q1607978) (← links)
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows (Q1651548) (← links)
- Vehicle routing with backhauls: review and research perspectives (Q1652540) (← links)
- Multi-trip pickup and delivery problem with time windows and synchronization (Q1695786) (← links)
- Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints (Q1754159) (← links)
- Routing problems: A bibliography (Q1908308) (← links)