Standard

Dynamic adaptive large neighborhood search for inventory routing problem. / Shirokikh, V.A.; Zakharov, V.V.

2015. 231-241 Paper presented at 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, Nancy, France.

Research output: Contribution to conference › Paper

Harvard

Shirokikh, VA & Zakharov, VV 2015, 'Dynamic adaptive large neighborhood search for inventory routing problem', Paper presented at 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, Nancy, France, 11/05/15 - 13/05/15 pp. 231-241. https://doi.org/10.1007/978-3-319-18161-5_20

APA

Shirokikh, V. A., & Zakharov, V. V. (2015). Dynamic adaptive large neighborhood search for inventory routing problem. 231-241. Paper presented at 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, Nancy, France. https://doi.org/10.1007/978-3-319-18161-5_20

Vancouver

Shirokikh VA, Zakharov VV. Dynamic adaptive large neighborhood search for inventory routing problem. 2015. Paper presented at 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, Nancy, France. https://doi.org/10.1007/978-3-319-18161-5_20

Author

Shirokikh, V.A. ; Zakharov, V.V. / Dynamic adaptive large neighborhood search for inventory routing problem. Paper presented at 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, Nancy, France.

BibTeX

@conference{36629340b5a14ea4a7144053f8a744d0,
title = "Dynamic adaptive large neighborhood search for inventory routing problem",
abstract = "This paper is devoted to new approach to increase level of time consistency of heuristics and propose Dynamic Adaptive Large Neighboгrhood Search (DALNS) algorithm to improve solutions generated by ALNS. To evaluate effectiveness of DALNS implementation computational experiments were performed on benchmark instances. It was shown that the number of tests in which solution was improved equals 5236 (46% of total amount).",
author = "V.A. Shirokikh and V.V. Zakharov",
year = "2015",
doi = "10.1007/978-3-319-18161-5_20",
language = "English",
pages = "231--241",
note = "3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2015 ; Conference date: 11-05-2015 Through 13-05-2015",

}

RIS

TY - CONF

T1 - Dynamic adaptive large neighborhood search for inventory routing problem

AU - Shirokikh, V.A.

AU - Zakharov, V.V.

PY - 2015

Y1 - 2015

N2 - This paper is devoted to new approach to increase level of time consistency of heuristics and propose Dynamic Adaptive Large Neighboгrhood Search (DALNS) algorithm to improve solutions generated by ALNS. To evaluate effectiveness of DALNS implementation computational experiments were performed on benchmark instances. It was shown that the number of tests in which solution was improved equals 5236 (46% of total amount).

AB - This paper is devoted to new approach to increase level of time consistency of heuristics and propose Dynamic Adaptive Large Neighboгrhood Search (DALNS) algorithm to improve solutions generated by ALNS. To evaluate effectiveness of DALNS implementation computational experiments were performed on benchmark instances. It was shown that the number of tests in which solution was improved equals 5236 (46% of total amount).

U2 - 10.1007/978-3-319-18161-5_20

DO - 10.1007/978-3-319-18161-5_20

M3 - Paper

SP - 231

EP - 241

T2 - 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences

Y2 - 11 May 2015 through 13 May 2015

ER -

ID: 8625321