The capacitated hub covering location-routing problem for simultaneous pickup and delivery systems

•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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers & industrial engineering Ročník 116; s. 47 - 58
Hlavný autor: Karimi, Hossein
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Ltd 01.02.2018
Predmet:
Covering
Hub network
Tabu search
Valid inequality
Vehicle routing problem
Covering
Tabu search
Vehicle routing problem
Hub network
Valid inequality
ISSN:0360-8352, 1879-0550
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•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. 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.
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2017.12.020