Advanced Search
MyIDEAS: Login to save this article or follow this journal

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

Contents:

Author Info

  • 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.)

Registered author(s):

    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.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    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 look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Estudios de Economía Aplicada in its journal Estudios de Economía Aplicada.

    Volume (Year): 20 (2002)
    Issue (Month): (Agosto)
    Pages: 301-316

    as in new window
    Handle: RePEc:lrk:eeaart:20_2_4

    Contact details of provider:
    Postal: Beatriz Rodríguez Prado. Facultad de CC.EE. y EE. Avda. Valle del Esgueva. Valladolid 47011 SPAIN
    Phone: (34) 983 423320
    Fax: (34) 983 184568
    Web page: http://www.revista-eea.net
    More information through EDIRC

    Order Information:
    Email:
    Web: http://www.revista-eea.net

    Related research

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

    Find related papers by JEL classification:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    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).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 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.