Mathematical models for a ship routing problem with a small number of ports on a route
From MaRDI portal
Publication:2110089
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads
- A column generation approach for determining optimal fleet mix, schedules, and transshipment facility locations for a vessel transportation problem
- A large neighbourhood search heuristic for ship routing and scheduling with split loads
- Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery
- Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
- Optimizing multiship routing and scheduling with constraints on inventory levels in a Brazilian oil company
- Pickup and delivery problem with incompatibility constraints
- Savings by Split Delivery Routing
- Ship routing and scheduling in the new millennium
- Ship scheduling: The last decade
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The Maritime Pickup and Delivery Problem with Time Windows and Split Loads
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
Cited in
(2)
This page was built for publication: Mathematical models for a ship routing problem with a small number of ports on a route
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2110089)