A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping

DOI10.1016/j.ejor.2018.02.023zbMath1388.90024OpenAlexW2788735711WikidataQ59166702 ScholiaQ59166702MaRDI QIDQ1749489

Aurora Smith Elgesem, Eline Sophie Skogen, Xin Wang, Kjetil Fagerholt

Publication date: 17 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11250/2486001

zbMATH Keywords

Monte Carlo simulationstochastic travel timeOR in maritime industrytraveling salesman problem with pickup and delivery

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)

Related Items (3)

A revised formulation, library and heuristic for a chemical tanker scheduling problem ⋮ A stochastic single vehicle routing problem with a predefined sequence of customers and collection of two similar materials ⋮ Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios

Cites Work

• Unnamed Item
• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
• Vehicle routing problem with stochastic travel times including soft time windows and service costs
• Maximum probability shortest path problem
• Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse
• Travel time reliability in vehicle routing and scheduling with time windows
• A stochastic dynamic traveling salesman problem with hard time windows
• Stochastic vehicle routing
• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
• A two-phase heuristic for an in-port ship routing problem with tank allocation
• The traveling salesman problem with draft limits
• Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
• Analyzing the quality of the expected value solution in stochastic programming
• A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
• A queueing framework for routing problems with time-dependent travel times
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• High-Performance Heuristics for Optimization in Stochastic Traffic Engineering Problems
• Generalized Dynamic Programming for Stochastic Combinatorial Optimization
• Vehicle routing with soft time windows and Erlang travel times
• A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
• Technical Note—Analysis of a Preference Order Traveling Salesman Problem
• The value of the stochastic solution in stochastic linear programs with fixed recourse
• A progressive hedging method for the multi-path travelling salesman problem with stochastic travel times
• Stochastic Shortest Paths Via Quasi-convex Maximization

This page was built for publication: A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping