Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/205897 
Year of Publication: 
2016
Citation: 
[Journal:] Cogent Business & Management [ISSN:] 2331-1975 [Volume:] 3 [Publisher:] Taylor & Francis [Place:] Abingdon [Year:] 2016
Publisher: 
Taylor & Francis, Abingdon
Abstract: 
In this study, a new way to improve the Heuristic Bubble Algorithm (HBA) is presented. HBA is a nature-inspired algorithm, which is a new approach to and initially implemented for, vehicle routing problems of pickup and delivery (VRPPD). Later, it was reinforced to solve other routing problems, such as vehicle routing problem with time windows (VRPTW), and vehicle routing problem with stochastic demands (VRPSD). HBA is a greedy algorithm. It will mostly find local optimal solutions. The proposed method is an improvement over HBA enabling it to reach the global minimum. It uses specialized simulated annealing methods in its operators. A well-known data-set is used to benchmark the proposed method. Better results over HBA and some best results in literature are recorded.
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size





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