A two-phase method to periodic vehicle routing problem with variable service frequency

Eduyn López-Santana; Carlos Franco; Germán Méndez Giraldo

doi:10.1007/978-3-319-95165-2_37

A two-phase method to periodic vehicle routing problem with variable service frequency

Eduyn López-Santana, Carlos Franco, Germán Méndez Giraldo

urosario

Research output: Chapter in Book/Report › Conference contribution

Abstract

This paper presents a method to solve the periodic vehicle routing problem with service frequency. The problem consists in finding a set of paths for a crew of vehicles to deliver products or services to a set of customers in a discrete planning horizon subject to constraints as vehicle capacity, distance-time constraints, time windows, and the variable demand that implies a not defined frequency. Our method solves iteratively two mixed integer programming models. The first one assigns customers to be visited on the planning horizon. The second finds paths to visit the customers for each period. However, in case of non-feasibility a set of rules modify the allocation and the process starts again until the solution is obtained. We present an example to illustrate the method.

Original language	English (US)
Title of host publication	Computational Science and Its Applications – ICCSA 2018 - 18th International Conference, 2018, Proceedings
Editors	Eufemia Tarantino, Beniamino Murgante, David Taniar, Yeonseung Ryu, Carmelo M. Torre, Ana Maria Rocha, Osvaldo Gervasi, Sanjay Misra, Elena Stankova, Bernady O. Apduhan
Publisher	Springer
Pages	525-538
Number of pages	14
ISBN (Print)	9783319951645
DOIs	https://doi.org/10.1007/978-3-319-95165-2_37
State	Published - 2018
Event	18th International Conference on Computational Science and Its Applications, ICCSA 2018 - Melbourne, Australia Duration: Jul 2 2018 → Jul 5 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10961 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th International Conference on Computational Science and Its Applications, ICCSA 2018
Country/Territory	Australia
City	Melbourne
Period	7/2/18 → 7/5/18

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-95165-2_37

Cite this

López-Santana, E., Franco, C., & Giraldo, G. M. (2018). A two-phase method to periodic vehicle routing problem with variable service frequency. In E. Tarantino, B. Murgante, D. Taniar, Y. Ryu, C. M. Torre, A. M. Rocha, O. Gervasi, S. Misra, E. Stankova, & B. O. Apduhan (Eds.), Computational Science and Its Applications – ICCSA 2018 - 18th International Conference, 2018, Proceedings (pp. 525-538). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10961 LNCS). Springer. https://doi.org/10.1007/978-3-319-95165-2_37

López-Santana, Eduyn ; Franco, Carlos ; Giraldo, Germán Méndez. / A two-phase method to periodic vehicle routing problem with variable service frequency. Computational Science and Its Applications – ICCSA 2018 - 18th International Conference, 2018, Proceedings. editor / Eufemia Tarantino ; Beniamino Murgante ; David Taniar ; Yeonseung Ryu ; Carmelo M. Torre ; Ana Maria Rocha ; Osvaldo Gervasi ; Sanjay Misra ; Elena Stankova ; Bernady O. Apduhan. Springer, 2018. pp. 525-538 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{23870d66081a4eb2b8b405a8a4af648d,

title = "A two-phase method to periodic vehicle routing problem with variable service frequency",

abstract = "This paper presents a method to solve the periodic vehicle routing problem with service frequency. The problem consists in finding a set of paths for a crew of vehicles to deliver products or services to a set of customers in a discrete planning horizon subject to constraints as vehicle capacity, distance-time constraints, time windows, and the variable demand that implies a not defined frequency. Our method solves iteratively two mixed integer programming models. The first one assigns customers to be visited on the planning horizon. The second finds paths to visit the customers for each period. However, in case of non-feasibility a set of rules modify the allocation and the process starts again until the solution is obtained. We present an example to illustrate the method.",

author = "Eduyn L{\'o}pez-Santana and Carlos Franco and Giraldo, {Germ{\'a}n M{\'e}ndez}",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG, part of Springer Nature 2018. Copyright: Copyright 2018 Elsevier B.V., All rights reserved.; 18th International Conference on Computational Science and Its Applications, ICCSA 2018 ; Conference date: 02-07-2018 Through 05-07-2018",

year = "2018",

doi = "10.1007/978-3-319-95165-2_37",

language = "English (US)",

isbn = "9783319951645",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "525--538",

editor = "Eufemia Tarantino and Beniamino Murgante and David Taniar and Yeonseung Ryu and Torre, {Carmelo M.} and Rocha, {Ana Maria} and Osvaldo Gervasi and Sanjay Misra and Elena Stankova and Apduhan, {Bernady O.}",

booktitle = "Computational Science and Its Applications – ICCSA 2018 - 18th International Conference, 2018, Proceedings",

address = "Germany",

}

López-Santana, E, Franco, C & Giraldo, GM 2018, A two-phase method to periodic vehicle routing problem with variable service frequency. in E Tarantino, B Murgante, D Taniar, Y Ryu, CM Torre, AM Rocha, O Gervasi, S Misra, E Stankova & BO Apduhan (eds), Computational Science and Its Applications – ICCSA 2018 - 18th International Conference, 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10961 LNCS, Springer, pp. 525-538, 18th International Conference on Computational Science and Its Applications, ICCSA 2018, Melbourne, Australia, 7/2/18. https://doi.org/10.1007/978-3-319-95165-2_37

A two-phase method to periodic vehicle routing problem with variable service frequency. / López-Santana, Eduyn; Franco, Carlos; Giraldo, Germán Méndez.
Computational Science and Its Applications – ICCSA 2018 - 18th International Conference, 2018, Proceedings. ed. / Eufemia Tarantino; Beniamino Murgante; David Taniar; Yeonseung Ryu; Carmelo M. Torre; Ana Maria Rocha; Osvaldo Gervasi; Sanjay Misra; Elena Stankova; Bernady O. Apduhan. Springer, 2018. p. 525-538 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10961 LNCS).

Research output: Chapter in Book/Report › Conference contribution

TY - GEN

T1 - A two-phase method to periodic vehicle routing problem with variable service frequency

AU - López-Santana, Eduyn

AU - Franco, Carlos

AU - Giraldo, Germán Méndez

PY - 2018

Y1 - 2018

N2 - This paper presents a method to solve the periodic vehicle routing problem with service frequency. The problem consists in finding a set of paths for a crew of vehicles to deliver products or services to a set of customers in a discrete planning horizon subject to constraints as vehicle capacity, distance-time constraints, time windows, and the variable demand that implies a not defined frequency. Our method solves iteratively two mixed integer programming models. The first one assigns customers to be visited on the planning horizon. The second finds paths to visit the customers for each period. However, in case of non-feasibility a set of rules modify the allocation and the process starts again until the solution is obtained. We present an example to illustrate the method.

AB - This paper presents a method to solve the periodic vehicle routing problem with service frequency. The problem consists in finding a set of paths for a crew of vehicles to deliver products or services to a set of customers in a discrete planning horizon subject to constraints as vehicle capacity, distance-time constraints, time windows, and the variable demand that implies a not defined frequency. Our method solves iteratively two mixed integer programming models. The first one assigns customers to be visited on the planning horizon. The second finds paths to visit the customers for each period. However, in case of non-feasibility a set of rules modify the allocation and the process starts again until the solution is obtained. We present an example to illustrate the method.

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

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

U2 - 10.1007/978-3-319-95165-2_37

DO - 10.1007/978-3-319-95165-2_37

M3 - Conference contribution

AN - SCOPUS:85049994124

SN - 9783319951645

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

SP - 525

EP - 538

BT - Computational Science and Its Applications – ICCSA 2018 - 18th International Conference, 2018, Proceedings

A2 - Tarantino, Eufemia

A2 - Murgante, Beniamino

A2 - Taniar, David

A2 - Ryu, Yeonseung

A2 - Torre, Carmelo M.

A2 - Rocha, Ana Maria

A2 - Gervasi, Osvaldo

A2 - Misra, Sanjay

A2 - Stankova, Elena

A2 - Apduhan, Bernady O.

PB - Springer

T2 - 18th International Conference on Computational Science and Its Applications, ICCSA 2018

Y2 - 2 July 2018 through 5 July 2018

ER -

López-Santana E, Franco C, Giraldo GM. A two-phase method to periodic vehicle routing problem with variable service frequency. In Tarantino E, Murgante B, Taniar D, Ryu Y, Torre CM, Rocha AM, Gervasi O, Misra S, Stankova E, Apduhan BO, editors, Computational Science and Its Applications – ICCSA 2018 - 18th International Conference, 2018, Proceedings. Springer. 2018. p. 525-538. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-95165-2_37

A two-phase method to periodic vehicle routing problem with variable service frequency

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this