Pasar al contenido principal

Resultados relacionados

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

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

A biased-randomized iterated local search for the vehicle routing problem with optional backhauls

  • Londoño, Julio C.
  • Tordecilla, Rafael D.
  • do C. Martins, Leandro
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The vehicle routing problem with backhauls integrates decisions on product delivery with decisions on the collection of returnable items. In this paper, we analyze a scenario in which collection of items is optional-but subject to a penalty cost. Both transportation costs and penalties associated with non-collecting decisions are considered. A mixed-integer linear model is proposed and solved for small instances. Also, a metaheuristic algorithm combining biased randomization techniques with iterated local search is introduced for larger instances. Our approach yields cost savings and is competitive when compared to other state-of-the-art approaches., This work has been partially supported by COLCIENCIAS - Colombia, the School of Industrial Engineering of Universidad del Valle, the IoF2020, the AGAUR (2018-LLAV-00017), and the Erasmus+ Program (2018-1-ES01-KA103-049767). We also acknowledge the support of the doctoral programs at the Universitat Oberta de Catalunya and the Universidad de La Sabana.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Agile optimization of a two-echelon vehicle routing problem with pickup and delivery

  • do C. Martins, Leandro
  • Hirsch, Patrick
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In this paper, we consider a vehicle routing problem in which a fleet of homogeneous vehicles, initially located at a depot, has to satisfy customers' demands in a two-echelon network: first, the vehicles have to visit intermediate nodes (e.g., a retail center or a consolidation center), where they deliver raw materials or bulk products and collect a number of processed items requested by the customers in their route; then, the vehicles proceed to complete their assigned routes, thus delivering the processed items to the final customers before returning to the depot. During this stage, vehicles might visit other intermediate nodes for reloading new items. In some real-life scenarios, this problem needs to be solved in just a few seconds or even milliseconds, which leads to the concept of "agile optimization." This might be the case in some rescue operations using drones in humanitarian logistics, where every second can be decisive to save lives. In order to deal with this real-time two-echelon vehicle routing problem with pickup and delivery, an original constructive heuristic is proposed. This heuristic is able to provide a feasible and reasonably good solution in just a few milliseconds. The constructive heuristic is extended into a biased-randomized algorithm using a skewed probability distribution to modify its greedy behavior. This way, parallel runs of the algorithm are able to generate even better results without violating the real-time constraint. Results show that the proposed methodology generates competitive results in milliseconds, being able to outperform other heuristics from the literature., This work has been partially supported by the IoF2020-H2020 and AGAUR 2018-LLAV-00017 projects, as well as by the Erasmus+ program (2018-1-ES01-KA103-049767).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem

  • Abdullahi, Hassana
  • Reyes-Rubiano, Lorena
  • Ouelhadj, Djamila
  • Faulin, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The transport sector leads to detrimental effects on the economy, environment, and citizens quality of life. During recent years, some key-performance indicators have been proposed to quantify these negative impacts on the economic, environmental, and social dimensions of the sustainability concept. In this paper, we consider the sustainable vehicle routing problem that takes into account the aforementioned dimensions. We propose a weighted sum model and an epsilon-constraint model that combine the three dimensions, as well as a biased-randomised iterated greedy algorithm to solve the integrated problem. A comprehensive set of experiments and sensitivity analysis have been carried out with newly generated instances, which were adapted from existing vehicle routing benchmark instances. The sensitivity analysis is performed to measure the impact of each sustainability dimension and investigate trade-offs among them., This work has been partially supported by the Erasmus+ programme (2018-1-ES01-KA103-049767), and by the Spanish Ministry of Science, Innovation, and Universities (PID2019-111100RB-C21/C22; RED2018-102642-T). We also want to thank the support of the University of Portsmouth and the Public University of Navarre doctoral programmes.
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).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times

  • Reyes-Rubiano, Lorena Silvana
  • Ferone, Daniele
  • Juan Pérez, Ángel Alejandro
  • Faulín Fajardo, Javier
Green transportation is becoming relevant in the context of smart cities, where the use of electric vehicles represents a promising strategy to support sustainability policies. However the use of electric vehicles shows some drawbacks as well, such as their limited driving-range capacity. This paper analyses a realistic vehicle routing problem in which both driving-range constraints and stochastic travel times are considered. Thus, the main goal is to minimize the expected time-based cost required to complete the freight distribution plan. In order to design reliable routing plans, a simheuristic algorithm is proposed. It combines Monte Carlo simulation with a multi-start metaheuristic, which also employs biased-randomization techniques. By including simulation, simheuristics extend the capabilities of metaheuristics to deal with stochastic problems. A series of computational experiments are performed to test our solving approach as well as to analyse the effect of uncertainty on the routing plans., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2015-71883-REDT), and the Ibero-American Program for Science and Technology for Development (CYTED2014-515RT0489). Moreover, The authors appreciate the financial support of the Erasmus+ Program (2018-1-ES01-KA103-049767) as well as the support of the UPNA doctoral program.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

An inventory-routing problem with stochastic demand and stock-out: a solution and risk analysis using simheuristics

  • Onggo, Bhakti Stephan
  • Juan Pérez, Ángel Alejandro
  • Panadero, Javier
  • Corlu, Canan Gunes
  • Agustín Martín, Alba
Supply chain operations have become more complex. Hence, in order to optimise supply chain operations, we often need to simplify the optimisation problem in such a way that it can be solved efficiently using either exact methods or metaheuristics. One common simplification is to assume all model inputs are deterministic. However, for some management decisions, considering the uncertainty in model inputs (e.g., demands, travel times, processing times) is essential. Otherwise, the results may be misleading and might lead to an incorrect decision. This paper considers an example of a complex supply chain operation that can be viewed as an Inventory-Routing Problem with stochastic demands. We demonstrate how a simheuristic framework can be employed to solve the problem. Further, we illustrate the risks of not considering input uncertainty. The results show that simheuristics can produce a good result, and ignoring the uncertainty in the model input may lead to sub-optimal results., This work has been partially funded by the IoF2020 project of the European Union (grant agreement no. 731884) and by the Erasmus+ Program (2018-1-ES01-KA103-049767).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

Exploration of a disrupted road network after a disaster with an online routing algorithm

  • Reyes-Rubiano, Lorena Silvana
  • Voegl, Jana
  • Rest, Klaus‑Dieter
  • Faulín Fajardo, Javier
  • Hirsch, Patrick
This paper considers the problem of supporting immediate response operations after a disaster with information about the available road network to reach certain locations. We propose an online algorithm that aims to minimize the route length required by an unmanned aerial vehicle (UAV) to explore the road accessibility of potential victim locations. It is assumed that no information about disruptions in the road network is available at the start of the exploration. The online algorithm applies two movement and three orientation strategies. Additionally, a cutting strategy is used to restrict the search space after new information about the state of single roads is obtained. We consider a road and an aerial network for the movements of the UAV, since it is not necessary to follow the route of a road any longer, if it can be marked as disrupted. In extensive numerical studies with artificial and real-world test instances, it is evaluated for different disruption levels, which combinations of movement and orientation strategies perform best. Additionally, we propose different refuelling strategies for the UAV and present how they differ in the number of refuelling operations and the required additional route length. The results show that an efficient online algorithm can save valuable exploration time., This work has been partially supported by the Österreichische Nationalbank (OeNB) (17703) and the Erasmus+ Program (2018-1-ES01-KA103-049767). We also acknowledge the support of the UPNA doctoral program and the PID2019-111100RB-C22/AEI/10.13039/501100011033 project.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

Selecting freight transportation modes in last-mile urban distribution in Pamplona (Spain): an option for drone delivery in smart cities

  • Serrano Hernández, Adrián
  • Ballano Biurrun, Aitor
  • Faulín Fajardo, Javier
Urban distribution in medium-sized cities faces a major challenge, mainly when deliveries are difficult in the city center due to: an increase of e-commerce, weak public transportation system, and the promotion of urban sustainability plans. As a result, private cars, public transportation, and freight transportation compete for the same space. This paper analyses the current state for freight logistics in the city center of Pamplona (Spain) and proposes alternative transportation routes and transportation modes in the last-mile city center distribution according to different criteria evaluated by residents. An analytic hierarchy process (AHP) was developed. A number of alternatives have been assessed considering routes and transportation modes: the shortest route criterion and avoiding some city center area policies are combined with traditional van-based, bike, and aerial (drone) distribution protocols for delivering parcels and bar/restaurant supplies. These alternatives have been evaluated within a multicriteria framework in which economic, environmental, and social objectives are considered at the same time. The point in this multicriteria framework is that the criteria/alternative AHP weights and priorities have been set according to a survey deployed in the city of Pamplona (Navarre, Spain). The survey and AHP results show the preference for the use of drone or bike distribution in city center in order to reduce social and environmental issues., This work has been partially supported by the Spanish Ministry of Science, Innovation, and Universities (PID2019-111100RB-C22/AEI/10.13039/501100011033; RED2018-102642-T), and the 'la Caixa' Foundation (LCF/PR/PR15/51100007) project. Moreover, we appreciate the financial support of the Erasmus+ Program (2018-1-ES01-KA103-049767).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

On the use of biased-randomized algorithms for solving non-smooth optimization problems

  • Juan Pérez, Ángel Alejandro
  • Corlu, Canan Gunes
  • Tordecilla, Rafael D.
  • Torre Martínez, Rocío de la
  • Ferrer, Albert
Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory management, it is possible to consider stock-outs generated by unexpected demands; and in manufacturing processes and project management, it is frequent that some deadlines cannot be met due to delays in critical steps of the supply chain. However, capacity-, size-, and time-related limitations are included in many optimization problems as hard constraints, while it would be usually more realistic to consider them as soft ones, i.e., they can be violated to some extent by incurring a penalty cost. Most of the times, this penalty cost will be nonlinear and even noncontinuous, which might transform the objective function into a non-smooth one. Despite its many practical applications, non-smooth optimization problems are quite challenging, especially when the underlying optimization problem is NP-hard in nature. In this paper, we propose the use of biased-randomized algorithms as an effective methodology to cope with NP-hard and non-smooth optimization problems in many practical applications. Biased-randomized algorithms extend constructive heuristics by introducing a nonuniform randomization pattern into them. Hence, they can be used to explore promising areas of the solution space without the limitations of gradient-based approaches, which assume the existence of smooth objective functions. Moreover, biased-randomized algorithms can be easily parallelized, thus employing short computing times while exploring a large number of promising regions. This paper discusses these concepts in detail, reviews existing work in different application areas, and highlights current trends and open research lines., This research was partially funded by the IoF2020 European project, AGAUR (2018-LLAV-00017), the Erasmus+ program (2018-1-ES01-KA103-049767), and the Spanish Ministry of Science, Innovation, and Universities (RED2018-102642-T).