A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery

Cites Work

Title not available (Why is that?)
Integrated distribution and loading planning via a compact metaheuristic algorithm
A review of recent research on green road freight transportation
Branch-and-cut algorithms for the split delivery vehicle routing problem
A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
Vehicle routing to minimize time-dependent emissions in urban areas
An iterated local search heuristic for the split delivery vehicle routing problem
The vehicle routing problem. Latest advances and new challenges.
A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
A branch and bound algorithm for the strip packing problem
Vehicle routing with split deliveries
Variable neighborhood search
A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
The value of integrating loading and routing
Development of a fuel consumption optimization model for the capacitated vehicle routing problem
Variable neighborhood search for vehicle routing problem with multiple time windows
Vehicle routing problems with loading constraints: state-of-the-art and future directions
Grids for cutting and packing problems: a study in the 2D knapsack problem
Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
A column generation-based heuristic for the split delivery vehicle routing problem with time windows
The split delivery vehicle routing problem with three-dimensional loading constraints
A variable neighborhood search heuristic for periodic routing problems
A new constraint programming approach for the orthogonal packing problem
An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
Vehicle Routing
An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
Particle Swarm Optimization for Split Delivery Vehicle Routing Problem
New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
Vehicle routing problems with split deliveries
The Meet-in-the-Middle Principle for Cutting and Packing Problems
A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
Recursive Computational Procedure for Two-dimensional Stock Cutting
Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time
The static stability of support factor‐based rectangular packings: an assessment by regression analysis
Solution validator and visualizer for (combined) vehicle routing and container loading problems

This page was built for publication: A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565397)