Bounds and valid inequalities for the fixed-route vehicle-refueling problem

Schulz, Arne; Suzuki, Yoshinori

doi:10.1016/j.cie.2022.108340

Bounds and valid inequalities for the fixed-route vehicle-refueling problem

Publication date

2022-07-02

Document type

Forschungsartikel

Author

Schulz, Arne

Suzuki, Yoshinori

Organisational unit

Institute of Operations Management, Universität Hamburg

DOI

10.1016/j.cie.2022.108340

URI

https://openhsu.ub.hsu-hh.de/handle/10.24405/22192

Scopus ID

2-s2.0-85133176957

Publisher

Elsevier

Series or journal

Computers & Industrial Engineering

ISSN

0360-8352

Periodical volume

170

Article ID

108340

Peer-reviewed

✅

Part of the university bibliography

Nein

Language

English

Keyword

Bounds

Mixed-integer programming

Valid inequalities

Abstract

The fixed-route vehicle-refueling problem is a daily scheduling problem used by truck companies that seeks the best set of refueling stations (truck stops) for a given route. The paper introduces valid inequalities, lower bounds, as well as methods to reduce the number of stops that can be visited directly after a given stop. We show in a comprehensive computational study that our model formulation reduces the average computation times in comparison with a standard MIP formulation by over 78% on average and by 95% for instances with 2000 truck stops. Instances with 2000 truck stops are solved in less than 0.3 s.

Version

Published version

Access right on openHSU

Metadata only access