Bi-objective optimization of multi-server intermodal hub-location-allocation problem in congested systems: modeling and solution

Authors

  • Mahdi Rashidi Kahag Young Researchers and Elite Club, Qazvin Branch, Islamic Azad University, Qazvin, Iran
  • Mehdi Seifbarghy Department of Industrial Engineering, Alzahra University, Tehran, Iran
  • Seyed Taghi Akhavan Niaki Department of Industrial Engineering, Sharif University of Technology, P.O. Box 11155-9414, Azadi Ave, Tehran, Iran
  • Sina Zabihi Department of Industrial Engineering, Firoozkooh Branch, Islamic Azad University, Firoozkooh, Iran
Abstract:

A new multi-objective intermodal hub-location-allocation problem is modeled in this paper in which both the origin and the destination hub facilities are modeled as an M/M/m queuing system. The problem is being formulated as a constrained bi-objective optimization model to minimize the total costs as well as minimizing the total system time. A small-size problem is solved on the GAMS software to validate the accuracy of the proposed model. As the problem becomes strictly NP-hard, an MOIWO algorithm with an efficient chromosome structure and a fuzzy dominance method is proposed to solve large-scale problems. Since there is no benchmark available in the literature, an NSGA-II and an NRGA are developed to validate the results obtained. The parameters of all algorithms are tuned using the Taguchi method and their performances are statistically compared in terms of some multi-objective metrics. Finally, the entropy-TOPSIS method is applied to show that MOIWO is the best in terms of simultaneous use of all the metrics.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A multi-objective harmony search algorithm to optimize multi-server location-allocation problem in congested systems

A novel bi-objective multi-server location-allocation (LA) model is developed in this paper, in which the facilities are modeled as an M/M/m queuing system. Further, capacity and budget limitations are provided to make the LA problem more realistic. The two objective functions include (1) minimizing aggregate waiting times and (2) minimizing the maximum idle time of all facilities. Since the pr...

full text

solution of security constrained unit commitment problem by a new multi-objective optimization method

چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...

Bi-objective Non-strict Single Allocation Hub Location Problem: Mathematical Programming Model and a Solution Heuristic

Hub location problem (HLP) is one of the most important problems in the areas of logistics and telecommunication network design. In this paper we address the bi-objective non-strict single allocation hub location problem (BONSSAHLP). The non-strict property of this problem which allows establishment of direct links between pairs of non-hub nodes makes it somehow different from the conventional ...

full text

A Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem

In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...

full text

Bi-objective Optimization of a Multi-product multi-period Fuzzy Possibilistic Capacitated Hub Covering Problem: NSGA-II and NRGA Solutions

The hub location problem is employed for many real applications, including delivery, airline and telecommunication systems and so on. This work investigates on hierarchical hub network in which a three-level network is developed. The central hubs are considered at the first level, at the second level, hubs are assumed which are allocated to central hubs and the remaining nodes are at the third ...

full text

A Congested Double Path Approach for a Hub Location-allocation Problem with Service Level at Hubs

In this paper an uncapacitated multiple allocation p-hub median problem is discussed. The model minimizes the transportation cost based on inventory service level at hubs through double paths between hubs. Inventory service level is defined as the percent of inventory shortage of vehicles at hubs according to passengers demand and replenishment time of vehicles. A real data from 25 nodes of mun...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 15  issue 2

pages  -

publication date 2019-06-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023