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

DOI10.1016/J.EJOR.2024.01.049MaRDI QIDQ6565397FDO

Authors Kamyla Maria Ferreira, Thiago Alves de Queiroz, Pedro Munari, Franklina M. B. Toledo

Publication date 2 July 2024

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

vehicle routing problemvariable neighborhood searchgreenhouse gas emissionssplit deliverytwo-dimensional loading constraints

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• A branch and bound algorithm for the strip packing problem
• 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
• A new constraint programming approach for the orthogonal packing problem
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A review of recent research on green road freight transportation
• A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
• A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
• A variable neighborhood search heuristic for periodic routing problems
• A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
• An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints
• An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• An iterated local search heuristic for the split delivery vehicle routing problem
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• Development of a fuel consumption optimization model for the capacitated vehicle routing problem
• Grids for cutting and packing problems: a study in the 2D knapsack problem
• Integrated distribution and loading planning via a compact metaheuristic algorithm
• Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time
• New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
• Particle swarm optimization for split delivery vehicle routing problem
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• Solution validator and visualizer for (combined) vehicle routing and container loading problems
• The Meet-in-the-Middle Principle for Cutting and Packing Problems
• 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
• The static stability of support factor‐based rectangular packings: an assessment by regression analysis
• The value of integrating loading and routing
• The vehicle routing problem. Latest advances and new challenges.
• Variable neighborhood search
• Variable neighborhood search for vehicle routing problem with multiple time windows
• Vehicle Routing
• Vehicle routing problems with loading constraints: state-of-the-art and future directions
• Vehicle routing problems with split deliveries
• Vehicle routing to minimize time-dependent emissions in urban areas
• Vehicle routing with split deliveries

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)