Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery

[1]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[2]  C. Watson-Gandy,et al.  Depot location with van salesmen — A practical approach , 1973 .

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  A. Claus.  A new formulation for the travelling salesman problem , 1984 .

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

[6]  Said Salhi,et al.  The effect of ignoring routes when locating depots , 1989 .

[7]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[8]  James F. Campbell,et al.  Integer programming formulations of discrete hub location problems , 1994 .

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

[10]  D. Skorin-Kapov,et al.  Tight linear programming relaxations of uncapacitated p-hub median problems , 1996 .

[11]  James F. Campbell.  Hub Location and the p-Hub Median Problem , 1996, Oper. Res..

[12]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[13]  S. Salhi,et al.  The many-to-many location-routing problem , 1998 .

[14]  Andreas T. Ernst,et al.  Solution algorithms for the capacitated single allocation hub location problem , 1999, Ann. Oper. Res..

[15]  M. Wasner,et al.  An integrated multi-depot hub-location vehicle routing model for network planning of parcel service , 2004 .

[16]  Haluk Topcuoglu,et al.  Solving the uncapacitated hub location problem using genetic algorithms , 2005, Comput. Oper. Res..

[17]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[18]  Saïd Salhi,et al.  Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..

[19]  Jeng-Fung Chen,et al.  A hybrid heuristic for the uncapacitated single allocation hub location problem , 2007 .

[20]  Bahar Y. Kara,et al.  A hub covering model for cargo delivery systems , 2007 .

[21]  J. Kratica,et al.  Two genetic algorithms for solving the uncapacitated single allocation p , 2007, Eur. J. Oper. Res..

[22]  Claudio B. Cunha,et al.  A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil , 2007, Eur. J. Oper. Res..

[23]  Steve R. White,et al.  Concepts of scale in simulated annealing , 2008 .

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

[25]  Sibel A. Alumur,et al.  A tabu-search based heuristic for the hub covering problem over incomplete hub networks , 2009, Comput. Oper. Res..

[26]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[27]  Andreas T. Ernst,et al.  A 2-phase algorithm for solving the single allocation p-hub center problem , 2009, Comput. Oper. Res..

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

[29]  Haldun Süral,et al.  Hubbing and routing in postal delivery systems , 2010, Ann. Oper. Res..

[30]  Zorica Stanimirovic,et al.  A Genetic Algorithm Approach for the Capacitated Single Allocation P-Hub Median Problem , 2012, Comput. Informatics.

[31]  David Pisinger,et al.  Fleet deployment, network design and hub location of liner shipping companies , 2011 .

[32]  Bahar Y. Kara,et al.  A New Formulation Approach for Location-Routing Problems , 2012 .

[33]  Sibel A. Alumur,et al.  Multimodal hub location and hub network design , 2012 .

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

[35]  J. Bowen.  A spatial analysis of FedEx and UPS: hubs, spokes, and network structure , 2012 .

[36]  Sibel A. Alumur,et al.  Hierarchical multimodal hub location problem with time-definite deliveries , 2012 .

[37]  Ching-Jung Ting,et al.  A multiple ant colony optimization algorithm for the capacitated location routing problem , 2013 .

[38]  I. B. Turksen,et al.  The incomplete hub-covering location problem considering imprecise location of demands , 2013 .

[39]  Ricardo Saraiva de Camargo,et al.  A new formulation and an exact approach for the many-to-many hub location-routing problem , 2013 .

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

[41]  Julia Rieck,et al.  Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery , 2014, Eur. J. Oper. Res..

[42]  Hossein Karimi,et al.  Proprietor and customer costs in the incomplete hub location-routing network topology , 2014 .

[43]  Shih-Wei Lin,et al.  Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery , 2014, Appl. Soft Comput..

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

[45]  Francesc Robusté,et al.  Stopover and hub-and-spoke shipment strategies in less-than-truckload carriers , 2015 .

[46]  Iván A. Contreras,et al.  Hub Location Problems , 2015 .

[47]  Jairo R. Montoya-Torres,et al.  A literature review on the vehicle routing problem with multiple , 2014 .

[48]  Michael Drexl,et al.  A survey of variants and extensions of the location-routing problem , 2015, Eur. J. Oper. Res..

[49]  Sibel A. Alumur,et al.  The design of capacitated intermodal hub networks with different vehicle types , 2016 .

[50]  Flávio Keidi Miyazawa,et al.  Heuristics for a hub location‐routing problem , 2016, Networks.