The heterogeneous fleet vehicle routing problem with draft limits
From MaRDI portal
Publication:2108117
DOI10.1016/J.COR.2022.106024OpenAlexW4297106266MaRDI QIDQ2108117
Patrizia Serra, Simona Mancini, Paolo Fadda, Gianfranco Fancello
Publication date: 19 December 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106024
Cites Work
- A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
- A general variable neighborhood search variants for the travelling salesman problem with draft limits
- The traveling salesman problem with draft limits
- A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
- Exact algorithms for the traveling salesman problem with draft limits
- A survey on matheuristics for routing problems
This page was built for publication: The heterogeneous fleet vehicle routing problem with draft limits