The heterogeneous fleet vehicle routing problem with overloads and time windows

Manolis N. Kritikos and George Ioannou

International Journal of Production Economics, 2013, vol. 144, issue 1, 68-75

Abstract: This paper addresses a new variant of the vehicle routing problem (VRP) with time windows, in which the vehicle fleet comprises units of different capacities and some overloads (i.e., loading vehicles above nominal capacity) are allowed. Although often encountered in practice, the problem, which we call heterogeneous fleet vehicle routing with overloads and time windows (HFVROTW), has not been previously tackled in the literature. We model it by integrating the constraint of the total trip load into the objective function, and solve it via a sequential insertion heuristic that employs a penalty function allowing capacity violations but limiting them to a variable predefined upper bound. Computational results on benchmark problems show the effectiveness of the proposed approach in reducing vehicle costs with minimal capacity violations, thus offering evidence of the significance of this VRP variant.

Keywords: Vehicle routing; Heuristics; Time windows (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527313000388
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:144:y:2013:i:1:p:68-75

DOI: 10.1016/j.ijpe.2013.01.020

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().