Pages that link to "Item:Q2026973"
From MaRDI portal
The following pages link to A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments (Q2026973):
Displaying 22 items.
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads (Q724007) (← links)
- Real-time split-delivery pickup and delivery time window problems with transfers (Q940817) (← links)
- An empirical study on the benefit of split loads with the pickup and delivery problem (Q1042050) (← links)
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment (Q1761180) (← links)
- A comparison of two meta-heuristics for the pickup and delivery problem with transshipment (Q1782171) (← links)
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
- The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation (Q2083950) (← links)
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
- A large neighbourhood search metaheuristic for the contagious disease testing problem (Q2171555) (← links)
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
- Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics (Q2669614) (← links)
- The vessel swap-body routing problem (Q2673585) (← links)
- Pickup and delivery problem with split demand and transfers (Q2868783) (← links)
- EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197) (← links)
- Green split multiple-commodity pickup and delivery vehicle routing problem (Q6047862) (← links)
- Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery (Q6047877) (← links)
- Combining an LNS-based approach and organizational mining for the resource replacement problem (Q6065649) (← links)
- Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands (Q6164316) (← links)
- Integrating micro-depot freight transport in existing public transport services (Q6168362) (← links)
- A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network (Q6561217) (← links)
- An algorithm for flexible transshipments with perfect synchronization (Q6586221) (← links)
