The capacitated hub covering location-routing problem for simultaneous pickup and delivery systems. (February 2018)

• Record Type: Journal Article
• Authors: Karimi, Hossein
• Is Part Of: Computers & industrial engineering. Volume 116(2018)
• Page Start: 47
• Page End: 58
• Publication Date: 2018-02
• Subjects: Hub network -- Vehicle routing problem -- Tabu search -- Covering -- Valid inequality; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2017.12.020
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: A new hub network called as capacitated hub covering location-routing problem is studied. We solve the model with a tabu-search based heuristic. A set of valid inequalities is introduced to tighten the formulation. Computational results demonstrate the high efficiency of valid inequalities and tabu-search based heuristic. Abstract: In this study, a specific type of hub network topology, called hub location-routing, is presented in which the routes between the nodes assigned to a hub form a tour in this topology. The model minimizes the total cost of hub location and vehicle routing, subject to predefined travel time, hub capacity, vehicle capacity, and simultaneous pickups and deliveries. A polynomial-size mixed integer programming formulation is introduced for the single allocation type of the problems. In this paper, a set of valid inequalities is proposed for the formulation. In addition, a tabu-search based heuristic is suggested which determines the hub location and vehicle routes simultaneously. Series of computational tests are then executed to evaluate the performance of valid inequalities and tabu-search based heuristic. The results show that using all valid inequalities improves the solution time of the pure proposed model. Meanwhile, the proposed heuristic works efficiently in finding good-quality solutions for the proposed hub location-routing model.