The aim of this paper is to provide insights for better modeling hub location problems help create a road map future research. We first present taxonomy framework the broad array models, and then seek identify key gaps in literature that opportunities models. some new perspectives several areas, including historical evolution research, models economies scale, relevant characteristics different ...

This paper addresses the classical single and multiple allocation hub location problems with fully interconnected hubs, in which balanced round-trip flows on links are considered strategic decision making process. The use of is motivated by need to decrease empty-trip rate vehicles increase full-load vehicles. Mixed-integer programming models presented for versions problems. Numerical experimen...

In this paper we propose a 4-index formulation for the uncapacitated multiple allocation hub location problem tailored for urban transport and liner shipping network design. This formulation is very tight and most of the tractable instances for MIP solvers are optimally solvable at the root node. While the existing state-of-the-art MIP solvers fail to solve even small size instances of problem,...

The aim of this study is to present a Genetic Algorithm (GA) for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) and to demonstrate its robustness and effectiveness for solving this problem. The appropriate objective function is correcting infeasible individuals to be feasible. These corrections are frequent in the initial population, so that in the subsequent generation...

Third party service providers are locating logistic hub for operating their tasks. Finding a proper location helps them to have better performance in competitive environment. Multiple characteristics of proper location selection faces the decision maker to have a multi criteria decision making problem. Since the location decision is a long term planning, the robustness of the decision is gettin...

hub location-allocation problems are currently a subject of keen interest in the research community. however, when this issue is considered in practice, significant difficulties such as traffic, commodity transportation and telecommunication tend to be overlooked. in this paper, a novel robust mathematical model for a p-hub covering problem, which tackles the intrinsic uncertainty of some param...

In this paper we consider an extended version of the classical capacitated single allocation hub location problem in which the size of the hubs must be chosen from a finite and discrete set of allowable capacities. We develop a Lagrangian relaxation approach that exploits the problem structure and decomposes the problem into a set of smaller subproblems that can be solved efficiently. Upper bou...

majority of models in location literature are based on assumptions such as point demand, absence of competitors, as well as monopoly in location, products, and services. however in real-world applications, these assumptions are not well-matched with reality. in this study, a new mixed integer nonlinear programming model based on weighted goal programming approach is proposed to maximize the cap...