Tabu search with path relinking for an integrated production-distribution problem

  • Authors:

  • V. A. Armentano;A. L. Shiguemoto;A. Løkketangen

  • Affiliations:

  • Faculdade de Engenharia Elétrica e de Computação, Universidade Estadual de Campinas, Dpt. de Engenharia de Sistemas, Campinas, São Paulo 13081-852, Brazil;Departamento de Estatística e Matemática Aplicada, Universidade Federal do Ceará, Campus do Pici, Bloco 910, Fortaleza, Ceará 60455-760, Brazil;Molde University College, Specialized University in Logistics, Britveien 2, 6411, Molde, Norway

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2011

Quantified Score

Hi-index 0.07

Visualization

Abstract

This paper deals with the problem of integrating production and distribution planning over periods of a finite horizon. We consider a capacity-constrained plant that produces a number of items distributed by a fleet of homogenous vehicles to customers with known demand for each item in each period. The production planning defines the amount of each item produced in every period, while the distribution planning defines when customers should be visited, the amount of each item that should be delivered to customers, and the vehicle routes. The objective is to minimize production and inventory costs at the plant, inventory costs at the customers and distribution costs. We propose two tabu search variants for this problem, one that involves construction and a short-term memory, and one that incorporates a longer term memory used to integrate a path relinking procedure to the first variant. The proposed tabu search variants are tested on generated instances with up to ten items and on instances from the literature involving a single item.