An Interactive Freight-Pooling Service for Efficient Last-Mile Delivery

Panagiotis Liakos, Alex Delis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The existing practices of the urban section of freight transport chain result in traffic congestion, air pollution and resources being wasted. We focus on the final stage of freight distribution and propose an interactive freight-pooling service, in an effort to reduce the undesirable effects and the cost of freight transport in urban areas. Our service empowers city and state authorities to orchestrate the distribution network through interactive interfaces. We break the problem into three distinct phases that collectively helps us set constraints related to the quality of service and find inexpensive routes. In this regard, our proposed freight-pooling approach becomes an attractive option for efficient distribution, that guarantees cost minimization without sacrificing the level of quality.

Original languageEnglish (US)
Title of host publicationProceedings - 2015 IEEE 16th International Conference on Mobile Data Management, MDM 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages23-25
Number of pages3
ISBN (Electronic)9781479999729
DOIs
StatePublished - Sep 11 2015
Event16th IEEE International Conference on Mobile Data Management, MDM 2015 - Pittsburgh, United States
Duration: Jun 15 2015Jun 18 2015

Publication series

NameProceedings - IEEE International Conference on Mobile Data Management
Volume2
ISSN (Print)1551-6245

Conference

Conference16th IEEE International Conference on Mobile Data Management, MDM 2015
Country/TerritoryUnited States
CityPittsburgh
Period6/15/156/18/15

Keywords

  • Algorithms
  • Design
  • Intelligent Transportation Systems
  • Vehicle Routing Problem

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'An Interactive Freight-Pooling Service for Efficient Last-Mile Delivery'. Together they form a unique fingerprint.

Cite this