Routing problems with loading constraints

DOI10.1007/S11750-010-0144-XzbMATH Open1279.90146OpenAlexW2050841472MaRDI QIDQ610992FDOQ610992

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

Recommendations

• Comments on: Routing problems with loading constraints
• Comments on: Routing problems with loading constraints
• Comments on: Routing problems with loading constraints
• Comments on: Routing problems with loading constraints
• Comments on: Routing Problems with loading constraints
• Rejoinder on: Routing problems with loading constraints
• Computational Science – ICCS 2005
• Vehicle routing problems with loading constraints: state-of-the-art and future directions
• Vehicle routing with full loads

zbMATH Keywords

two-dimensional packingvehicle routingpickup and deliveryloadingtraveling salesmanthree-dimensional packing

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (66)

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

Uses Software

• TSPLIB
• Algorithm 864
• VRP
• CVRPSP

This page was built for publication: Routing problems with loading constraints

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