IDEAS home Printed from https://ideas.repec.org/a/lrk/eeaart/20_2_4.html
   My bibliography  Save this article

Diseño de calendarios para transporte de componentes de automóviles. Soluciones heurísticas

Author

Listed:
  • JESÚS F. ALEGRE

    () (Departamento de Economía Aplicada. Facultad C. Económicas y Empresariales. Universidad de Burgos.)

  • SILVIA CASADO

    (Departamento de Economía Aplicada. Facultad C. Económicas y Empresariales. Universidad de Burgos.)

  • CRISTINA R. DELGADO.

    (Departamento de Economía Aplicada. Facultad C. Económicas y Empresariales. Universidad de Burgos.)

Abstract

En este trabajo se analiza un caso particular del Periodic Vehicle Routing Problem, (PVRP), planteado recientemente a los autores de este trabajo por los directivos de una empresa logística. Una empresa fabricante de componentes de automóviles recoge diferentes piezas, que utiliza como materias primas, en diferentes factorías distribuidas geográficamente. Las recogidas de estas piezas deben seguir determinadas periodicidades. Se trata de establecer en que fechas se recogen las diferentes piezas y confeccionar las rutas diarias correspondientes, de forma que el coste total de transporte sea mínimo. Se consideran horizontes temporales de un mes o múltiplos, a diferencia de las instancias que aparecen habitualmente en la literatura para el PVRP, que consideran horizontes de tiempo mucho más cortos. En este trabajo se proponen dos metaheurísticos: uno basado en un sencillo procedimiento de Búsqueda Tabú, y un Algoritmo Memético. Se utilizan dichos metaheurísticos para resolver los problemas reales propuestos, comparándose los resultados con los propuestos por la empresa logística. This paper examines a particular case of Periodic Vehicle Routing Problem (PVRP). This problem was proposed by a local autopart enterprise. This enterprise must to collect different raw materials to build the autoparts, from different points geographically distributed. Each of these different raw materials has a specific frequency to be picked- up. Large planning horizons (one month, two months…) are considered. The problem then, consist on simultaneously selecting the pick-up days for each raw material and establishing vehicles routes for each day of the planning horizon. The total cost of transport must be minimized. In this work two metaheuristics are proposed: one is based on a simple procedure of tabu search, and the other is a memetic algorithm for these particular cases of PVRP with large planning horizons. These metaheuristics are used to solve the real problems that have been proposed and to compare the results with the results proposed by the logistic enterprise.

Suggested Citation

  • Jesús F. Alegre & Silvia Casado & Cristina R. Delgado., 2002. "Diseño de calendarios para transporte de componentes de automóviles. Soluciones heurísticas," Estudios de Economía Aplicada, Estudios de Economía Aplicada, vol. 20, pages 301-316, Agosto.
  • Handle: RePEc:lrk:eeaart:20_2_4
    as

    Download full text from publisher

    File URL: http://www.revista-eea.net
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Keywords

    Periodic Delivery of Autoparts; Logistic; PVRP; Tabu Search; Memetic Algorithms.;

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • R40 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - Transportation Economics - - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:lrk:eeaart:20_2_4. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Beatriz Rodríguez Prado). General contact details of provider: http://edirc.repec.org/data/fcvldes.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.