In the classical USApHMP, transportation costs are modeled as linear functions of the transport volume, where a fixed discount factor on hub-hub connections is introduced to simulate economies of scale.
Published in Chapter:
Hub Location Allocation Problems and Solution Algorithms
Peiman A. Sarvari (Istanbul Technical University, Turkey), Fatma Betül Yeni (Istanbul Technical University, Turkey), and Emre Çevikcan (Istanbul Technical University, Turkey)
Copyright: © 2018
|Pages: 30
DOI: 10.4018/978-1-5225-2944-6.ch005
Abstract
The Hub Location-Allocation Problem is one of the most important topics in industrial engineering and operations research, which aims to find a form of distribution strategy for goods, services, and information. There are plenty of applications for hub location problem, such as Transportation Management, Urban Management, locating service centers, Instrumentation Engineering, design of sensor networks, Computer Engineering, design of computer networks, Communication Networks Design, Power Engineering, localization of repair centers, maintenance and monitoring power lines, and Design of Manufacturing Systems. In order to define the hub location problem, the present chapter offers two different metaheuristic algorithms, namely Particle Swarm Optimization or PSO and Differential Evolution. The presented algorithms, then, are applied to one of the hub location problems. Finally, the performances of the given algorithms are compared in term of benchmarking.