Filters








26 Hits in 7.0 sec

Chaotic Particle Swarm Optimization Algorithm for Hub and Spoke Systems with Congestion

Weiwei Wu, Hui Wang
2014 Open Automation and Control Systems Journal  
In the actual operations of airlines, such problem is difficult to be solved by using the classical optimization methods. This paper presents a Particle Swarm Optimization (PSO) algorithm.  ...  The hub-and-spoke airline network optimization model with congestion cost is designed.  ...  Using the model of the uncapacitated multiple allocation p hub location problem (UMApHMP) [15] , the flow through Considering the congestion effect on network design, some improvement on UMApHMP model  ... 
doi:10.2174/1874444301406010609 fatcat:wt3kwx7wurab7ci65ggqgqweue

A highly efficient exact algorithm for the uncapacitated multiple allocation p-hub center problem

Nader Ghaffarinasab
2020 Decision Science Letters  
This paper addresses the problem of uncapacitated multiple allocation p-hub center problem (UMApHCP) which is fundamental in proper functioning of time-sensitive transportation systems.  ...  The proposed algorithm is capable of solving large-scale instances of the problem to optimality in order of seconds.  ...  technique and a specialized version of Benders decomposition procedure for solving single allocation hub location problem under congestion.  ... 
doi:10.5267/j.dsl.2019.12.001 fatcat:lglydhexbzbhtas4qcr3uiv5fu

Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU [chapter]

A. Benaini, A. Berrajaa, J. Boukachour, M. Oudani
2018 Studies in Computational Intelligence  
A parallel genetic algorithm (GA) implemented on GPU clusters is proposed to solve the Uncapacitated Single Allocation p-Hub Median problem.  ...  The GA uses binary and integer encoding and genetic operators adapted to this problem. Our GA is improved by generated initial solution with hubs located at middle nodes.  ...  Abyazi-Sani for instances data set provided.  ... 
doi:10.1007/978-3-319-95104-1_2 fatcat:lydott4mkzekpgg4yu6dwt5uei

A Comparative Study on Swarm-based Algorithms to Solve the Stochastic Optimization Problem in Container Terminal Design

Febri Zukhruf, Russ Bona Frazila, Wijang Widhiarso
2020 International Journal of Technology  
A new variant of glowworm swarm optimization (GSO) was then proposed and compared with particle swarm optimization (PSO) algorithms.  ...  Given that the optimization problem is typified by numerous combinations of actions, the swarm-based algorithms were deployed to develop a feasible solution.  ...  Particle Swarm Optimization for Uncapacitated Multiple Allocation Hub Location Problem under Congestion.  ... 
doi:10.14716/ijtech.v11i2.2090 doaj:5b42a5d6770e499d8c9002dc9c40b87c fatcat:rlrqxskdxvc7zevukikitbpd2i

Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion

Nader Azizi, Navneet Vidyarthi, Satyaveer S. Chauhan
2017 Annals of Operations Research  
The proposed model determines the location and capacity of the hub nodes and allocate nonhub nodes to these hubs while minimizing the sum of the fixed cost, transportation cost and the congestion cost.  ...  Motivated by the strategic importance of congestion management, in this paper we present a model to design hub-and-spoke networks under stochastic demand and congestion.  ...  Along the same line, Camargo et al. (2009a) proposed a generalized convex cost function to model congestion in an uncapacitated multiple-allocation hub location problem under deterministic demand.  ... 
doi:10.1007/s10479-017-2656-3 fatcat:ly7ptzmh4rfmxafwjfexxltv2q

Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods

Nader Azizi
2017 Annals of Operations Research  
In this study, first a mathematical model to design hub-and-spoke networks under hub failure is presented.  ...  To tackle large problems, three efficient particle swarm optimisation-based metaheuristics which incorporate efficient solution representation, short-term memory and special crossover operator are proposed  ...  Hub location problems are categorised into two distinctive groups namely single and multiple allocation problems.  ... 
doi:10.1007/s10479-017-2517-0 fatcat:3b3eeylkbfcerabumoe75mvdie

A multi-objective imperialist competitive algorithm for a capacitated hub covering location problem

M Mohammadi, R Tavakkoli-Moghaddam, H Rostami
2011 International Journal of Industrial Engineering Computations  
This paper considers a multiobjective hub covering location problem under congestion.  ...  Simulated annealing is used to solve the resulted model and the performance of the proposed model is compared against two other alternative methods, particle sward optimization and NSGA-II.  ...  This paper considers a multiobjective hub covering location problem under congestion.  ... 
doi:10.5267/j.ijiec.2010.08.003 fatcat:muieznfeqfev5orvyue3luiu7m

Optimization of the Collaborative Hub Location Problem with Metaheuristics

Gargouri Mohamed Amine, Hamani Nadia, Mrabti Nassim, Kermad Lyes
2021 Mathematics  
Four algorithms were developed to achieve our objectives: a genetic algorithm, a simulated annealing, a particle swarm algorithm, and a vibration damping optimization algorithm.  ...  Considering a French distribution network, these algorithms overcame the limits of the exact solution method by obtaining optimal solutions with reasonable execution time.  ...  [25] examined an uncapacitated single allocation p-hub location problem (USAp-HLP) with two evolutionary metaheuristics.  ... 
doi:10.3390/math9212759 fatcat:n5wfrr6g6vbtrjy7cy64ubcwxq

Design of a reliable logistics network with hub disruption under uncertainty

Mehrdad Mohammadi, Reza Tavakkoli-Moghaddam, Ali Siadat, Jean-Yves Dantan
2016 Applied Mathematical Modelling  
This is an author-deposited version published in: https://sam.ensam.eu Handle IDa b s t r a c t In this study, we design a reliable logistics network based on a hub location problem, which is less sensitive  ...  This model considers complete and partial disruption at hubs. In addition, we propose a new hybrid meta-heuristic algorithm based on genetic and imperialist competitive algorithms.  ...  Additionally, the authors would like thank the Editor-in-Chief and anonymous reviewers for their valuable comments and acceptance letter.  ... 
doi:10.1016/j.apm.2016.01.011 fatcat:2nofpnafm5az3hwt7zfopepn5u

On Multistage Multiscale Stochastic Capacitated Multiple Allocation Hub Network Expansion Planning

Laureano F. Escudero, Juan F. Monge
2021 Mathematics  
This work focuses on the development of a stochastic mixed integer linear optimization modeling framework and a matheuristic approach for solving the multistage multiscale allocation hub location network  ...  The hub location problem (HLP) basically consists of selecting nodes from a network to act as hubs to be used for flow traffic directioning, i.e., flow collection from some origin nodes, probably transfer  ...  Mixed integer-based approaches for dealing with discrete multiple location-allocation hub-centroid problems are presented in [26] and references therein.  ... 
doi:10.3390/math9243177 fatcat:grkvi76xg5agdbhoktcfy7fhty

Multiple criteria facility location problems: A survey

Reza Zanjirani Farahani, Maryam SteadieSeifi, Nasrin Asgari
2010 Applied Mathematical Modelling  
This paper provides a review on recent efforts and development in multi-criteria location problems in three categories including bi-objective, multi-objective and multi-attribute problems and their solution  ...  While there are a few chapters or sections in different location books related to this topic, we have not seen any comprehensive review papers or book chapter that can cover it.  ...  The paper remarkably improved through their recommendations; yet, the authors are responsible for any remaining errors.  ... 
doi:10.1016/j.apm.2009.10.005 fatcat:gzzoojxkxfb2fosbdhv47bvdq4

Modelling and solving a congested facility location problem considering systems' and customers' objectives.pdf

Mehdi Seifbarghy, Aida Mansouri
2020 Figshare  
This paper presents a model for the location of facilities subject to congestion.  ...  centres and to reduce total costs of both customers and service providers, the given model in this research is proposed for situations, in which immobile service facilities are congested by stochastic  ...  Practical implications of the study In this paper, we have proposed a model which can be applied for the location of communication networks, bank branches, automatic teller machines (ATMs), police services  ... 
doi:10.6084/m9.figshare.12249512 fatcat:ocyb7js3nfcj7er4wd5k6b5tjm

Recent advances in robust optimization: An overview

Virginie Gabrel, Cécile Murat, Aurélie Thiele
2014 European Journal of Operational Research  
Key developments in the period from 2007 to present include: (i) an extensive body of work on robust decision-making under uncertainty with uncertain distributions, i.e., "robustifying" stochastic optimization  ...  optimization and risk theory, the concept of distributionally robust optimization, and findings in robust nonlinear optimization.  ...  Acknowledgments The authors would like to thank the Associate Editor and three anonymous referees for their insightful comments and suggestions.  ... 
doi:10.1016/j.ejor.2013.09.036 fatcat:negoppbbu5hanjkdlccdwjb35a

Vehicle Routing Optimisation in Humanitarian Operations: A Survey on Modelling and Optimisation Approaches

Wadi Khalid Anuar, Lai Soon Lee, Stefan Pickl, Hsin-Vonn Seow
2021 Applied Sciences  
This paper focuses on the branch of a well-known OR problem, known as the Vehicle Routing Problem (VRP), within the selected scope of humanitarian operations.  ...  Finally, the trend and future outlook of VRP for the suggested humanitarian operations are discussed and highlighted.  ...  In order to solve the problem efficiently, a K-Means clustering algorithm is applied to cluster various emergency location into groups before computing the route for each cluster while using Particle Swarm  ... 
doi:10.3390/app11020667 fatcat:vo7i2wwz7vevvohbzqyn7v72ke

Hub Covering Location Problem Considering Queuing and Capacity Constraints

Mehdi Seifbarghy, Mojtaba Hemmati, Soltan Karimi
2018 Journal of Optimization in Industrial Engineering   unpublished
Due to the computational complexity of the problem, genetic algorithm (GA), particle swarm optimization (PSO) based heuristics, and improved hybrid PSO are developed to solve the problem.  ...  In this paper, a hub covering location problem is considered.  ...  Gelare and Nickle (2011) proposed a 4-index formulation for the uncapacitated multiple allocation hub location problem tailored for urban transport and liner shipping network design.  ... 
fatcat:kas4mzzy65g47kioeijj2gozoq
« Previous Showing results 1 — 15 out of 26 results