A genetic algorithm for the uncapacitated single allocation planar hub location problem

Date

2015-10-01

Author

Damgacioglu, Haluk
DİNLER, DERYA
Özdemirel, Nur Evin
İyigün, Cem

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

219
views

0
downloads

Given a set of n interacting points in a network, the hub location problem determines location of the hubs (transfer points) and assigns spokes (origin and destination points) to hubs so as to minimize the total transportation cost. In this study, we deal with the uncapacitated single allocation planar hub location problem (PHLP). In this problem, all flow between pairs of spokes goes through hubs, capacities of hubs are infinite, they can be located anywhere on the plane and are fully connected, and each spoke must be assigned to only one hub. We propose a mathematical formulation and a genetic algorithm (PHLGA) to solve PHLP in reasonable time. We test PHLGA on simulated and real life data sets. We compare our results with optimal solution and analyze results for special cases of PHLP for which the solution behavior can be predicted. Moreover, PHLGA results for the AP and CAB data set are compared with other heuristics.

Subject Keywords

Genetic algorithms, Hub location problems, Planar hub location problems

URI

https://hdl.handle.net/11511/48941

Journal

COMPUTERS & OPERATIONS RESEARCH

DOI

https://doi.org/10.1016/j.cor.2014.09.003

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

An iterative hub location and routing problem for postal delivery systems Çetiner, Selim; Sepil, Canan; Süral, Haldun; Department of Industrial Engineering (2003) In this study, we consider the Turkish postal delivery system and develop an effective solution approach for the combined hub location and routing problem where the location of hub nodes are determined, the nonhub regional postal offices are allocated to the hubs, and the optimal set of routes are determined for each hub. Since the realized post-routing distances between origin-destination pairs are different from those used in the hub-location model, we develop an algorithm that finds the route-compatible ...
A maximal covering location model in the presence of partial coverage Karasakal, O; Karasakal, Esra (2004-08-01) The maximal covering location problem (MCLP) addresses the issue of locating a predefined number of facilities in order to maximize the number of demand points that can be covered. In a classical sense, a demand point is assumed to be covered completely if located within the critical distance of the facility and not covered at all outside of the critical distance. Since the optimal solution to a MCLP is likely sensitive to the choice of the critical distance, determining a critical distance value when the c...
A genetic algorithm for the p-hub center problem with stochastic service level constraints Eraslan Demirci, Şükran; Meral, Fatma Sedef; Department of Industrial Engineering (2010) The emphasis on minimizing the costs and travel times in a network of origins and destinations has led the researchers to widely study the hub location problems in the area of location theory in which locating the hub facilities and designing the hub networks are the issues. The p-hub center problem considering these issues is the subject of this study. p-hub center problem with stochastic service level constraints and a limitation on the travel times between the nodes and hubs is addressed, which is an unc...
A computation-implementation parallelization approach to the vehicle loading and routing problem Çavdar, Bahar; Sokol, Joel (Wiley, 2019-01-01) In this article, we address a version of the capacitated vehicle routing problem where there is a constraint on the total time that can be spent on computing delivery routes and loading the vehicles. This problem, which we call the vehicle loading and routing problem (VLRP), can arise, for example, in the delivery of small, quick-turnaround orders from a warehouse. We propose a computation-implementation parallelization (CIP) approach to solving large VLRP instances, and present computational results showin...
A column generation approach for the location-routing problem with time windows Farham, Mohammad Saleh; Süral, Haldun; İyigün, Cem (2018-02-01) The location-routing problem with time windows consists of opening a subset of depots, assigning customers to depots, and determining routes within allowable times such that the sum of depot opening, vehicle usage, and traveling costs is minimized. Customers have to be visited only once during their time windows and depot capacities and load limits of vehicles cannot be violated. In order to find the exact solution to the problem, we propose a branch-and-price algorithm based on set-partitioning approach. T...

Citation Formats

H. Damgacioglu, D. DİNLER, N. E. Özdemirel, and C. İyigün, “A genetic algorithm for the uncapacitated single allocation planar hub location problem,” COMPUTERS & OPERATIONS RESEARCH, pp. 224–236, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/48941.