Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 525980, 11 pages
Research Article

An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem

Hankuk University of Foreign Studies, Yongin 449791, Republic of Korea

Received 25 February 2015; Accepted 21 June 2015

Academic Editor: Emilio Insfran

Copyright © 2015 Ji Ung Sun. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We consider a capacitated hub location-routing problem (HLRP) which combines the hub location problem and multihub vehicle routing decisions. The HLRP not only determines the locations of the capacitated -hubs within a set of potential hubs but also deals with the routes of the vehicles to meet the demands of customers. This problem is formulated as a 0-1 mixed integer programming model with the objective of the minimum total cost including routing cost, fixed hub cost, and fixed vehicle cost. As the HLRP has impractically demanding for the large sized problems, we develop a solution method based on the endosymbiotic evolutionary algorithm (EEA) which solves hub location and vehicle routing problem simultaneously. The performance of the proposed algorithm is examined through a comparative study. The experimental results show that the proposed EEA can be a viable solution method for the supply chain network planning.