Integer programming formulations of discrete hub location problems

A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours

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

A bi-objective incomplete hub location-routing problem with flow shipment scheduling

Transportation costs are a significant part of capital and operating costs of large open pit mines Cost efficiency and high reliability of in pit crushing and conveying systems compared to conventional truck-shovel system makes it more appealing to be utilized in modern mining activities In this paper the suitable location of an in pit crusher is investigated as a single hub location problem In selecting the optimum location, two factors are considered First, the overall haulage cost is minimized, and second, the location is chosen such that it is not located inside the mining area, and crusher site is fixed through a period of at least one year Application of single hub problem is quite effective in determining the location of the in pit crusher The method is applied in Sarcheshmeh copper mine, to determine the optimum location of the in pit crushing and conveying system

https://www.ije.ir/article_72386_ecbeef1019b8e23dbc74a45966abf21d.pdf

An Approach to Locate an in Pit Crusher in Open Pit Mines

In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on the backbone (i.e. Network between hub nodes) and tributary networks (i.e. Networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is considered simultaneously and it has a multiple allocation strategy to allocate non-hub nodes to hub nodes. In addition, non-hub nodes can connect directly to each other. The objective of the proposed model is minimizing costs of establishing a network and transferring flows. To expedite solving the proposed model and improve the lower bound, which gain from linear relaxation, a number of preprocessing tests and valid inequalities are presented which have relatively good performance in the proposed model. Their performance is analyzed by implementing them on the test problems. Results show that using all preprocessing tests and valid inequalities is the best approach to solve the problem among all proposed approaches in this paper.

https://www.ije.ir/article_72172_261a73c3c286fc800cd6b19139939ecd.pdf

S. Rastani

Papers

Designing Incomplete Hub Location-routing Network in Urban Transportation Problem