On vehicle routing problems with loading constraints
From MaRDI portal
Cites work
- A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Constraints in container loading -- a state-of-the-art review
- Efficiently solving very large-scale routing problems
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- Integrated packing and routing: a model and its solutions
- Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints
- Routing problems with loading constraints
- The value of integrating loading and routing
- The vehicle routing problem
- Two-dimensional bin packing problems
- Two-dimensional packing problems: a survey
This page was built for publication: On vehicle routing problems with loading constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307388)
