Column generation-based matheuristic for pickup and delivery problem with two-dimensional loading

DOI10.1016/J.COR.2025.107300MaRDI QIDQ6855228zbMATH OpenFDO

Authors Ohhyun Kweon, Byung-In Kim

Publication date 23 February 2026

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2025.107300

zbMATH Keywords

column generationlogic-based Benders decompositionmatheuristicopen space-based packing heuristicspickup and delivery problemtwo-dimensional loading constraints

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
• A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
• A guided tabu search 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 New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• 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 two‐dimensional loading constraints
• A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
• A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• 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 open space based heuristic for the 2D strip packing problem with unloading constraints
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
• Decomposition Principle for Linear Programs
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
• Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks
• Heuristic and exact algorithms for the multi-pile vehicle routing problem
• Metaheuristics for the vehicle routing problem with loading constraints
• Routing problems with loading constraints
• The multiple vehicle pickup and delivery problem with LIFO constraints
• The pickup and delivery problem with time windows
• The pickup and delivery problem with time windows, multiple stacks, and handling operations
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• The value of integrating loading and routing
• The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints
• Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
• Vehicle routing problems with loading constraints: state-of-the-art and future directions

Cited in

(1)

• Pickup and delivery with time windows and two-dimensional loading for shipbuilding block transportation

This page was built for publication: Column generation-based matheuristic for pickup and delivery problem with two-dimensional loading

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