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 volumeConference contributionScientificpeer-review

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 languageEnglish
Title of host publicationComputational Logistics - 11th International Conference, ICCL 2020, Proceedings
EditorsEduardo Lalla-Ruiz, Martijn Mes, Stefan Voß
PublisherSpringer
Pages569-583
ISBN (Print)9783030597467
DOIs
Publication statusPublished - 2020
Externally publishedYes
Event11th International Conference on Computational Logistics, ICCL 2020 - Enschede, Netherlands
Duration: 28 Sep 202030 Sep 2020

Publication series

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

Conference

Conference11th International Conference on Computational Logistics, ICCL 2020
CountryNetherlands
CityEnschede
Period28/09/2030/09/20

Keywords

  • Cutting planes techniques
  • Logistic flow routing
  • Logistic space time network
  • Synchromodality

Fingerprint

Dive into the research topics of 'Cutting Planes for Solving Logistic Flow Problems'. Together they form a unique fingerprint.

Cite this