Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints
From MaRDI portal
Publication:6106775
DOI10.1016/j.ejor.2022.08.001OpenAlexW4290058881MaRDI QIDQ6106775
No author found.
Publication date: 3 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.08.001
mixed integer linear programmingroutingloading constraintscross-dockingtabu-based adaptive large neighborhood search
Cites Work
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A general heuristic for vehicle routing problems
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Exact and heuristic methods for optimizing lock-quay system in inland waterway
- Moving products between location pairs: cross-docking versus direct-shipping
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Multi-trip time-dependent vehicle routing problem with time windows
- A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
- Inbound and outbound flow integration for cross-docking operations
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
- The split delivery vehicle routing problem with three-dimensional loading constraints
- Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach
- Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking
- The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty: two robust bi-objective models
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
- An M/M/c queue model for vehicle routing problem in multi-door cross-docking environments
- The pallet-loading vehicle routing problem with stability constraints
- Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- Classification of Acceptance Criteria for the Simulated Annealing Algorithm
- Vehicle routing with cross-docking
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
This page was built for publication: Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints
