A multiperiod drayage problem with customer-dependent service periods
Autor: | Paola Zuddas, Antonio Frangioni, Massimo Di Francesco, Ali Ghezelsoflu |
---|---|
Rok vydání: | 2021 |
Předmět: |
Service (business)
Flexibility (engineering) Drayage 0209 industrial biotechnology Mathematical optimization 021103 operations research General Computer Science Computer science Modeling 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Reformulations 020901 industrial engineering & automation Drayage Modeling Reformulations Modeling and Simulation Shortest path problem Path (graph theory) Routing (electronic design automation) |
Zdroj: | Computers & Operations Research. 129:105189 |
ISSN: | 0305-0548 |
DOI: | 10.1016/j.cor.2020.105189 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |