Exact Optimization of Multiple Allocation Hub Location Routing Problem

点击翻译按钮获取中文摘要

This research focuses on the multi-allocation hub location routing problem (MAHLRP), which arises in many-to-many logistics systems, such as express mail delivery systems. So far, the heuristics solution algorithm for the MAHLRP and an exact solution approach has been developed for a single allocation version of the problem, which will support the comparative analysis. The associated numerical analysis and the sensitivity analysis related with the exact solution algorithm of the single allocation problem was performed. The research article was submitted to a reputed international journal, and after a few rounds of reviews and revisions it was accepted and published.An application of the MAHLRP in solving warehouse matching platform system (WMPS) has been developed. In the WMPS system provider connects businesses in need of warehouse space with companies that have excess warehouse capacity on its platform. The WSPS enables the usage of existing idle warehouses and avoid the inundation of factory-owned warehouses. As an MAHLRP application the WMPS can be setup where the factories and their final customers represent the non-hub nodes and the rental warehouses as hubs. It enables a dynamic supply network to respond to changing demand requirements both temporally and spatially.The work on the exact solution of the MAHLRP has also progressed, where the algorithm has been coded and a basic numerical analysis is being carried out. Its performance and comparison with other algorithms and problems is still needed to show its advantages.