Multimodal Transportation p-hub Location Routing Problem with Simultaneous Pick-ups and Deliveries

Abstract

Centralizing and using proper transportation facilities cut down costs and traffic. Hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. A distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and deliveries on time. A few studies have been devoted to this problem; however, many people are still suffering from the problems of commuting in crowded cities. The proposed formulation controlled the tumult of each node by indirect fixed cost. Node-to-node traveling cost was followed by a vehicle routing problem between nodes of each hub. A couple of datasets were solved for small and medium scales by GAMS software. But, for large-scale instances, a meta-heuristic algorithm was proposed. To validate the model, datasets were used and the results demonstrated the performance suitability of the proposed algorithm.