Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks

Natashia Boland; Mike Hewitt; Duc Minh Vu; Martin Savelsbergh

doi:10.1007/978-3-319-59776-8_21

Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks

Natashia Boland, Mike Hewitt, Duc Minh Vu, Martin Savelsbergh

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Proceedings
Editors	Domenico Salvagnin, Michele Lombardi
Publisher	Springer Verlag
Pages	254-262
Number of pages	9
ISBN (Print)	9783319597751
DOIs	https://doi.org/10.1007/978-3-319-59776-8_21
State	Published - 2017
Externally published	Yes
Event	14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2017 - Padova, Italy Duration: Jun 5 2017 → Jun 8 2017

Publication series

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

Conference

Conference	14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2017
Country/Territory	Italy
City	Padova
Period	6/5/17 → 6/8/17

ASJC Scopus Subject Areas

Theoretical Computer Science
General Computer Science

Keywords

Dynamic discretization discovery
Mixed integer programming
Time Windows
Time-expanded networks
Traveling Salesman Problem

Access to Document

10.1007/978-3-319-59776-8_21

Cite this

Boland, N., Hewitt, M., Vu, D. M., & Savelsbergh, M. (2017). Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks. In D. Salvagnin, & M. Lombardi (Eds.), Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Proceedings (pp. 254-262). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10335 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-59776-8_21

Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks. / Boland, Natashia; Hewitt, Mike; Vu, Duc Minh et al.
Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Proceedings. ed. / Domenico Salvagnin; Michele Lombardi. Springer Verlag, 2017. p. 254-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10335 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Boland, N, Hewitt, M, Vu, DM & Savelsbergh, M 2017, Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks. in D Salvagnin & M Lombardi (eds), Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10335 LNCS, Springer Verlag, pp. 254-262, 14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2017, Padova, Italy, 6/5/17. https://doi.org/10.1007/978-3-319-59776-8_21

Boland N, Hewitt M, Vu DM, Savelsbergh M. Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks. In Salvagnin D, Lombardi M, editors, Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Proceedings. Springer Verlag. 2017. p. 254-262. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-59776-8_21

Boland, Natashia ; Hewitt, Mike ; Vu, Duc Minh et al. / Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks. Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Proceedings. editor / Domenico Salvagnin ; Michele Lombardi. Springer Verlag, 2017. pp. 254-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{3617d2b020a6460194b202d9a954d299,

title = "Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks",

keywords = "Dynamic discretization discovery, Mixed integer programming, Time Windows, Time-expanded networks, Traveling Salesman Problem",

author = "Natashia Boland and Mike Hewitt and Vu, {Duc Minh} and Martin Savelsbergh",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2017 ; Conference date: 05-06-2017 Through 08-06-2017",

year = "2017",

doi = "10.1007/978-3-319-59776-8_21",

language = "English",

isbn = "9783319597751",

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

publisher = "Springer Verlag",

pages = "254--262",

editor = "Domenico Salvagnin and Michele Lombardi",

booktitle = "Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Proceedings",

}

TY - GEN

T1 - Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks

AU - Boland, Natashia

AU - Hewitt, Mike

AU - Vu, Duc Minh

AU - Savelsbergh, Martin

N1 - Publisher Copyright: © Springer International Publishing AG 2017.

PY - 2017

Y1 - 2017

KW - Dynamic discretization discovery

KW - Mixed integer programming

KW - Time Windows

KW - Time-expanded networks

KW - Traveling Salesman Problem

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

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

U2 - 10.1007/978-3-319-59776-8_21

DO - 10.1007/978-3-319-59776-8_21

M3 - Conference contribution

AN - SCOPUS:85020789826

SN - 9783319597751

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

SP - 254

EP - 262

BT - Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Proceedings

A2 - Salvagnin, Domenico

A2 - Lombardi, Michele

PB - Springer Verlag

T2 - 14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2017

Y2 - 5 June 2017 through 8 June 2017

ER -

Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks

Publication series

Conference

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Cite this