Efficient metaheuristics to solve the intermodal terminal location problem

The objective of the intermodal terminal location problem is to determine which of a set of potential terminal locations to use and how to route the supply and demand of a set of customers (representing zones of supply and demand) through the network (by both uni- and intermodal transport) so as to minimize the total cost. Two different metaheuristic procedures are developed that both consist of two phases: a solution construction phase (either GRASP or attribute based hill climber) and a solution improvement phase based on local search. Innovative in this approach is the integration of a fast heuristic procedure to approximate the total cost given the set of open terminals. Both metaheuristics are compared to the results of an MIP solver. A thorough performance assessment uncovers that both metaheuristics generate close-to-optimal solutions in very short computing times. An argument in favor of the ABHC approach is that it is parameter-free and hence more transparent and likely to be accepted in a business or policy environment.

[1]  Bart Jourquin,et al.  Optimal rail-road container terminal locations on the European network , 2009 .

[2]  Luis Ferreira,et al.  Multi-objective evaluation of intermodal freight terminal location decisions , 2005 .

[3]  George D. Smith,et al.  The Attribute Based Hill Climber , 2004, J. Math. Model. Algorithms.

[4]  Bcjm Rutten.  MEDIUM DISTANCE INTERMODAL RAIL TRANSPORT , 1995 .

[5]  Julius Sigut,et al.  Measuring the performance of intermodal freight terminals , 1993 .

[6]  Rafay Ishfaq,et al.  Intermodal logistics: The interplay of financial, operational and service issues , 2010 .

[7]  Teodor Gabriel Crainic,et al.  Bundle-based relaxation methods for multicommodity capacitated fixed charge network design , 2001, Discret. Appl. Math..

[8]  Claudio Thombas Bornstein,et al.  The use of reduction tests and simulated annealing for the capacitated plant location problem , 1998 .

[9]  Thomas Stützle,et al.  Ant Colony Optimization and Swarm Intelligence , 2008 .

[10]  Hugues Marchand,et al.  Pour une localisation optimale des centres de transbordement intermodaux entre réseaux de transport: formulation et extensions , 2001 .

[11]  Dominique Peeters,et al.  Modelling a rail/road intermodal transportation system , 2004 .

[12]  Ulrich Derigs,et al.  Applying the attribute based hill climber heuristic to the vehicle routing problem , 2007, Eur. J. Oper. Res..

[13]  Cathy Macharis,et al.  Opportunities for OR in intermodal freight transport research: A review , 2004, Eur. J. Oper. Res..

[14]  G D Taylor,et al.  SIMULATION OF THE RAILWAY COMPONENT OF INTERMODAL TRANSPORTATION , 1998 .

[15]  J. J. Trip,et al.  Is a new applied transportation research field emerging?--A review of intermodal rail-truck freight transport literature , 2004 .

[16]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[17]  Patrick Jochem,et al.  CO2 Emission Reduction in Freight Transports: How to Stimulate Environmental Friendly Behaviour? , 2008 .

[18]  M. Janić.  Modelling the full costs of an intermodal and road freight transport network , 2007 .

[19]  Said Salhi,et al.  Discrete Location Theory , 1991 .

[20]  Angela Me,et al.  The UNECE gender statistics database. , 2004 .

[21]  Andreas T. Ernst,et al.  Preprocessing and cutting for multiple allocation hub location problems , 2004, Eur. J. Oper. Res..

[22]  Peter Nijkamp,et al.  INTERMODAL FREIGHT TERMINALS: AN ANALYSIS OF THE TERMINAL MARKET , 1999 .

[23]  Harry Venables,et al.  An Adaptive Search Heuristic for the Capacitated Fixed Charge Location Problem , 2006, ANTS Workshop.

[24]  Harry Venables,et al.  Ant Based Heuristics for the Capacitated Fixed Charge Location Problem , 2008, ANTS Conference.

[25]  Illia Racunica,et al.  OPTIMAL LOCATION OF INTERMODAL FREIGHT HUBS , 2005 .

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

[27]  Andreas T. Ernst,et al.  The capacitated multiple allocation hub location problem: Formulations and algorithms , 2000, Eur. J. Oper. Res..

[28]  Zofia Lukszo,et al.  Optimizing the Location of Intermodal Freight Hubs: An Overview of Agent Based Modelling Approach , 2007 .

[29]  Michael Berliner Pedersen.  Optimization models and solution methods for intermodal transportation , 2005 .

[30]  Antonio Frangioni,et al.  0-1 Reformulations of the Multicommodity Capacitated Network Design Problem , 2009, Discret. Appl. Math..

[31]  R. D. Galvão,et al.  A tabu search heuristic for the concentrator location problem , 1998 .

[32]  Alfredo Marín,et al.  Formulating and solving splittable capacitated multiple allocation hub location problems , 2005, Comput. Oper. Res..

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

[34]  Rajan Batta,et al.  On the use of genetic algorithms to solve location problems , 2002, Comput. Oper. Res..

[35]  Lori Tavasszy,et al.  Towards collaborative, intermodal hub networks. A case study in the fast moving consumer goods market , 2005 .

[36]  Rafay Ishfaq,et al.  Production , Manufacturing and Logistics Hub location – allocation in intermodal logistic networks , 2010 .