Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

An Agile and Reactive Biased-Randomized Heuristic for an Agri-Food Rich Vehicle Routing Problem

  • Tordecilla, Rafael D.
  • Copado-Méndez, Pedro J.
  • Panadero, Javier
  • Martins, Leandro do C.
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Operational problems in agri-food supply chains usually show characteristics that are scarcely addressed by traditional academic approaches. These characteristics make an already NP-hard problem even more challenging; hence, this problem requires the use of tailor-made algorithms in order to solve it efficiently. This work addresses a rich vehicle routing problem in a real-world agri-food supply chain. Different types of animal food products are distributed to raising-pig farms. These products are incompatible, i.e., multi-compartment heterogeneous vehicles must be employed to perform the distribution activities. The problem considers constraints regarding visit priorities among farms, and not-allowed access of large vehicles to a subset of farms. Finally, a set of flat tariffs are employed to formulate the cost function. This problem is solved employing a reactive savings-based biased-randomized heuristic, which does not require any time-costly parameter fine-tuning process. Our results show savings in both cost and traveled distance when compared with the real supply chain performance., This work has been partially supported by the Doctoral School of the Universitat Oberta de Catalunya (Spain), the Universidad de La Sabana (Colombia, Grant INGPhD-12-2020), and the EU-IoF2020 project (282300206-UC005).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Simulation-optimization methods for designing and assessing resilient supply chain networks under uncertainty scenarios: A review

  • Tordecilla, Rafael D.
  • Montoya-Torres, Jairo R.
  • Quintero-Araujo, Carlos L.
  • Panadero, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The design of supply chain networks (SCNs) aims at determining the number, location, and capacity of production facilities, as well as the allocation of markets (customers) and suppliers to one or more of these facilities. This paper reviews the existing literature on the use of simulation optimization methods in the design of resilient SCNs. From this review, we classify some of the many works in the topic according to factors such as their methodology, the approach they use to deal with uncertainty and risk, etc. The paper also identifies several research opportunities, such as the inclusion of multiple criteria (e.g., monetary, environmental, and social dimensions) during the design-optimization process and the convenience of considering hybrid approaches combining metaheuristic algorithms, simulation, and machine learning methods to account for uncertainty and dynamic conditions, respectively., This work has been partially supported by the IoF2020 and the Erasmus+ Programs (2018-1-ES01-KA103-049767). We also acknowledge the support of the doctoral programs at the Universitat Oberta de Catalunya and Universidad de La Sabana (grant INGPhD-12-2020).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Combining heuristics with simulation and fuzzy logic to solve a flexible-size location routing problem under uncertainty

  • Tordecilla, Rafael D.
  • Copado-Méndez, Pedro J.
  • Panadero, Javier
  • Quintero-Araujo, Carlos L.
  • Montoya-Torres, Jairo R.
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The location routing problem integrates both a facility location and a vehicle routing problem. Each of these problems are NP-hard in nature, which justifies the use of heuristic-based algorithms when dealing with large-scale instances that need to be solved in reasonable computing times. This paper discusses a realistic variant of the problem that considers facilities of different sizes and two types of uncertainty conditions. In particular, we assume that some customers' demands are stochastic, while others follow a fuzzy pattern. An iterated local search metaheuristic is integrated with simulation and fuzzy logic to solve the aforementioned problem, and a series of computational experiments are run to illustrate the potential of the proposed algorithm., This work has been partially supported by the Spanish Ministry of Science (PID2019111100RB-C21/AEI/10.13039/501100011033). In addition, it has received the support of the Doctoral School at the Universitat Oberta de Catalunya (Spain) and the Universidad de La Sabana (INGPhD-12-2020).
Repositorio Institucional de la Universidad de Burgos (RIUBU)
Publicación Contribución de congreso (ConferenceOutput)

An agile and reactive biased-randomized heuristic for an agri-food rich vehicle routing problem

  • Tordecilla, Rafael D.
  • Copado-Méndez, Pedro J.
  • Panadero, Javier
  • Martins, Leandro do C.
  • Juan, Angel A.
Trabajo presentado en: R-Evolucionando el transporte, XIV Congreso de Ingeniería del Transporte (CIT 2021), realizado en modalidad online los días 6, 7 y 8 de julio de 2021, organizado por la Universidad de Burgos, Operational problems in agri-food supply chains usually show characteristics that are scarcely addressed by traditional academic approaches. These characteristics make an already NP-hard problem even more challenging; hence, this problem requires the use of tailor-made algorithms in order to solve it efficiently. This work addresses a rich vehicle routing problem in a real-world agri-food supply chain. Different types of animal food products are distributed to raising-pig farms. These products are incompatible, i.e., multicompartment heterogeneous vehicles must be employed to perform the distribution activities. The problem considers constraints regarding visit priorities among farms, and not-allowed access of large vehicles to a subset of farms. Finally, a set of flat tariffs are employed to formulate the cost function. This problem is solved employing a reactive savings-based biased-randomized heuristic, which does not require any time-costly parameter fine-tuning process. Our results show savings in both cost and traveled distance when compared with the real supply chain performance., This work has been partially supported by the Doctoral School of the Universitat Oberta de Catalunya (Spain), the Universidad de La Sabana (Colombia, Grant INGPhD-12-2020), and the EU-IoF2020 project (282300206-UC005).