A large neighbourhood search heuristic for ship routing and scheduling with split loads
From MaRDI portal
Publication:709186
Recommendations
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads
- A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
- Routing and scheduling in project shipping
- Ship routing and scheduling with flexible cargo sizes
- A combined ship scheduling and allocation problem
Cites work
- scientific article; zbMATH DE number 591242 (Why is no real title available?)
- scientific article; zbMATH DE number 956787 (Why is no real title available?)
- A general heuristic for vehicle routing problems
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- A unified heuristic for a large class of vehicle routing problems with backhauls
- An empirical study on the benefit of split loads with the pickup and delivery problem
- Computerized scheduling of seagoing tankers
- Savings by Split Delivery Routing
- Split delivery routing
- The capacitated team orienteering and profitable tour problems
- The split delivery vehicle scheduling problem with time windows and grid network distances
- Vehicle routing with split deliveries
Cited in
(22)- A multi-start local search heuristic for ship scheduling -- a computational study
- Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company
- Solving the vessel routing and scheduling problem at a Canadian maritime transportation company
- Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain
- Mathematical models for a ship routing problem with a small number of ports on a route
- Industrial and tramp ship routing problems: closing the gap for real-scale instances
- Service-oriented operational decision optimization for dry bulk shipping fleet under stochastic demand
- Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery
- Multi‐objective optimization of the maritime cargo routing and scheduling problem
- Full-shipload tramp ship routing and scheduling with variable speeds
- Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach
- Vessel routing with pickups and deliveries: an application to the supply of offshore oil platforms
- A time-dependent vessel routing problem with speed optimization
- Liner shipping network design with deadlines
- Solving a pickup and delivery routing problem for fourth‐party logistics providers
- The Maritime Pickup and Delivery Problem with Time Windows and Split Loads
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads
- Ship routing and scheduling in the new millennium
- The traveling salesman problem with draft limits
- A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips
- A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
- A unified operation decision model for dry bulk shipping fleet: ship scheduling, routing, and sailing speed optimization
This page was built for publication: A large neighbourhood search heuristic for ship routing and scheduling with split loads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709186)
