Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain
From MaRDI portal
Publication:1735180
DOI10.1016/j.ejor.2019.02.025zbMath1430.90134OpenAlexW2913170177MaRDI QIDQ1735180
Pedro Amorim, Jussi Rasinmäki, Ricardo Soares, Alexandra Marques
Publication date: 28 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/8312
Related Items
Resources synchronization in a full truckload pickup and delivery problem: an exact approach ⋮ A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem ⋮ Mixed-integer linear optimization for full truckload pickup and delivery ⋮ Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters ⋮ Synchronizing victim evacuation and debris removal: a data-driven robust prediction approach
Cites Work
- Unnamed Item
- A generic mathematical model to optimise strategic and tactical decisions in biomass-based supply chains (OPTIMASS)
- A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations
- Truck and trailer routing -- problems, heuristics and computational experience
- An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
- A large neighbourhood search heuristic for ship routing and scheduling with split loads
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- A hybrid method based on linear programming and tabu search for routing of logging trucks
- Solving the truck and trailer routing problem based on a simulated annealing heuristic
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- The pickup and delivery problem with time windows and handling operations
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
- Synchronized routing of active and passive means of transport
- A tabu search heuristic for the truck and trailer routing problem
- The Truck Dispatching Problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Improving Discrete Model Representations via Symmetry Considerations
- A near-exact method for solving the log-truck scheduling problem
- A unified tabu search heuristic for vehicle routing problems with time windows
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- A tabu search method for the truck and trailer routing problem
This page was built for publication: Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain
