Affiliation of Author(s):计算机科学与技术学院/人工智能学院/软件学院
Journal:Lect. Notes Comput. Sci.
Abstract:The concrete delivery problem (CDP) is an NP-hard, real world combinatorial optimization problem. The CDP involves tightly interrelated routing and scheduling constraints that have to be satisfied by considering the tradeoff between production and distribution costs. Various exact and heuristic methods have been developed to address the CDP. However, due to the limitation of the exact methods for dealing with such a complex problem, (meta-)heuristics have been more popular. For this purpose, the present study proposes a hybrid algorithm combining simulated annealing (SA) with a time-slot heuristic (TH) for tackling the CDP. The TH is applied for generating new solutions through perturbation while simulated annealing is utilized to decide on whether to accept these solutions. The proposed algorithm, i.e. SA-TH, is compared to an existing CDP heuristic on a diverse set of CDP benchmarks. The computational results conducted through a series of experiments validate the efficiency and success of SA-TH. © Springer International Publishing AG 2017.
ISSN No.:0302-9743
Translation or Not:no
Date of Publication:2017-01-01
Co-author:Sulaman, Muhammad,M&#,s&#,r, Mustafa,Fan, Zhun
Correspondence Author:czz
Date of Publication:2017-01-01