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...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research Vol. 129; p. 105189
Main Authors: Ghezelsoflu, Ali, Di Francesco, Massimo, Frangioni, Antonio, Zuddas, Paola
Format: Journal Article
Language:English
Published: New York Elsevier Ltd 01.05.2021
Pergamon Press Inc
Subjects:
ISSN:0305-0548, 1873-765X, 0305-0548
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first