Enhancing heuristic bubble algorithm with simulated annealing

Mehmet Fatih Yuce, Erhan Musaoglu and Ali Gunes

Cogent Business & Management, 2016, vol. 3, issue 1, 1220662

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.

Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/23311975.2016.1220662 (text/html)
Access to full text is restricted to subscribers.

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:taf:oabmxx:v:3:y:2016:i:1:p:1220662

Ordering information: This journal article can be ordered from
http://cogentoa.tandfonline.com/journal/OABM20

DOI: 10.1080/23311975.2016.1220662

Access Statistics for this article

Cogent Business & Management is currently edited by Len Tiu Wright and Tahir Nisar

More articles in Cogent Business & Management from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().