Pages that link to "Item:Q2329717"
From MaRDI portal
The following pages link to Adaptive large neighborhood search for the commodity constrained split delivery VRP (Q2329717):
Displaying 10 items.
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem (Q342059) (← links)
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
- The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints (Q2669481) (← links)
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
- A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
- Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge (Q6092665) (← links)
- Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand (Q6551134) (← links)
- Vehicle routing problems with multiple commodities: a survey (Q6572828) (← links)
- An adaptive large neighborhood search for the multi-point dynamic aggregation problem (Q6636938) (← links)
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem (Q6659085) (← links)
