Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search

DOI10.1007/s10479-016-2177-5zbMath1380.90063OpenAlexW2323588632MaRDI QIDQ1695780

Lars Magnus Hvattum, Gregorio Tirado

Publication date: 8 February 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2177-5

zbMATH Keywords

uncertaintytabu searchroutingscenario

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Ranking the strategies to overcome the barriers of the maritime supply chain (MSC) of containerized freight under fuzzy environment ⋮ A probabilistic approach to pickup and delivery problems with time window uncertainty ⋮ Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing

Cites Work

• Heuristics for dynamic and stochastic routing in industrial shipping
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• Feature selection for multi-label naive Bayes classification
• A survey on metaheuristics for stochastic combinatorial optimization
• Dynamic pickup and delivery problems
• A dynamic vehicle routing problem with multiple delivery routes
• Dynamic vehicle routing: Status and prospects
• A review of dynamic vehicle routing problems
• Ship routing and scheduling in the new millennium
• A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem
• Benchmark Suite for Industrial and Tramp Ship Routing and Scheduling Problems