Experimental evaluation of meta-heuristics for multi-objective capacitated multiple allocation hub location problem
نویسندگان
چکیده
Multi-objective capacitated multiple allocation hub location problem (MOCMAHLP) is a variation of classic problem, which deals with network design, considering both the number and hubs connections between spokes, as well routing flow on network. In this study, we offer two meta-heuristic approaches based non-dominated sorting genetic algorithm (NSGA-II) archived multi-objective simulated annealing method (AMOSA) to solve MOCMAHLP. We attuned AMOSA approach obtain feasible solutions for developed five different neighborhood operators in approach. Moreover, NSGA-II approach, novel problem-specific mutation operators. To statistically analyze behavior algorithms, conducted experiments well-known data sets, namely Turkish Australian Post (AP). Hypervolume indicator used performance metric measure effectiveness given sets. experimental thorough tests are fine-tune proposed types AMOSA. Fine-tuning reveal that NSGA-II, probability does not have real effect set, whereas lower probabilities slightly better AP set. among operators, one adds/removes specific links according temperature (NS-5) performs than others After analyzing comparison our performed best settings. As result, conclude algorithms able find problem. larger, smaller size networks.
منابع مشابه
A Comparison of Four Multi-Objective Meta-Heuristics for a Capacitated Location-Routing Problem
In this paper, we study an integrated logistic system where the optimal location of depots and vehicles routing are considered simultaneously. This paper presents a new mathematical model for a multi-objective capacitated location-routing problem with a new set of objectives consisting of the summation of economic costs, summation of social risks and demand satisfaction score. A new multi-objec...
متن کامل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...
متن کاملHeuristics for solving a capacitated multiple allocation hub location problem with application in German wagonload traffic
In this paper, we present a capacitated multiple allocation hub location problem, which arose from a network design problem in German wagonload traffic. We develop heuristic solution approaches based on local improvements. We solve the problem with the heuristics and CPLEX on test data sets provided by our partner Deutsche Bahn AG. The computational results are presented and compared.
متن کاملComparing Three Proposed Meta-heuristics to Solve a New p-hub Location-allocation Problem
This paper presents a new mathematical model, in which the location of hubs is fixed and their capacity is determined based on facilities and factories allocated to it. In order to feed the client's nodes, different types of vehicles of different capacities are considered, in which the clients are allocated to hubs, and types and numbers of vehicles are allocated to the factory's facilities. To...
متن کاملCapacitated single allocation hub location problem - A bi-criteria approach
A different approach to the capacitated single allocation hub location problem is presented. Instead of using capacity constraints to limit the amount of flow that can be received by the hubs, we introduce a second objective function to the model (besides the traditional cost minimizing function), that tries to minimize the time to process the flow entering the hubs. Two bi-criteria single allo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Science and Technology, an International Journal
سال: 2022
ISSN: ['2215-0986']
DOI: https://doi.org/10.1016/j.jestch.2021.06.012