The value of integrating loading and routing
From MaRDI portal
Publication:1752774
DOI10.1016/j.ejor.2016.06.072zbMath1394.90084OpenAlexW2467644063MaRDI QIDQ1752774
Jean-François Côté, G. Guastaroba, Maria Grazia Speranza
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.06.072
worst-case analysisloading constraintsvehicle routing problemsorthogonal packingintegration in logistics
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
The pickup and delivery problem with time windows, multiple stacks, and handling operations, A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints, Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints, A mathematical programming-based heuristic for the production routing problem with transshipments, An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery, The pallet-loading vehicle routing problem with stability constraints, Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern, A nonlinear optimization model for the balanced vehicle routing problem with loading constraints, Multi-objective vehicle routing and loading with time window constraints: a real-life application, A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, Inventory routing with pickups and deliveries, The split delivery vehicle routing problem with three-dimensional loading constraints, The inventory replenishment policy in an uncertain production-inventory-routing system
Uses Software
Cites Work
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- A survey of recent research on location-routing problems
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- Editorial: Integrated vehicle routing problems
- The production routing problem: a review of formulations and solution algorithms
- A survey on two-echelon routing problems
- An exact strip packing algorithm based on canonical forms
- Heuristics for the strip packing problem with unloading constraints
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Routing problems with loading constraints
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Bidimensional packing by bilinear programming
- A branch and bound algorithm for the strip packing problem
- The effect of ignoring routes when locating depots
- Coordination of production and distribution planning
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Constraints in container loading -- a state-of-the-art review
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A survey of variants and extensions of the location-routing problem
- A new exact method for the two-dimensional orthogonal packing problem
- An Exact Approach to the Strip-Packing Problem
- Combinatorial Benders' Cuts for the Strip Packing Problem
- An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
- An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
