Hide/Show Apps

A min-max vehicle routing problem with split delivery and heterogeneous demand

Yakici, Ertan
Karasakal, Orhan
In this article, we introduce a new variant of min-max vehicle routing problem, where various types of customer demands are satisfied by heterogeneous fleet of vehicles and split delivery of services is allowed. We assume that vehicles may serve one or more types of service with unlimited service capacity, and varying service and transfer speed. A heuristic solution approach is proposed. We report the solutions for several test problems.