Bi-objective load balancing multiple allocation hub location: a compromise programming approach

In this paper we address unbalanced spatial distribution of hub-level flows in an optimal hub-and-spoke network structure of median-type models. Our study is based on a rather general variant of the multiple allocation hub location problems with fixed setup costs for hub nodes and hub edges in both capacitated and uncapacitated variants wherein the number of hub nodes traversed along origin-destination pairs is not constrained to one or two as in the classical models.. From the perspective of an infrastructure owner, we want to make sure that there exists a choice of design for the hub-level sub-network (hubs and hub edges) that considers both objectives of minimizing cost of transportation and balancing spatial distribution of flow across the hub-level network. We propose a bi-objective (transportation cost and hub-level flow variance) mixed integer non-linear programming formulation and handle the bi-objective model via a compromise programming framework. We exploit the structure of the problem and propose a second-order conic reformulation of the model along with a very efficient matheuristics algorithm for larger size instances.

[1]  M. O'Kelly,et al.  A quadratic integer program for the location of interacting hub facilities , 1987 .

[2]  Stefan Nickel,et al.  Multi-period hub location problems in transportation , 2015 .

[3]  Andreas T. Ernst,et al.  A Stackelberg hub arc location model for a competitive environment , 2014, Comput. Oper. Res..

[4]  Ricardo Saraiva de Camargo,et al.  Single allocation hub location problem under congestion: Network owner and user perspectives , 2012, Expert Syst. Appl..

[5]  Mehrdad Mohammadi,et al.  Multi-objective hub network design under uncertainty considering congestion: An M/M/c/K queue system , 2016 .

[6]  Samir Elhedhli,et al.  A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion , 2010, INFORMS J. Comput..

[7]  Nenad Mladenovic,et al.  A general variable neighborhood search for solving the uncapacitated $$r$$r-allocation $$p$$p-hub median problem , 2017, Optim. Lett..

[8]  James F. Campbell.  Locating Transportation Terminals to Serve an Expanding Demand , 1990 .

[9]  Inmaculada Rodríguez Martín,et al.  A branch-and-cut algorithm for the hub location and routing problem , 2014, Comput. Oper. Res..

[10]  Parviz Fattahi,et al.  A Compromise Programming Model to Integrated Urban Water Management , 2010 .

[11]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[12]  Stefan Nickel,et al.  Multi-product Capacitated Single-Allocation Hub Location Problems: Formulations and Inequalities , 2014 .

[13]  Enrique Ballestero,et al.  Compromise programming: A utility-based linear-quadratic composite metric from the trade-off between achievement and balanced (non-corner) solutions , 2007, Eur. J. Oper. Res..

[14]  Carlos Romero,et al.  Multiple Criteria Analysis for Agricultural Decisions , 1989 .

[15]  F J André,et al.  Using compromise programming for macroeconomic policy making in a general equilibrium framework: theory and application to the Spanish economy , 2008, J. Oper. Res. Soc..

[16]  Shahin Gelareh,et al.  Hub Location Models in Public Transport Planning , 2008 .

[17]  N. Maculan,et al.  A co-opetitive framework for the hub location problems in transportation networks , 2017 .

[18]  Mikkel Thorup,et al.  Intra-domain traffic engineering with shortest path routing protocols , 2009, 4OR.

[19]  Gilbert Laporte,et al.  The Dynamic Uncapacitated Hub Location Problem , 2011, Transp. Sci..

[20]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[21]  Bahar Y. Kara,et al.  Hub location problems : the location of interacting facilities , 2011 .

[22]  Ehsan Nikbakhsh,et al.  Hub location problems: A review of models, classification, solution techniques, and applications , 2013, Comput. Ind. Eng..

[23]  Nenad Mladenovic,et al.  A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem , 2009, Eur. J. Oper. Res..

[24]  A. J. Goldman.  Optimal Locations for Centers in a Network , 1969 .

[25]  Mehrdad Tamiz,et al.  Goal programming, compromise programming and reference point method formulations: linkages and utility interpretations , 1998, J. Oper. Res. Soc..

[26]  Ricardo Saraiva de Camargo,et al.  Multiple allocation hub-and-spoke network design under hub congestion , 2009, Comput. Oper. Res..

[27]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[28]  Stefan Nickel,et al.  Hub location problems in transportation networks , 2011 .

[29]  Maghsoud Amiri,et al.  Nadir compromise programming: A model for optimization of multi-objective portfolio problem , 2011, Expert Syst. Appl..

[30]  Andreas T. Ernst,et al.  Efficient algorithms for the uncapac-itated single allocation p-hub median problem , 1996 .

[31]  Concha Bielza,et al.  COMPROMISE-BASED APPROACH TO ROAD PROJECT SELECTION IN MADRID METROPOLITAN AREA , 2003 .

[32]  AmiriMaghsoud,et al.  Nadir compromise programming , 2011 .

[33]  Andreas T. Ernst,et al.  Hub location problems , 2002 .

[34]  Ricardo Saraiva de Camargo,et al.  A hybrid Outer-Approximation/Benders Decomposition algorithm for the single allocation hub location problem under congestion , 2011, Oper. Res. Lett..

[35]  M. O'Kelly,et al.  Activity Levels at Hub Facilities in Interacting Networks , 2010 .

[36]  Maria Paola Scaparra,et al.  A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian Logistics , 2014, Comput. Oper. Res..

[37]  M. O'Kelly,et al.  Mode Choice in a Hub-and-Spoke Network: A Zero-One Linear Programming Approach , 2010 .

[38]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[39]  Randolph W. Hall,et al.  Configuration of an overnight package air network , 1989 .

[40]  Chandra Ade Irawan,et al.  Bi-objective optimisation model for installation scheduling in offshore wind farms , 2017, Comput. Oper. Res..

[41]  Sibel A. Alumur,et al.  Network hub location problems: The state of the art , 2008, Eur. J. Oper. Res..

[42]  Morton E. O'Kelly,et al.  Twenty-Five Years of Hub Location Research , 2012, Transp. Sci..

[43]  Argyris Kanellopoulos,et al.  Compromise programming: Non-interactive calibration of utility-based metrics , 2015, Eur. J. Oper. Res..

[44]  Chandra Ade Irawan,et al.  A multiple objective methodology for sugarcane harvest management with varying maturation periods , 2017, Annals of Operations Research.

[45]  Mehrdad Tamiz,et al.  Practical Goal Programming , 2010 .

[46]  Morton E. O'Kelly,et al.  Hub location with flow economies of scale , 1998 .

[47]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[48]  Morton E. O'Kelly,et al.  The Location of Interacting Hub Facilities , 1986, Transp. Sci..

[49]  Samir Elhedhli,et al.  Hub-and-spoke network design with congestion , 2005, Comput. Oper. Res..

[50]  Matteo Fischetti,et al.  Combinatorial Benders' Cuts for Mixed-Integer Linear Programming , 2006, Oper. Res..

[51]  Nenad Mladenovic,et al.  Less is more: Basic variable neighborhood search for minimum differential dispersion problem , 2016, Inf. Sci..