Conference Proceeding Article
A recent exploratory study on the collaborative urban logistics in Singapore suggests that cost reduction and privacy preservation are two main drivers that would motivate the participation of carriers in consolidating their last mile deliveries. With Singapore's mild restrictions on the vehicle types or the time windows for the last-mile delivery, we believe that with proper technology in place, an Urban Consolidation Center like the Tenjin Joint Distribution System in Fukuoka Japan may be implemented to achieve cost reduction with some degree of privacy preservation. Participating carriers keep their respective private orders and have the option to get their remaining shareable orders consolidated with those from the other carriers' fleet. To this end, we propose in this paper a double auction mechanism that enables such consolidation with an objective to maximize the total cost savings attained by all participating carriers. Our experimental results on 5 zones of delivery in Singapore CBD demonstrate that the proposed double auction is able to bring about reductions in the number of inter-zone travels, thereby producing cost savings to the participating carriers.
Collaborative Urban Logistics, Double Auction, Order Sharing, Urban Consolidation Center
Artificial Intelligence and Robotics | Asian Studies | Computer Sciences | Operations and Supply Chain Management
Intelligent Systems and Optimization
Transportation Research Procedia: 9th International Conference on City Logistics, 17-19 June 2015, Tenerife, Spain
City or Country
Stephanus Daniel, Handoko and LAU, Hoong Chuin.
Enabling carrier collaboration via order sharing double auction: A Singapore urban logistics perspective. (2016). Transportation Research Procedia: 9th International Conference on City Logistics, 17-19 June 2015, Tenerife, Spain. 12, 777-786. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/3365
Copyright Owner and License
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.