Pages that link to "Item:Q337288"
From MaRDI portal
The following pages link to An iterated local search heuristic for the split delivery vehicle routing problem (Q337288):
Displaying 25 items.
- A novel hybrid multi-objective immune algorithm with adaptive differential evolution (Q337634) (← links)
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads (Q724007) (← links)
- Alternative evaluation functions for the cyclic bandwidth sum problem (Q1631512) (← links)
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem (Q1652142) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
- The static bike relocation problem with multiple vehicles and visits (Q1681499) (← links)
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem (Q1694919) (← links)
- A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems (Q1711659) (← links)
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
- New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165) (← links)
- Integer programming formulations and efficient local search for relaxed correlation clustering (Q2052402) (← links)
- Neural large neighborhood search for routing problems (Q2093389) (← links)
- Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
- A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection (Q2668646) (← links)
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q2669556) (← links)
- A novel approach to solve the split delivery vehicle routing problem (Q2968484) (← links)
- Particle Swarm Optimization for Split Delivery Vehicle Routing Problem (Q4642133) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand (Q6551134) (← links)
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q6565397) (← links)
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem (Q6659085) (← links)