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...

Full description

Bibliographic Details

Published in:	Alexandria engineering journal Vol. 64; pp. 349 - 363
Main Authors:	Hussain Ahmed, Zakir, Yousefikhoshbakht, Majid
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.02.2023 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!