Cutting Planes for Solving Logistic Flow Problems

Kishan Kalicharan; Frank Phillipson; Alex Sangers

doi:10.1007/978-3-030-59747-4_37

Cutting Planes for Solving Logistic Flow Problems

Kishan Kalicharan, Frank Phillipson^*, Alex Sangers

^*Corresponding author for this work

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

3 Citations (Scopus)

Abstract

In logistic problems, an Integral Multi-Commodity Network Design Problem on a time-space network is often used to model the problem of routing transportation means and assigning freight units to those means. In Physical Internet and Synchromodal networks an interactive planning approach is preferable, meaning that calculation times of a single planning step should be short. In this paper we provide ways to reduce the size of the problem formulation based on cutting planes, that are effective in reducing the computation time for Integer Linear Programming problem-based solution methods.

Original language	English
Title of host publication	Computational Logistics - 11th International Conference, ICCL 2020, Proceedings
Editors	Eduardo Lalla-Ruiz, Martijn Mes, Stefan Voß
Publisher	Springer
Pages	569-583
ISBN (Print)	9783030597467
DOIs	https://doi.org/10.1007/978-3-030-59747-4_37
Publication status	Published - 2020
Externally published	Yes
Event	11th International Conference on Computational Logistics, ICCL 2020 - Enschede, Netherlands Duration: 28 Sept 2020 → 30 Sept 2020

Publication series

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

Conference

Conference	11th International Conference on Computational Logistics, ICCL 2020
Country/Territory	Netherlands
City	Enschede
Period	28/09/20 → 30/09/20

Keywords

Cutting planes techniques
Logistic flow routing
Logistic space time network
Synchromodality

Access to Document

10.1007/978-3-030-59747-4_37

Cite this

Kalicharan, K., Phillipson, F., & Sangers, A. (2020). Cutting Planes for Solving Logistic Flow Problems. In E. Lalla-Ruiz, M. Mes, & S. Voß (Eds.), Computational Logistics - 11th International Conference, ICCL 2020, Proceedings (pp. 569-583). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12433 LNCS). Springer. https://doi.org/10.1007/978-3-030-59747-4_37

Kalicharan, Kishan ; Phillipson, Frank ; Sangers, Alex. / Cutting Planes for Solving Logistic Flow Problems. Computational Logistics - 11th International Conference, ICCL 2020, Proceedings. editor / Eduardo Lalla-Ruiz ; Martijn Mes ; Stefan Voß. Springer, 2020. pp. 569-583 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{78aa2a9f402e42418d58284fb608e82b,

title = "Cutting Planes for Solving Logistic Flow Problems",

abstract = "In logistic problems, an Integral Multi-Commodity Network Design Problem on a time-space network is often used to model the problem of routing transportation means and assigning freight units to those means. In Physical Internet and Synchromodal networks an interactive planning approach is preferable, meaning that calculation times of a single planning step should be short. In this paper we provide ways to reduce the size of the problem formulation based on cutting planes, that are effective in reducing the computation time for Integer Linear Programming problem-based solution methods.",

keywords = "Cutting planes techniques, Logistic flow routing, Logistic space time network, Synchromodality",

author = "Kishan Kalicharan and Frank Phillipson and Alex Sangers",

year = "2020",

doi = "10.1007/978-3-030-59747-4_37",

language = "English",

isbn = "9783030597467",

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

publisher = "Springer",

pages = "569--583",

editor = "Eduardo Lalla-Ruiz and Martijn Mes and Stefan Vo{\ss}",

booktitle = "Computational Logistics - 11th International Conference, ICCL 2020, Proceedings",

note = "11th International Conference on Computational Logistics, ICCL 2020 ; Conference date: 28-09-2020 Through 30-09-2020",

}

Kalicharan, K, Phillipson, F & Sangers, A 2020, Cutting Planes for Solving Logistic Flow Problems. in E Lalla-Ruiz, M Mes & S Voß (eds), Computational Logistics - 11th International Conference, ICCL 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12433 LNCS, Springer, pp. 569-583, 11th International Conference on Computational Logistics, ICCL 2020, Enschede, Netherlands, 28/09/20. https://doi.org/10.1007/978-3-030-59747-4_37

Cutting Planes for Solving Logistic Flow Problems. / Kalicharan, Kishan; Phillipson, Frank; Sangers, Alex.
Computational Logistics - 11th International Conference, ICCL 2020, Proceedings. ed. / Eduardo Lalla-Ruiz; Martijn Mes; Stefan Voß. Springer, 2020. p. 569-583 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12433 LNCS).

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

TY - GEN

T1 - Cutting Planes for Solving Logistic Flow Problems

AU - Kalicharan, Kishan

AU - Phillipson, Frank

AU - Sangers, Alex

PY - 2020

Y1 - 2020

N2 - In logistic problems, an Integral Multi-Commodity Network Design Problem on a time-space network is often used to model the problem of routing transportation means and assigning freight units to those means. In Physical Internet and Synchromodal networks an interactive planning approach is preferable, meaning that calculation times of a single planning step should be short. In this paper we provide ways to reduce the size of the problem formulation based on cutting planes, that are effective in reducing the computation time for Integer Linear Programming problem-based solution methods.

AB - In logistic problems, an Integral Multi-Commodity Network Design Problem on a time-space network is often used to model the problem of routing transportation means and assigning freight units to those means. In Physical Internet and Synchromodal networks an interactive planning approach is preferable, meaning that calculation times of a single planning step should be short. In this paper we provide ways to reduce the size of the problem formulation based on cutting planes, that are effective in reducing the computation time for Integer Linear Programming problem-based solution methods.

KW - Cutting planes techniques

KW - Logistic flow routing

KW - Logistic space time network

KW - Synchromodality

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

U2 - 10.1007/978-3-030-59747-4_37

DO - 10.1007/978-3-030-59747-4_37

M3 - Conference contribution

AN - SCOPUS:85092245098

SN - 9783030597467

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

SP - 569

EP - 583

BT - Computational Logistics - 11th International Conference, ICCL 2020, Proceedings

A2 - Lalla-Ruiz, Eduardo

A2 - Mes, Martijn

A2 - Voß, Stefan

PB - Springer

T2 - 11th International Conference on Computational Logistics, ICCL 2020

Y2 - 28 September 2020 through 30 September 2020

ER -

Kalicharan K, Phillipson F, Sangers A. Cutting Planes for Solving Logistic Flow Problems. In Lalla-Ruiz E, Mes M, Voß S, editors, Computational Logistics - 11th International Conference, ICCL 2020, Proceedings. Springer. 2020. p. 569-583. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-59747-4_37

Cutting Planes for Solving Logistic Flow Problems

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this