Tramp ship routing and scheduling with voyage separation requirements
From MaRDI portal
Publication:1642055
DOI10.1007/s00291-017-0480-4zbMath1396.90037OpenAlexW2610315136MaRDI QIDQ1642055
Publication date: 20 June 2018
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://backend.orbit.dtu.dk/ws/files/133955432/main.pdf
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Tramp ship routing and scheduling with voyage separation requirements, A survey of adaptive large neighborhood search algorithms and applications, A MIP-based heuristic for a single trade routing and scheduling problem in roll-on roll-off shipping
Uses Software
Cites Work
- Unnamed Item
- An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping
- Branching strategies to improve regularity of crew schedules in ex-urban public transit
- A reoptimization algorithm for the shortest path problem with time windows
- Ship scheduling: The last decade
- Tramp ship routing and scheduling with voyage separation requirements
- A new branching strategy for time constrained routing problems with application to backhauling
- The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
- Ship routing and scheduling in the new millennium
- Resource extension functions: properties, inversion, and generalization to segments
- The vehicle routing problem with time windows and temporal dependencies
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- On the facial structure of set packing polyhedra
- Column Generation
- Shortest Path Problems with Resource Constraints
- Ship Scheduling with Recurring Visits and Visit Separation Requirements
- Perfect, ideal and balanced matrices
