An improved tabu search algorithm for solving heterogeneous fixed fleet open vehicle routing problem with time windows

The heterogeneous fixed fleet open vehicle routing problem with time windows is a very significant type of the vehicle routing problem (VRP) that aims to find the minimum fixed and variable cost of transportation for a heterogeneous fleet with a fixed number in which the capacity of every vehicle an...

Celý popis

Podrobná bibliografie

Hlavní autoři:	Zakir Hussain Ahmed, Majid Yousefikhoshbakht
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	Elsevier 2023-02-01
Edice:	Alexandria Engineering Journal
Témata:	Open Vehicle Routing Problem with Time Window Fixed fleet Heterogeneous Tabu Search Algorithm Mixed Integer Linear Programming
On-line přístup:	http://www.sciencedirect.com/science/article/pii/S1110016822005956
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!