Pages that link to "Item:Q337416"
From MaRDI portal
The following pages link to An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416):
Displaying 16 items.
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints (Q323423) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints (Q1681135) (← links)
- A MIP-based slicing heuristic for three-dimensional bin packing (Q1686545) (← links)
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review (Q1730669) (← links)
- Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints (Q1754159) (← links)
- Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm (Q2027076) (← links)
- The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale (Q2077944) (← links)
- Multi-objective vehicle routing and loading with time window constraints: a real-life application (Q2196102) (← links)
- The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- The split delivery vehicle routing problem with time windows and three-dimensional loading constraints (Q6065202) (← links)
- The static stability of support factor‐based rectangular packings: an assessment by regression analysis (Q6092535) (← links)
- Solution validator and visualizer for (combined) vehicle routing and container loading problems (Q6165407) (← links)
- A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints (Q6195023) (← links)