A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks
DOI10.1016/J.EJOR.2021.12.035OpenAlexW4206199958MaRDI QIDQ2140358FDOQ2140358
Authors: Quim Arnau, Eva Barrena, Javier Panadero, Rocio de la Torre, Angel A. Juan 
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.12.035
Recommendations
- A tabu search heuristic for the inland container transportation problem
- Heuristic-based truck scheduling for inland container transportation
- Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem
- Integrated planning of loaded and empty container movements
- Model and algorithm for container allocation problem with random freight demands in synchromodal transportation
heuristicsbiased-randomized heuristicsdiscrete-event heuristicsdynamic transport systemslarge-scale transport networks
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- Routing, ship size, and sailing frequency decision-making for a maritime hub-and-spoke container network
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
- A branch-and-cut algorithm for the team orienteering problem
- A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
- A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations
- Multi-start methods for combinatorial optimization
- Solving the team orienteering problem with cutting planes
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- A biased-randomized metaheuristic for the capacitated location routing problem
- An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
- Horizontal collaboration in freight transport: concepts, benefits and environmental challenges
- Why simheuristics? Benefits, limitations, and best practices when combining metaheuristics with simulation
Cited In (3)
- Real-time control of freight forwarder transportation networks by integrating multimodal transport chains
- A reinforcement learning approach to convoy scheduling on a contested transportation network
- Towards the physical internet paradigm: a model for transportation planning in complex road networks with empty return optimization
Uses Software
This page was built for publication: A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140358)
