Iterated local search adapted to clustering and routing problems

Physical distribution is a critical activity for companies because it defines successful customer service. This article discusses a case study of a liquefied gas distributor with respect to improving customer service and reducing delivery costs. The proposed method for the delivery process consists of two steps: First, the customers for each day are distributed to the delivery trucks by using the metaheuristic Iterated Local Search (ILS) in order to solve the Capacitated P-median Problem. This metaheuristic is also applied to some published instances in order to assess their efficiency in problems of different sizes. The second stage consists of determining the route of each truck by using the ILS metaheuristic for the traveling salesman problem. The results show a reduction of 11% in the distances in the clusters, in addition to an improvement in the routing, which previously did not use mathematical methods. These results generate improvement in terms of both the level of service offered to customers and the scale economy. The metaheuristic ILS performs well for the two subjects tackled, with a very low error compared to the exact methods and almost instantaneous computational times.

[1]  Daniel Cosmin Porumbel,et al.  Using dual feasible functions to construct fast lower bounds for routing and location problems , 2015, Discret. Appl. Math..

[2]  Ping Chen,et al.  A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time , 2013, Comput. Oper. Res..

[3]  Nicos Christofides,et al.  Capacitated clustering problems by hybrid simulated annealing and tabu search , 1994 .

[4]  Masoud Yaghini,et al.  A hybrid metaheuristic approach for the capacitated p-median problem , 2013, Appl. Soft Comput..

[5]  Liang Gao,et al.  An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem , 2014, Asia Pac. J. Oper. Res..

[6]  Javier Del Ser,et al.  A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem , 2012, Comput. Oper. Res..

[7]  François Guibault,et al.  An iterated-tabu-search heuristic for a variant of the partial set covering problem , 2014, Journal of Heuristics.

[8]  Yiming Zhang,et al.  Solving traveling salesman problem in the Adleman-Lipton model , 2012, Appl. Math. Comput..

[9]  Kevin Tickle,et al.  Solving the traveling salesman problem using cooperative genetic ant systems , 2012, Expert Syst. Appl..

[10]  T. Stützle,et al.  Analyzing the Run-time Behaviour of Iterated Local Search for the TSP , 1999 .

[11]  Pieter Vansteenwegen,et al.  An iterated local search algorithm for the single-vehicle cyclic inventory routing problem , 2014, Eur. J. Oper. Res..

[12]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[13]  Chieh-Li Chen,et al.  Evolutionary algorithm to traveling salesman problems , 2012, Comput. Math. Appl..

[14]  Masoud Yaghini,et al.  An efficient heuristic algorithm for the capacitated $$p-\!$$ median problem , 2013, 4OR.

[15]  Luiz Antonio Nogueira Lorena,et al.  A column generation approach to capacitated p-median problems , 2004, Comput. Oper. Res..

[16]  Diogo Vieira Andrade,et al.  Fast local search for the maximum independent set problem , 2012, J. Heuristics.

[17]  Thibaut Vidal,et al.  An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems , 2013, Expert Syst. Appl..

[18]  Radom Pongvuthithum,et al.  Applied p-median and p-center algorithms for facility location problems , 2014, Expert Syst. Appl..

[19]  Li-Sheng Hu,et al.  A model induced max-min ant colony optimization for asymmetric traveling salesman problem , 2013, Appl. Soft Comput..