Tramp ship routing and scheduling with voyage separation requirements
type: Item
instance of: scholarly article
title: Tramp ship routing and scheduling with voyage separation requirements
zbMATH Open document ID: 1396.90037
author: Y. Aharonov
published in: OR Spectrum
publication date: 2018-06-20T00:00:00Z
full work available at URL: main.pdf
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6891840
zbMATH Keywords: scheduling
zbMATH Keywords: maritime transport
zbMATH Keywords: spread requirement
zbMATH Keywords: optimization
zbMATH Keywords: exact algorithms
describes a project that uses: VRP
MaRDI profile type: Publication
OpenAlex ID: W2610315136
cites work: Ship routing and scheduling in the new millennium
cites work: Perfect, ideal and balanced matrices
cites work: Q4532229
cites work: Column Generation
cites work: A reoptimization algorithm for the shortest path problem with time windows
cites work: The vehicle routing problem with time windows and temporal dependencies
cites work: Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
cites work: A new branching strategy for time constrained routing problems with application to backhauling
cites work: An effective heuristic for solving a combined cargo and inventory routing problem in tramp shipping
cites work: Resource extension functions: properties, inversion, and generalization to segments
cites work: Shortest Path Problems with Resource Constraints
cites work: On the facial structure of set packing polyhedra
cites work: The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
cites work: Ship scheduling: The last decade
cites work: Ship Scheduling with Recurring Visits and Visit Separation Requirements
cites work: Branching strategies to improve regularity of crew schedules in ex-urban public transit
DOI: 10.1007/S00291-017-0480-4
description: scientific article; zbMATH DE number 6891840