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á bibliografia

Vydané v:	Alexandria engineering journal Ročník 64; s. 349 - 363
Hlavní autori:	Hussain Ahmed, Zakir, Yousefikhoshbakht, Majid
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.02.2023 Elsevier
Predmet:	Fixed fleet Heterogeneous Mixed Integer Linear Programming Open Vehicle Routing Problem with Time Window Tabu Search Algorithm Open Vehicle Routing Problem with Time Window Tabu Search Algorithm Mixed Integer Linear Programming Fixed fleet Heterogeneous
ISSN:	1110-0168
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!