Język polski English
LogForum Logo
Scopus Logo
Webofsc Logo

ISSN 1895-2038, e-ISSN:1734-459X

Issues
Submit manuscript
Newsletter subscription
Journal metrics
Indexed in:
Creative Commons licence CC BY-NC (Attribution-NonCommercial)

Issue 2/ 2021, article 6

Pascal Wolff, Jiazhen Huo, Hans-Christian Pfohl

MIXED-INTEGER PROGRAMMING FORMULATIONS FOR THE TRUCK SCHEDULING PROBLEM WITH FIXED OUTBOUND DEPARTURES

Abstract:

Background: Truck scheduling at cross-docking terminals has received much academic attention over the last three decades. A vast number of mixed-integer programming models have been proposed to assign trucks to dock-doors and time slots. Surprisingly, only a few models assume fixed outbound truck departures that are often applied in the less-than-truckload or small parcel and express delivery industry. To the best of our knowledge, none of these papers explore whether a discrete-time or continuous-time model formulation has a better computational performance. This paper attempts to close this research gap and tries to shed light on which type of formulation is advantageous. Therefore, a variant of the truck scheduling problem with fixed outbound departures is considered. This problem's objective is to find a feasible truck schedule that minimizes the number of delayed freight units.

Methods: We propose two model formulations for the described variant of the truck scheduling problem with fixed outbound departures. Specifically, the problem is formulated as a discrete-time and a continuous-time mixed-integer programming model.

Results: A computational experiment is conducted in order to assess the computational performance of the presented model formulations. We compare the discrete-time and continuous-time formulation in terms of both the solution quality and computational time.

Conclusions: The computational results show that the proposed discrete-time model formulation can solve problem instances of medium size to proven optimality within less than one minute. The continuous-time model formulation, on the other hand, can solve small instances to optimality. However, it requires longer solution times than the discrete-time formulation. Furthermore, it is unable to solve medium-sized instances within a 5-minute time limit. Thus, it can be summarized that the proposed discrete-time model formulation is clearly superior to the continuous-time model formulation.

Keywords: cross-docking; truck scheduling; mixed-integer programming; logistics; optimization

Full text available in in english in format: Adobe Acrobat pdf article nr 6 - pdf

Streszczenie w jezyku polskim Streszczenie w jezyku polskim.

DOI: 10.17270/J.LOG.2021.572
For citation:

MLA Wolff, Pascal, et al. "Mixed-integer programming formulations for the truck scheduling problem with fixed outbound departures ." Logforum 17.2 (2021): 6. DOI: 10.17270/J.LOG.2021.572
APA Pascal Wolff1, Jiazhen Huo1, Hans-Christian Pfohl2 (2021). Mixed-integer programming formulations for the truck scheduling problem with fixed outbound departures . Logforum 17 (2), 6. DOI: 10.17270/J.LOG.2021.572
ISO 690 WOLFF, Pascal, HUO, Jiazhen, PFOHL, Hans-Christian. Mixed-integer programming formulations for the truck scheduling problem with fixed outbound departures . Logforum, 2021, 17.2: 6. DOI: 10.17270/J.LOG.2021.572
EndNote BibTeX RefMan