The multi-period multi-trip container drayage problem with release and due dates
From MaRDI portal
Publication:2664453
DOI10.1016/j.cor.2020.105102zbMath1458.90063OpenAlexW3087047706MaRDI QIDQ2664453
Maurizio Bruglieri, Simona Mancini, R. Peruzzini, Ornella Pisacane
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11311/1159172
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (3)
The multi-trip container drayage problem with synchronization for efficient empty containers re-usage ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties ⋮ A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition
Uses Software
Cites Work
- Unnamed Item
- Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
- A combinatorial Benders' decomposition for the lock scheduling problem
- A branch-and-price approach for a multi-period vehicle routing problem
- Multi-period vehicle routing problem with due dates
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- Improved modeling and solution methods for the multi-resource routing problem
- Heuristic-based truck scheduling for inland container transportation
- A local search heuristic for the pre- and end-haulage of intermodal container terminals
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- Combinatorial Benders cuts for assembly line balancing problems with setups
- A variable neighborhood search heuristic for periodic routing problems
- A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
- A memetic algorithm for the multi trip vehicle routing problem
- Generalized Benders decomposition
- Combinatorial Benders' Cuts for the Strip Packing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Combinatorial Benders Cuts for the Minimum Tollbooth Problem
- The multi-trip vehicle routing problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Vehicle Routeing with Multiple Use of Vehicles
- Optimization of the drayage problem using exact methods
- Vehicle routing problems with multiple trips
This page was built for publication: The multi-period multi-trip container drayage problem with release and due dates
