Please use this identifier to cite or link to this item:
Title: A solution for the bi-objective vehicle routing problem with the windows using local search and genetic algorithms
Authors: Mungwattana, Anand
Manisri, Tharinee
Charoenpol, Kanjanaporn
Issue Date: 2016
Source: International Journal for Traffic and Transport Engineering, 6(2), p. 149-158
Abstract: This paper deals with the vehicle routing problem with time windows (VRPTW). The VRPTW routes a set of vehicles to service customers having two-sided time windows, i.e. earliest and latest start of service times. The demand requests are served by capacitated vehicles with limited travel times to return to the depot. The purpose of this paper is to develop a hybrid algorithm that uses the modified push forward insertion heuristic (MPFIH), a λ-interchange local search descent method (λ-LSD) and a genetic algorithm to solve the VRPTW with two objectives. The first objective aims to determine the minimum number of vehicles required and the second is to find the solution that minimizes the total travel time. A set of well-known benchmark problems are used to compare the quality of solutions. The results show that the proposed algorithm provides effective solutions compared with best found solutions and better than another heuristic used for comparison.
Keywords: vehicle routing problems with time windows (VRPTW); genetic algorithms; local search
Document URI:
Link to publication:
ISSN: 2217-5652
DOI: 10.7708/ijtte.2016.6(2).03
Category: A1
Type: Journal Contribution
Validations: vabb 2018
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
IJTTE_Vol 6(2)_3.pdfPublished version380.46 kBAdobe PDFView/Open
Show full item record

Google ScholarTM



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