A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
From MaRDI portal
Publication:6088117
DOI10.1111/itor.12570OpenAlexW2811383260MaRDI QIDQ6088117
Sardar M. N. Islam, Carlos A. Vega-Mejía, Jairo R. Montoya-Torres
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12570
weight distributiontime windowsnonlinear mixed integer programbalanced vehiclesvehicle loading problem with loading constraintsweight capacityweight-bearing strength
Related Items (4)
The split delivery vehicle routing problem with time windows and three-dimensional loading constraints ⋮ Multi-objective vehicle routing and loading with time window constraints: a real-life application ⋮ The split delivery vehicle routing problem with three-dimensional loading constraints ⋮ The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
Cites Work
- A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
- Packing first, routing second -- a heuristic for the vehicle routing and loading problem
- Exact algorithms for the double vehicle routing problem with multiple stacks
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
- The three-dimensional knapsack problem with balancing constraints
- Routing problems with loading constraints
- A novel hybrid tabu search approach to container loading
- An integrated approach to the vehicle routing and container loading problems
- Finished-vehicle transporter routing problem solved by loading pattern discovery
- Heuristic-based truck scheduling for inland container transportation
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- The value of integrating loading and routing
- The pickup and delivery traveling salesman problem with handling costs
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
- Solving container loading problems by block arrangement
- Rich routing problems arising in supply chain management
- Constraints in container loading -- a state-of-the-art review
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- An improved typology of cutting and packing problems
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods
- An Algorithm for Two-Dimensional Cutting Problems
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
- Scheduling
- A hybrid genetic algorithm for the container loading problem
This page was built for publication: A nonlinear optimization model for the balanced vehicle routing problem with loading constraints
