The heterogeneous fleet vehicle routing problem with draft limits
From MaRDI portal
Publication:2108117
Recommendations
- The traveling salesman problem with draft limits
- Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model
- Dispatching of small containers via coastal freight liners: The case of the Aegean sea.
- Industrial and tramp ship routing problems: closing the gap for real-scale instances
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
Cites work
- A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times
- A general variable neighborhood search variants for the travelling salesman problem with draft limits
- A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
- A survey on matheuristics for routing problems
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
- Exact algorithms for the traveling salesman problem with draft limits
- The traveling salesman problem with draft limits
Cited in
(3)
This page was built for publication: The heterogeneous fleet vehicle routing problem with draft limits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108117)