Pages that link to "Item:Q1038331"
From MaRDI portal
The following pages link to Metaheuristics for vehicle routing problems with three-dimensional loading constraints (Q1038331):
Displayed 13 items.
- Routing problems with loading constraints (Q610992) (← links)
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (Q635160) (← links)
- Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem (Q709128) (← links)
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP (Q1761144) (← links)
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (Q1761159) (← links)
- MIP-based approaches for the container loading problem with multi-drop constraints (Q1761749) (← links)
- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints (Q2275601) (← links)
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints (Q2862156) (← links)
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints (Q2893344) (← links)
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks (Q4648688) (← links)
- A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770) (← links)
- A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779) (← links)