A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions
Year of publication: |
2024
|
---|---|
Authors: | Wei, Jiachen ; Poon, Mark ; Zhang, Zhenzhen |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 172.2024, Art.-No. 106807, p. 1-20
|
Subject: | VRPTW | Time-dependent | Combinatorial auction | Outsourcing | Branch-and-cut | Tourenplanung | Vehicle routing problem | Auktionstheorie | Auction theory | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
-
Exact algorithms for the vehicle routing problem with time windows and combinatorial auction
Zhang, Zhenzhen, (2019)
-
Online algorithms for the multi-vehicle inventory-routing problem with real-time demands
Bertazzi, Luca, (2023)
-
A branch-and-cut algorithm for the single truck and trailer routing problem with satellite depots
Belenguer, José Manuel, (2016)
- More ...
-
Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
Zhao, Jingyi, (2022)
-
Zhao, Jingyi, (2024)
-
Leung, Stephen C. H., (2013)
- More ...