Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/21831

Title: A Hybrid Algorithm for the Vehicle Routing Problem with Soft Time Windows and Hierarchical Objectives
Authors: Manisri, Tharinee
Mungwattana, Anan
Janssens, Gerrit K.
Caris, An
Issue Date: 2015
Abstract: This paper presents an algorithm for the vehicle routing problem with soft time windows (VRPSTW). It involves serving a set of customers, with earliest and latest time deadlines, which may be violated if a penalty is paid, and a constant service time at the customer site. Customer demands are served by capacitated vehicles. The purpose of this research is to develop a hybrid algorithm that includes an insertion heuristic, a local search algorithm and a meta-heuristic algorithm to solve VRPSTW problems with more than one objective. The first priority aims to find the minimum number of vehicles required and the second priority aims to search for the solution that minimizes the total travel time. Performance of the algorithmic approach is measured by two criteria: solution quality and run time. A set of well-known benchmark data and a genetic algorithm are used to compare the solution quality and running time of the algorithm. Results show a trade-off can be made between total cost and service when considering soft time windows. Running time results display that the hybrid algorithm has a higher performance than the genetic algorithm when the number of customers is less than 25.
Notes: [Manisri, Tharinee; Mungwattana, Anan] Sripatum Univ, Dept Ind Engn, Bangkok 10900, Thailand. [Janssens, Gerrit K.; Caris, An] Hasselt Univ, Logist Res Grp, B-3590 Diepenbeek, Belgium.
URI: http://hdl.handle.net/1942/21831
DOI: 10.1080/02522667.2015.1026459
ISI #: 000366756300005
ISSN: 0252-2667
Category: A1
Type: Journal Contribution
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
published version341.79 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.