Journal article
Modeling and solving a multimodal transportation problem with flexible‐time and scheduled services
ENEA ‐ Ente per le Nuove Tecnologie, l'Energia e l'Ambiente ‐ C.R. Trisaia, s.s. 106 Jonica km 419+500, Rotondella (MT) 75026, Italy1
Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, Via P. Bucci 41C, Rende (CS) 87036, Italy2
Istituto di Calcolo e Reti ad Alte Prestazioni, Consiglio Nazionale delle Ricerche, Via P. Bucci 41C, Rende (CS) 87036, Italy3
Canada Research Chair in Logistics and Transportation, HEC Montréal, 3000 chemin de la Côte‐Sainte‐Catherine, Montréal, Canada H3T 2A74
Canada Research Chair in Distribution Management, HEC Montréal, 3000 chemin de la Côte‐Sainte‐Catherine, Montréal, Canada H3T 2A75
ENEA ‐ Ente per le Nuove Tecnologie, l'Energia e l'Ambiente ‐ C.R. Casaccia, via Anguillarese 301, Roma (RM) 00060, Italy6
This article studies a transportation problem in a multimodal network with shipment consolidation options. A freight forwarder can use a mix of flexible‐time and scheduled transportation services. Time windows are a prominent aspect of the problem. For instance, they are used to model pickup and delivery time slots.
The various features of the problem can be described as elements of a digraph and their integration leads to a holistic graph representation. This allows an origin‐destination integer multi‐commodity flow formulation with nonconvex piecewise linear costs, time windows, and side constraints. Column generation algorithms are designed to compute lower bounds.
These column generation algorithms are also embedded within heuristics aimed at finding feasible integer solutions. Computational results with real‐life data are presented and show the efficacy of the proposed approach. © 2010 Wiley Periodicals, Inc. NETWORKS, 2011
| Language: | Undetermined |
|---|---|
| Publisher: | Wiley Subscription Services, Inc., A Wiley Company |
| Year: | 2011 |
| Pages: | 53-68 |
| ISSN: | 10970037 and 00283045 |
| Types: | Journal article |
| DOI: | 10.1002/net.20383 |
