Routing problems with loading constraints

DOI10.1007/s11750-010-0144-xzbMath1279.90146OpenAlexW2050841472MaRDI QIDQ610992

Silvano Martello, Manuel Iori

Publication date: 13 December 2010

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-010-0144-x

zbMATH Keywords

vehicle routingtraveling salesmanloadingtwo-dimensional packingpickup and deliverythree-dimensional packing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen, A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints, Rich vehicle routing problems: from a taxonomy to a definition, A hybrid algorithm for constrained order packing, The pickup and delivery problem with time windows, multiple stacks, and handling operations, Solving the 3-D yard allocation problem for break bulk cargo via variable neighborhood search branching, Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints, A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints, The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach, The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints, A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints, A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls, A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem, A hybrid approach for the vehicle routing problem with three-dimensional loading constraints, An effective tabu search approach with improved loading algorithms for the 3L-CVRP, Solving a large multicontainer loading problem in the car manufacturing industry, Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks, Exact algorithms for the double vehicle routing problem with multiple stacks, Routing and scheduling in project shipping, A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, A weighted-sum method for solving the bi-objective traveling thief problem, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints, The pallet-loading vehicle routing problem with stability constraints, Formulations for the orienteering problem with additional constraints, Finished-vehicle transporter routing problem solved by loading pattern discovery, The double traveling salesman problem with partial last‐in‐first‐out loading constraints, A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints, A nonlinear optimization model for the balanced vehicle routing problem with loading constraints, A large neighbourhood search algorithm for solving container loading problems, Multi-objective vehicle routing and loading with time window constraints: a real-life application, Modeling soft unloading constraints in the multi-drop container loading problem, The tree representation for the pickup and delivery traveling salesman problem with LIFO loading, A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows, Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system, The value of integrating loading and routing, A new load balance methodology for container loading problem in road transportation, Inventory routing with pickups and deliveries, The traveling salesman problem with draft limits, A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints, Efficient algorithms for the double traveling salesman problem with multiple stacks, Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs, Vehicle routing problems with loading constraints: state-of-the-art and future directions, Exact solution techniques for two-dimensional cutting and packing, Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows, The split delivery vehicle routing problem with three-dimensional loading constraints, Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet, A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions, A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations, The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale, Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach, Efficiently solving the traveling thief problem using hill climbing and simulated annealing, Pickup and delivery problem with incompatibility constraints, An optimization model for the vehicle routing problem with practical three-dimensional loading constraints, Integrated distribution and loading planning via a compact metaheuristic algorithm, 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, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• TSPLIB
• Algorithm 864
• VRP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic and exact algorithms for the multi-pile vehicle routing problem
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
• New neighborhood structures for the double traveling salesman problem with multiple stacks
• An integrated approach to the vehicle routing and container loading problems
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• Recent advances in vehicle routing exact algorithms
• A heuristic for the multi-period petrol station replenishment problem
• The vehicle routing problem. Latest advances and new challenges.
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Ant colony optimization for the two-dimensional loading vehicle routing problem
• The petrol station replenishment problem with time windows
• The pickup and delivery traveling salesman problem with first-in-first-out loading
• Bidimensional packing by bilinear programming
• Exact algorithms for the two-dimensional strip packing problem with and without rotations
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Metaheuristics for vehicle routing problems with three-dimensional loading constraints
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• The traveling salesman. Computational solutions for RSP applications
• Solving a fuel delivery problem by heuristic and exact approaches.
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• The two-dimensional finite bin packing problem. II: New lower and upper bounds
• The traveling salesman problem and its variations
• New lower bounds for the three-dimensional finite bin packing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
• A unified exact method for solving different classes of vehicle routing problems
• A new constraint programming approach for the orthogonal packing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• An improved typology of cutting and packing problems
• A heuristic for the three-dimensional strip packing problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The Truck Dispatching Problem
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• Guided Local Search for the Three-Dimensional Bin-Packing Problem
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
• An exact method for the double TSP with multiple stacks
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• A combined ship scheduling and allocation problem
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• Container loading with multi-drop constraints
• Orthogonal Packings in Two Dimensions
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A Heuristic Algorithm for the Auto-Carrier Transportation Problem
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• The Three-Dimensional Bin Packing Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Dispatching Petroleum Products
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Metaheuristics for the vehicle routing problem with loading constraints
• Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
• An exact algorithm for the petrol station replenishment problem
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints