MATEC Web Conf.
Volume 271, 20192019 Tran-SET Annual Conference
|Number of page(s)||6|
|Section||Intelligent Transportation Systems|
|Published online||09 April 2019|
Freight Consolidation Problem with Time Windows, Pickup and Delivery Sequence
School of Industrial Engineering & Management, Oklahoma State University, Stillwater, OK 74078
* Corresponding author: email@example.com
The number of online market places for freight matching is on the rise. Online market places help small trucking companies find shipping customers. However, they do not provide cargo consolidation strategies. This lack of effective consolidation has adverse effects on the shipping industry and greenhouse gas emission. To that extent, this article addresses Multiple Vehicle Pickup and Delivery Problem with Time Windows (MVPDPTW). We propose a Mixed Integer Programming (MIP) model and a branch-and-cut algorithm geared towards identifying effective freight consolidation opportunities. For emission studies, we used a cost conversion technique from the literature to convert emission levels into monetary values. On real-world logistics company test instances, our model identified routes with lower cost and lower emission levels than the actual routes.
© The Authors, published by EDP Sciences, 2019
This is an open access article distributed under the terms of the Creative Commons Attribution License 4.0 (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.