A multiperiod drayage problem with customer-dependent service periods

•A new drayage problem with multiple service periods and flexibility in their change.•A path-based model with all feasible routes.•A “Price-and-Branch” algorithm in acyclic network.•A compact arc-flow formulation based on this network.•Analysis of flexibility, costs and potential discount fees. We i...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 129; s. 105189
Hlavní autoři: Ghezelsoflu, Ali, Di Francesco, Massimo, Frangioni, Antonio, Zuddas, Paola
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.05.2021
Pergamon Press Inc
Témata:
Algorithms
Constraint modelling
Customer services
Customers
Drayage Operations
Flexibility
Integer linear programming
Multiperiod vehicle routing
Operations research
Transportation services
Multiperiod vehicle routing
Integer linear programming
Drayage Operations
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•A new drayage problem with multiple service periods and flexibility in their change.•A path-based model with all feasible routes.•A “Price-and-Branch” algorithm in acyclic network.•A compact arc-flow formulation based on this network.•Analysis of flexibility, costs and potential discount fees. We investigate a multiperiod drayage problem in which customers request transportation services over several days, possibly leaving the carrier some flexibility to change service periods. We compare three approaches for the problem: a path-based model with all feasible routes, a “Price-and-Branch” algorithm in which the pricing is formulated as a collection of shortest path problems in a cunningly constructed acyclic network, and a compact arc-flow formulation based on this network. The experiments shows that the latter formulation is the most efficient, and can solve to optimality instances of real-world size (and beyond) in time compatible with typical operational constraints. Also, the models allow us to assess that limited amounts of flexibility from customers can significantly improve routing costs for the carrier while decreasing customers’ cost as well.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2020.105189