Heuristics for dynamic and stochastic routing in industrial shipping
DOI10.1016/J.COR.2012.06.011zbMATH Open1349.90871OpenAlexW2060597711MaRDI QIDQ339576FDOQ339576
Authors: Gregorio Tirado, Lars Magnus Hvattum, Kjetil Fagerholt, Jean-François Cordeau 
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11250/2457838
Recommendations
- Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search
- Ship routing using genetic algorithms
- A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
- A MIP based local search heuristic for a stochastic maritime inventory routing problem
- Routing and scheduling in project shipping
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- Dynamic vehicle routing: Status and prospects
- Title not available (Why is that?)
- A unified tabu search heuristic for vehicle routing problems with time windows
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- Dynamic pickup and delivery problems
- Stochastic vehicle routing
- DRIVE: Dynamic routing of independent vehicles
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Ship scheduling: The last decade
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- Dynamic fleet management. Concepts, systems, algorithms \& case studies
- Online traveling salesman problems with service flexibility
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
- A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
- A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
- Online stochastic optimization under time constraints
Cited In (11)
- Stochastic and dynamic shipper carrier network design problem
- Ship routing using genetic algorithms
- The multiple vehicle pickup and delivery problem with LIFO constraints
- Flexible solutions to maritime inventory routing problems with delivery time windows
- Industrial aspects and literature survey: fleet composition and routing
- Bi-objective routing in a dynamic network: an application to maritime logistics
- A MIP-based heuristic for a single trade routing and scheduling problem in roll-on roll-off shipping
- A maritime scheduling transportation-inventory problem with normally distributed demands and fully loaded/unloaded vessels
- Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search
- Dynamic scheduling of patients in emergency departments
- A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
This page was built for publication: Heuristics for dynamic and stochastic routing in industrial shipping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339576)
