Heuristics for dynamic and stochastic routing in industrial shipping
From MaRDI portal
Publication:339576
DOI10.1016/j.cor.2012.06.011zbMath1349.90871OpenAlexW2060597711MaRDI QIDQ339576
Gregorio Tirado, Lars Magnus Hvattum, Jean-François Cordeau, Kjetil Fagerholt
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
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
The multiple vehicle pickup and delivery problem with LIFO constraints ⋮ Flexible solutions to maritime inventory routing problems with delivery time windows ⋮ Dynamic scheduling of patients in emergency departments ⋮ Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search ⋮ A maritime scheduling transportation-inventory problem with normally distributed demands and fully loaded/unloaded vessels
Cites Work
- Unnamed Item
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Dynamic pickup and delivery problems
- A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
- Stochastic vehicle routing
- Ship scheduling: The last decade
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- Dynamic vehicle routing: Status and prospects
- Online stochastic optimization under time constraints
- Dynamic fleet management. Concepts, systems, algorithms \& case studies
- Drive: Dynamic Routing of Independent Vehicles
- Online traveling salesman problems with service flexibility
- A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
- A unified tabu search heuristic for vehicle routing problems with time windows
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
This page was built for publication: Heuristics for dynamic and stochastic routing in industrial shipping
