Success probability applied to inventory routing problem with time windows

Francisco Morales; Carlos Franco; Germán Andres Mendez-Giraldo

doi:10.1007/978-3-319-66963-2_46

Success probability applied to inventory routing problem with time windows

Francisco Morales, Carlos Franco, Germán Andres Mendez-Giraldo

urosario

Research output: Chapter in Book/Inform › Conference contribution

1 Scopus citations

Abstract

The objective with the present paper is to find a solution method for the inventory routing problem, in which have been added several characteristics that resemble their behavior to the current companies’ reality. Between them the hard time windows, a dynamic component and a success probability applied to the routes between the nodes. In that case we use the dynamic programming with finite stages in order to optimize the routing of vehicles in each period, taking into account the dynamical changes implicit in the nodes and the other IRP characteristics.

Original language	English (US)
Title of host publication	Applied Computer Sciences in Engineering - 4th Workshop on Engineering Applications, WEA 2017, Proceedings
Editors	Juan Carlos Figueroa-Garcia, Eduyn Ramiro Lopez-Santana, Roberto Ferro-Escobar, Jose Luis Villa-Ramirez
Publisher	Springer
Pages	522-531
Number of pages	10
ISBN (Print)	9783319669625
DOIs	https://doi.org/10.1007/978-3-319-66963-2_46
State	Published - 2017
Event	4th Workshop on Engineering Applications, WEA 2017 - Cartagena, Colombia Duration: Sep 27 2017 → Sep 29 2017

Publication series

Name	Communications in Computer and Information Science
Volume	742
ISSN (Print)	1865-0929

Conference

Conference	4th Workshop on Engineering Applications, WEA 2017
Country/Territory	Colombia
City	Cartagena
Period	9/27/17 → 9/29/17

All Science Journal Classification (ASJC) codes

General Computer Science
General Mathematics

Access to Document

10.1007/978-3-319-66963-2_46

Cite this

Morales, F., Franco, C., & Mendez-Giraldo, G. A. (2017). Success probability applied to inventory routing problem with time windows. In J. C. Figueroa-Garcia, E. R. Lopez-Santana, R. Ferro-Escobar, & J. L. Villa-Ramirez (Eds.), Applied Computer Sciences in Engineering - 4th Workshop on Engineering Applications, WEA 2017, Proceedings (pp. 522-531). (Communications in Computer and Information Science; Vol. 742). Springer. https://doi.org/10.1007/978-3-319-66963-2_46

Morales, Francisco ; Franco, Carlos ; Mendez-Giraldo, Germán Andres. / Success probability applied to inventory routing problem with time windows. Applied Computer Sciences in Engineering - 4th Workshop on Engineering Applications, WEA 2017, Proceedings. editor / Juan Carlos Figueroa-Garcia ; Eduyn Ramiro Lopez-Santana ; Roberto Ferro-Escobar ; Jose Luis Villa-Ramirez. Springer, 2017. pp. 522-531 (Communications in Computer and Information Science).

@inproceedings{b19329416c2448d38286339dd463ea5a,

title = "Success probability applied to inventory routing problem with time windows",

abstract = "The objective with the present paper is to find a solution method for the inventory routing problem, in which have been added several characteristics that resemble their behavior to the current companies{\textquoteright} reality. Between them the hard time windows, a dynamic component and a success probability applied to the routes between the nodes. In that case we use the dynamic programming with finite stages in order to optimize the routing of vehicles in each period, taking into account the dynamical changes implicit in the nodes and the other IRP characteristics.",

author = "Francisco Morales and Carlos Franco and Mendez-Giraldo, {Germ{\'a}n Andres}",

note = "Publisher Copyright: {\textcopyright} 2017, Springer International Publishing AG. Copyright: Copyright 2017 Elsevier B.V., All rights reserved.; 4th Workshop on Engineering Applications, WEA 2017 ; Conference date: 27-09-2017 Through 29-09-2017",

year = "2017",

doi = "10.1007/978-3-319-66963-2_46",

language = "English (US)",

isbn = "9783319669625",

series = "Communications in Computer and Information Science",

publisher = "Springer",

pages = "522--531",

editor = "Figueroa-Garcia, {Juan Carlos} and Lopez-Santana, {Eduyn Ramiro} and Roberto Ferro-Escobar and Villa-Ramirez, {Jose Luis}",

booktitle = "Applied Computer Sciences in Engineering - 4th Workshop on Engineering Applications, WEA 2017, Proceedings",

address = "Germany",

}

Morales, F, Franco, C & Mendez-Giraldo, GA 2017, Success probability applied to inventory routing problem with time windows. in JC Figueroa-Garcia, ER Lopez-Santana, R Ferro-Escobar & JL Villa-Ramirez (eds), Applied Computer Sciences in Engineering - 4th Workshop on Engineering Applications, WEA 2017, Proceedings. Communications in Computer and Information Science, vol. 742, Springer, pp. 522-531, 4th Workshop on Engineering Applications, WEA 2017, Cartagena, Colombia, 9/27/17. https://doi.org/10.1007/978-3-319-66963-2_46

Success probability applied to inventory routing problem with time windows. / Morales, Francisco; Franco, Carlos; Mendez-Giraldo, Germán Andres.
Applied Computer Sciences in Engineering - 4th Workshop on Engineering Applications, WEA 2017, Proceedings. ed. / Juan Carlos Figueroa-Garcia; Eduyn Ramiro Lopez-Santana; Roberto Ferro-Escobar; Jose Luis Villa-Ramirez. Springer, 2017. p. 522-531 (Communications in Computer and Information Science; Vol. 742).

Research output: Chapter in Book/Inform › Conference contribution

TY - GEN

T1 - Success probability applied to inventory routing problem with time windows

AU - Morales, Francisco

AU - Franco, Carlos

AU - Mendez-Giraldo, Germán Andres

PY - 2017

Y1 - 2017

N2 - The objective with the present paper is to find a solution method for the inventory routing problem, in which have been added several characteristics that resemble their behavior to the current companies’ reality. Between them the hard time windows, a dynamic component and a success probability applied to the routes between the nodes. In that case we use the dynamic programming with finite stages in order to optimize the routing of vehicles in each period, taking into account the dynamical changes implicit in the nodes and the other IRP characteristics.

AB - The objective with the present paper is to find a solution method for the inventory routing problem, in which have been added several characteristics that resemble their behavior to the current companies’ reality. Between them the hard time windows, a dynamic component and a success probability applied to the routes between the nodes. In that case we use the dynamic programming with finite stages in order to optimize the routing of vehicles in each period, taking into account the dynamical changes implicit in the nodes and the other IRP characteristics.

UR - http://www.scopus.com/inward/record.url?scp=85030032287&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85030032287&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-66963-2_46

DO - 10.1007/978-3-319-66963-2_46

M3 - Conference contribution

AN - SCOPUS:85030032287

SN - 9783319669625

T3 - Communications in Computer and Information Science

SP - 522

EP - 531

BT - Applied Computer Sciences in Engineering - 4th Workshop on Engineering Applications, WEA 2017, Proceedings

A2 - Figueroa-Garcia, Juan Carlos

A2 - Lopez-Santana, Eduyn Ramiro

A2 - Ferro-Escobar, Roberto

A2 - Villa-Ramirez, Jose Luis

PB - Springer

T2 - 4th Workshop on Engineering Applications, WEA 2017

Y2 - 27 September 2017 through 29 September 2017

ER -

Morales F, Franco C, Mendez-Giraldo GA. Success probability applied to inventory routing problem with time windows. In Figueroa-Garcia JC, Lopez-Santana ER, Ferro-Escobar R, Villa-Ramirez JL, editors, Applied Computer Sciences in Engineering - 4th Workshop on Engineering Applications, WEA 2017, Proceedings. Springer. 2017. p. 522-531. (Communications in Computer and Information Science). doi: 10.1007/978-3-319-66963-2_46

Success probability applied to inventory routing problem with time windows

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this