www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
Research publications >

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

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
Janssens, Gerrit K.
Issue Date: 2016
Citation: 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.
URI: http://hdl.handle.net/1942/23000
Link to publication: www.ijtte.com/study/234/A_SOLUTION_FOR_THE_BI_OBJECTIVE_VEHICLE_ROUTING_PROBLEM_WITH_TIME_WINDOWS_USING_LOCAL_SEARCH_AND_GENETIC_ALGORITHMS.html
DOI: 10.7708/ijtte.2016.6(2).03
ISSN: 2217-5652
Category: A1
Type: Journal Contribution
Validation: vabb, 2018
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Published version380.46 kBAdobe PDF

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