Bicriteria p-Hub Location Problems and Evolutionary Algorithms

Abstract

In this paper, we present two bicriteria uncapacitated, multiple allocation p-hub location problems. In the first problem, our first objective is to minimize the total transportation costs of the uncapacitated multiple allocation p-hub median problem with a positive interhub transfer cost. Our second objective is to minimize the total traveling costs between hub points and origin–destination points. In this case, the interhub transfer cost is negligible, and the problem turns into a well-known facility location problem, i.e., the p-median problem. In the second problem, we address the delays occurring with the congestion during service at the hubs. We consider the trade-off between our first objective and a new objective function, which is to minimize the maximum delay at each hub. We propose bicriteria evolutionary algorithms to approximate the efficient frontiers of these problems. We test the performance of our algorithm on Turkish Postal System, Australian Post, and U.S. Civil Aeronautics Board data sets.

Hub Location Problems

“…Costa et al (2008) and Köksalan and Soylu (2010) consider HLPS with multiple objectives. Puerto et al (2011) introduce a general class of HLPs that consider an ordered median function (see Chap.…”

“…Calık et al (2009) describe a tabu search to solve hub covering problems over incomplete hub networks. Köksalan and Soylu (2010) study evolutionary algorithms for two bicriteria uncapacitated p-hub location problems considering congestion-related costs. Contreras et al (2013) describe a GRASP algorithm for the design of incomplete hub networks with a cycle-star topology.…”

Robust and fuzzy goal programming optimization approaches for a novel multi-objective hub location-allocation problem: A supply chain overview

“…Mirzaei and Bashiri [46] used a multi-objective approach for hub location in order to reduce the overall cost of the networks minimizing the maximum travel time between the nodes. Köksalan and Soylu [47] presented two bi-criteria uncapacitated, multiple allocation p-hub location problems. Mohammadi et al [48] presented a new model for the capacitated single-allocation hub covering location problem.…”

“…Constraint (40) guarantees that facility type f size u can be opened (or reopened) provided that this facility is inactive in the previous period. Constraints (41)- (47) are non-negativity constraints, and constraint (48) is in relation to binary variables.…”

Multiobjective combinatorial optimization: some approaches

“…Ko¨ksalan and Lokman's (2009) experiments indicate that such a procedure would work well for other MOCO problems and more than two criteria as well. Ko¨ksalan and Soylu (2007) also used the idea of fitting an L p curve to represent the efficient solutions in a different context. They developed an MOEA to determine the locations of hubs as well as the allocations of shipments through the hubs considering two criteria.…”