An iterated beam search algorithm for the green vehicle routing problem. Issue 3 (17th March 2017)

• Record Type: Journal Article
• Authors: Yavuz, Mesut
• Is Part Of: Networks. Volume 69:Issue 3(2017)
• Page Start: 317
• Page End: 328
• Publication Date: 2017-03-17
• Subjects: alternative‐fuel vehicles -- sustainable transportation -- vehicle routing -- tree search -- beam search -- heuristic algorithms; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21737
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract : Green, or, alternative‐fuel vehicles provide opportunities to improve fleet operators' financial and environmental bottom lines. They also present challenges due to limited driving ranges, limited refueling infrastructure, and lengthy refueling times. This paper addresses a green vehicle routing problem of homogeneous service fleets with stated challenges, and develops an Iterated Beam Search algorithm for its solution. The developed algorithm can employ different lower and upper bounding strategies, and can work as an exact or a heuristics algorithm. A dominance strategy is also developed to improve efficiency of the algorithm. Computational experiments on various‐size test instances show that the algorithm's performance is comparable to existing approaches. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 69(3), 317–328 2017