Scholars@Duke publication: Simulated annealing with a time-slot heuristic for ready-mix concrete delivery

Simulated annealing with a time-slot heuristic for ready-mix concrete delivery

Publication , Conference

Sulaman, M; Cai, X; Mısır, M; Fan, Z

Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

January 1, 2017

Published version (DOI)

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.

Duke Scholars

Author Mustafa Misir DKU Faculty

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

10.1007/978-3-319-68759-9_4

EISSN

1611-3349

ISSN

0302-9743

Publication Date

January 1, 2017

Volume

10593 LNCS

Start / End Page

39 / 50

Related Subject Headings

Artificial Intelligence & Image Processing
46 Information and computing sciences

Citation

APA

Chicago

ICMJE

MLA

NLM

Sulaman, M., Cai, X., Mısır, M., & Fan, Z. (2017). Simulated annealing with a time-slot heuristic for ready-mix concrete delivery. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10593 LNCS, pp. 39–50). https://doi.org/10.1007/978-3-319-68759-9_4

Sulaman, M., X. Cai, M. Mısır, and Z. Fan. “Simulated annealing with a time-slot heuristic for ready-mix concrete delivery.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10593 LNCS:39–50, 2017. https://doi.org/10.1007/978-3-319-68759-9_4.

Sulaman M, Cai X, Mısır M, Fan Z. Simulated annealing with a time-slot heuristic for ready-mix concrete delivery. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2017. p. 39–50.

Sulaman, M., et al. “Simulated annealing with a time-slot heuristic for ready-mix concrete delivery.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10593 LNCS, 2017, pp. 39–50. Scopus, doi:10.1007/978-3-319-68759-9_4.

Sulaman M, Cai X, Mısır M, Fan Z. Simulated annealing with a time-slot heuristic for ready-mix concrete delivery. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2017. p. 39–50.

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

10.1007/978-3-319-68759-9_4

EISSN

1611-3349

ISSN

0302-9743

Publication Date

January 1, 2017

Volume

10593 LNCS

Start / End Page

39 / 50

Related Subject Headings

Artificial Intelligence & Image Processing
46 Information and computing sciences