Pasar al contenido principal

Resultados relacionados

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

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

Promoting Sustainable and Intelligent Freight Transportation Systems in the Barcelona Metropolitan Area

  • Calvet, Laura
  • Alvarez-Palau, Eduard J.
  • Viu, Marta
  • Castillo, Cristian
  • Copado, Pedro
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The growth of e-commerce and the on-demand economy in urban and metropolitan areas has been accelerated by the recent COVID-19 pandemic. As a consequence, logistics and transportation operators are subject to a noticeable pressure to develop efficient delivery systems. These systems are also influenced by the global trend towards more sustainable transportation and mobility, which implies changes in urban policies and technological innovations ¿e.g., the substitution of traditional diesel petrol-drive vehicles by electric ones. This paper analyzes the current and predicted needs of logistics operators in the Barcelona metropolitan area. To do so, urban regulations are analyzed and key shareholders are interviewed. The analysis of these interviews promote a discussion on how the use of new `agile¿ optimization algorithms ¿which are based on the combination of biased-randomized heuristics, computer parallelization techniques, and IoT / 5G technologies¿ can contribute to enhance urban distribution practices. Finally, we present a case study in which the effect of different configurations of working/resting times and parking areas availability on routing solutions is studied. Our research aims to provide comprehensive knowledge to managers and policy-makers, and to offer them with powerful tools capable of generating real-time solutions to complex last-mile delivery challenges under dynamic conditions., This work has been partially supported by the Spanish Ministry of Science (PID2019-111100RB-C21 / AEI / 10.13039/501100011033, RED2018-102642-T), and the Erasmus+ Program (2019-I-ES01-KA103-062602). We also thank the entities that accepted to be interviewed during the development of this study.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Supervised Machine Learning Algorithms for Measuring and Promoting Sustainable Transportation and Green Logistics

  • Castaneda, Juliana
  • Cardona, John.F.
  • Martins, Leandro do C.
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The sustainable development of freight transport has received much attention in recent years. The new regulations for sustainable transport activities established by the European Commission and the United Nations have created the need for road freight transport companies to develop methodologies to measure the social and environmental impact of their activities. This work aims to develop a model based on supervised machine learning methods with intelligent classification algorithms and key performance indicators for each dimension of sustainability as input data. This model allows establishing the level of sustainability (high, medium, or low). Several classification algorithms were trained, finding that the support vector machines algorithm is the most accurate, with 98% accuracy for the data set used. The model is tested by establishing the level of sustainability of a European company in the road freight sector, thus allowing the establishment of green strategies for its sustainable development., This work has been partially supported by the Spanish Ministry of Science (PID2019-111100RB-C21 / AEI /10.13039/501100011033, RED2018-102642-T), and the Erasmus+ Program (2019-I-ES01-KA103-062602).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Solving Vehicle Routing Problems under Uncertainty and in Dynamic Scenarios: From Simheuristics to Agile Optimization

  • Ammouriova, Majsa
  • Herrera, Erika M.
  • Neroni, Mattia
  • Faulin, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Many real-life applications of the vehicle routing problem (VRP) occur in scenarios subject to uncertainty or dynamic conditions. Thus, for instance, traveling times or customers' demands might be better modeled as random variables than as deterministic values. Likewise, traffic conditions could evolve over time, synchronization issues should need to be considered, or a real-time re-optimization of the routing plan can be required as new data become available in a highly dynamic environment. Clearly, different solving approaches are needed to efficiently cope with such a diversity of scenarios. After providing an overview of current trends in VRPs, this paper reviews a set of heuristic-based algorithms that have been designed and employed to solve VRPs with the aforementioned properties. These include simheuristics for stochastic VRPs, learnheuristics and discrete-event heuristics for dynamic VRPs, and agile optimization heuristics for VRPs with real-time requirements., This work was partially funded by the Spanish Ministry of Science, Innovation, and Universities (PID2019-111100RB-C21-C22/AEI/10.13039/501100011033), the SEPIE Erasmus+ Program (2019-I-ES01-KA103-062602), the Barcelona City Council and Fundacio "la Caixa" under the framework of the Barcelona Science Plan 2020-2023 (21S09355-001), and the Generalitat Valenciana (PROMETEO/2021/065).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Fuzzy Simheuristics for Optimizing Transportation Systems: Dealing with Stochastic and Fuzzy Uncertainty

  • Tordecilla, Rafael D.
  • Martins, Leandro do C.
  • Panadero, Javier
  • Copado, Pedro J.
  • Pérez Bernabeu, Elena|||0000-0002-9221-7623
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In the context of logistics and transportation, this paper discusses how simheuristics can be extended by adding a fuzzy layer that allows us to deal with complex optimization problems with both stochastic and fuzzy uncertainty. This hybrid approach combines simulation, metaheuristics, and fuzzy logic to generate near-optimal solutions to large scale NP-hard problems that typically arise in many transportation activities, including the vehicle routing problem, the arc routing problem, or the team orienteering problem. The methodology allows us to model different components-such as travel times, service times, or customers' demands-as deterministic, stochastic, or fuzzy. A series of computational experiments contribute to validate our hybrid approach, which can also be extended to other optimization problems in areas such as manufacturing and production, smart cities, telecommunication networks, etc., This work has been partially supported by the Spanish Ministry of Science (PID2019-111100RB-C21/AEI/10.13039/501100011033, RED2018-102642-T), and the Erasmus+ program (2019-I-ES01-KA103-062602). This research received no external funding.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A clustering-based review on project portfolio optimization methods

  • Saiz, Miguel
  • Lostumbo, Marisa A.
  • Lopez-Lopez, David
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Project portfolio management and optimization constitutes a critical activity for organizations in different industrial sectors and business. The scientific literature in this subject is extremely vast, which makes it difficult to understand the connections among the existing approaches and perspectives. This paper provides a clustering map of the existing work on the subject, thus identifying the main trends and approaches from different scientific communities. After analyzing each of the identified clusters, the paper provides insights and emerging trends that can be useful both for researchers and practitioners in the area., This project has been partially supported by the Spanish Ministry of Science and Innovation (PID2019-111100RB-C21/AEI/ 10.13039/501100011033, RED2018-102642-T), the Erasmus+ Program (2019-I-ES01-KA103-062602), FEDER, and the AGAUR (2018 LLAV 00017).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Agile optimization for a real-time facility location problem in Internet of Vehicles networks

  • Martins, Leandro do C.
  • Tarchi, Daniele
  • Fusco, Alessandro
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The uncapacitated facility location problem (UFLP) is a popular NP-hard optimization problem that has been traditionally applied to logistics and supply networks, where decisions are difficult to reverse. However, over the years, many new application domains have emerged, in which real-time optimization is needed, such as Internet of Vehicles (IoV), virtual network functions placement, and network controller placement. IoV scenarios take into account the presence of multiple roadside units (RSUs) that should be frequently assigned to operating vehicles. To ensure the desired quality of service level, the allocation process needs to be carried out frequently and efficiently, as vehicles' demands change. In this dynamic environment, the mapping of vehicles to RSUs needs to be reoptimized periodically over time. Thus, this article proposes an agile optimization algorithm, which is tested using existing benchmark instances. The experiments show that it can efficiently generate high-quality and real-time results in dynamic IoV scenarios., This research was partially supported by the Spanish Ministry of Science (PID2019-111100RB-C21/AEI/10.13039/501100011033, RED2018-102642-T) and the Erasmus+ program (2019-I-ES01-KA103-062602). A major part of this work was done during Alessandro Fusco's visit to the Universitat Oberta de Catalunya, Spain, supported by the Erasmus+ Study program of the European Union. The authors also thank Jon Raleigh for the final review of the paper.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

An agile optimisation algorithm for the multi-source team orienteering problem

  • Neroni, M.
  • Panadero, J.
  • Ghorbani, E.
  • Ammouriova, M.
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In the team orienteering problem (TOP), a fixed fleet of vehicles have to collect rewards by visiting customers. Typically, all vehicles depart from a source depot and end in a sink depot. Also, each vehicle has a limited driving range, so not all customers can be visited. The goal is then to select the set of customers to be visited, and the corresponding routes to do it, such in a way that the total reward collected is maximised while respecting the aforementioned constraints. This paper explores a TOP variant with multiple source depots and where real-time solutions need to be provided, i.e., computation times need to be in the order of milliseconds even for mid-sized instances with hundreds of customers. To deal with this challenge, and taking into account that the problem is NP-hard, we propose an 'agile' optimisation algorithm that is based on a biased-randomised heuristic. Our approach can be applied in realistic and dynamic scenarios where vehicles need to recompute their routes in real-time, as vehicles are in-route, new customers appear, and some existing customers are not available anymore., This work has been funded by PID2022-138860NB-I00, RED2022-134703-T, 2019-1-ES01-KA103-062602 and PROMETEO/2021/065.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances

  • Kizys, Renatas
  • Doering, Jana
  • Polat, Onur
  • Calvet, Laura
  • Panadero, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The goal of the portfolio optimization problem is to minimize risk for an expected portfolio return by allocating weights to included assets. As the pool of investable assets grows, and additional constraints are imposed, the problem becomes NP-hard. Thus, metaheuristics are commonly employed for solving large instances of rich versions. However, metaheuristics do not fully account for random returns and noisy covariances, which renders them unrealistic in the presence of heightened uncertainty in financial markets. This paper aims to close this gap by proposing a simulation-optimization approach - specifically, a simheuristic algorithm that integrates a variable neighborhood search metaheuristic with Monte Carlo simulation - to deal with stochastic returns and noisy covariances modeled as random variables. Computational experiments performed on a well-established benchmark instance illustrate the advantages of our methodology and analyze how the solutions change in response to a varying degree of randomness, minimum required return, and probability of obtaining a return exceeding an investor-defined threshold., This work has been partially funded by the Erasmus+ SEPIE program, Spain (2019-I-ES01-KA103-062602).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Edge computing and iot analytics for agile optimization in intelligent transportation systems

  • Peyman, Mohammad
  • Copado, Pedro J.
  • Tordecilla, Rafael D.
  • do C. Martins, Leandro
  • Xhafa, Fatos
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] With the emergence of fog and edge computing, new possibilities arise regarding the data-driven management of citizens' mobility in smart cities. Internet of Things (IoT) analytics refers to the use of these technologies, data, and analytical models to describe the current status of the city traffic, to predict its evolution over the coming hours, and to make decisions that increase the efficiency of the transportation system. It involves many challenges such as how to deal and manage real and huge amounts of data, and improving security, privacy, scalability, reliability, and quality of services in the cloud and vehicular network. In this paper, we review the state of the art of IoT in intelligent transportation systems (ITS), identify challenges posed by cloud, fog, and edge computing in ITS, and develop a methodology based on agile optimization algorithms for solving a dynamic ride-sharing problem (DRSP) in the context of edge/fog computing. These algorithms allow us to process, in real time, the data gathered from IoT systems in order to optimize automatic decisions in the city transportation system, including: optimizing the vehicle routing, recommending customized transportation modes to the citizens, generating efficient ride-sharing and car-sharing strategies, create optimal charging station for electric vehicles and different services within urban and interurban areas. A numerical example considering a DRSP is provided, in which the potential of employing edge/fog computing, open data, and agile algorithms is illustrated., This work was partially supported by the Spanish Ministry of Science (PID2019111100RB-C21/AEI/10.13039/501100011033, RED2018-102642-T), and the Erasmus+ program (2019I-ES01-KA103-062602).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Combining Parallel Computing and Biased Randomization for Solving the Team Orienteering Problem in Real-Time

  • Panadero, Javier
  • Ammouriova, Majsa
  • Agustin, Alba
  • Nogal, Maria
  • Serrat, Carles
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In smart cities, unmanned aerial vehicles and self-driving vehicles are gaining increased concern. These vehicles might utilize ultra-reliable telecommunication systems, Internet-based technologies, and navigation satellite services to locate their customers and other team vehicles to plan their routes. Furthermore, the team of vehicles should serve their customers by specified due date efficiently. Coordination between the vehicles might be needed to be accomplished in real-time in exceptional cases, such as after a traffic accident or extreme weather conditions. This paper presents the planning of vehicle routes as a team orienteering problem. In addition, an 'agile' optimization algorithm is presented to plan these routes for drones and other autonomous vehicles. This algorithm combines an extremely fast biased-randomized heuristic and a parallel computing approach., This work has been partially supported by the Spanish Ministry of Science and Innovation (PID2019-111100RB-C21/AEI/10.13039/501100011033, RED2018-102642-T). We also acknowledge the support of the Erasmus+ Program (2019-I-ES01-KA103-062602)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Simulation, optimization, and machine learning in sustainable transportation systems: Models and applications

  • Torre-Martínez, María Rocío de la|||0000-0002-8662-8901
  • Juan, Angel A.|||0000-0003-1392-1776
  • Corlu, Canan G.
  • Faulin, Javier
  • Onggo, Bahkti S.
[EN] The need for effective freight and human transportation systems has consistently increased during the last decades, mainly due to factors such as globalization, e-commerce activities, and mobility requirements. Traditionally, transportation systems have been designed with the main goal of reducing their monetary cost while offering a specified quality of service. During the last decade, however, sustainability concepts are also being considered as a critical component of transportation systems, i.e., the environmental and social impact of transportation activities have to be taken into account when managers and policy makers design and operate modern transportation systems, whether these refer to long-distance carriers or to metropolitan areas. This paper reviews the existing work on different scientific methodologies that are being used to promote Sustainable Transportation Systems (STS), including simulation, optimization, machine learning, and fuzzy sets. This paper discusses how each of these methodologies have been employed to design and efficiently operate STS. In addition, the paper also provides a classification of common challenges, best practices, future trends, and open research lines that might be useful for both researchers and practitioners., This work has been partially supported by the Spanish Ministry of Science, Innovation, and Universities (PID2019-111100RB-C21-C22/AEI/10.13039/501100011033, RED2018-102642-T) and the SEPIE Erasmus+ Program (2019-I-ES01-KA103-062602), and the IoF2020-H2020 (731884) project.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A reliability-extended simheuristic for the sustainable vehicle routing problem with stochastic travel times and demands

  • Abdullahi, Hassana
  • Reyes-Rubiano, Lorena
  • Ouelhadj, Djamila
  • Faulin, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Real-life transport operations are often subject to uncertainties in travel time or customers' demands. Additionally, these uncertainties greatly impact the economic, environmental, and social costs of vehicle routing plans. Thus, analysing the sustainability costs of transportation activities and reliability in the presence of uncertainties is essential for decision makers. Accordingly, this paper addresses the Sustainable Vehicle Routing Problem with Stochastic Travel times and Demands. This paper proposes a novel weighted stochastic recourse model that models travel time and demand uncertainties. To solve this challenging problem, we propose an extended simheuristic that integrates reliability analysis to evaluate the reliability of the generated solutions in the presence of uncertainties. An extensive set of computational experiments is carried out to illustrate the potential of the proposed approach and analyse the influence of stochastic components on the different sustainability dimensions., This work has been developed by the University of Portsmouth, Cardiff Metropolitan University and partially supported by the SEPIE Erasmus+ Program (2019-I-ES01-KA103-062602) in collaboration with the Public University of Navarre, the Petroleum Technology Development Fund (PTDF/E/OSS/PHD/HAH/699/14), and the Spanish Ministry of Science and Innovation (PID2019-111100RB-C21-C22 /AEI/ 10.13039/ 501100011033, RED2018-102642-T, the Barcelona City Council and "La Caixa" (21S09355-001)).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Combining simheuristics with Petri nets for solving the stochastic vehicle routing problem with correlated demands

  • Latorre-Biel, Juan I.
  • Ferone, Daniele
  • Faulin, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] This paper analyzes a stochastic version of the vehicle routing problem in which customers' demands are not only stochastic but also correlated. In order to solve this stochastic and correlated optimization problem, a simheuristic approach is combined with an adaptive demand predictor. This predictor is based on the use of machine learning methods and Petri nets. The information on real demands, provided by the vehicles as they visit the nodes of the logistic network, allows for a real-time forecast of the demand, as well as for an updated estimate of the correlation between them. A constrained prediction is provided by our hybrid algorithm, which is able to forecast an increase of 50% in the mean value of the demands of all nodes. With a very limited amount of information and reduced computational requirements, our algorithm provides a forecast with a high degree of reliability and a balanced capacity to reject false positives as well as false negatives. To illustrate its effectiveness, the methodology is applied to a wide range of benchmarks. The results show the benefits of applying this methodology in a context of correlated variation of the demands., This work has been partially supported by the Spanish Ministry of Science, Innovation, and Universities (PID2019-111100RB-C21/C22, RED2018-102642-T) and the SEPIE Erasmus + Program, Spain (2019I-ES01-KA103-062602). We also want to acknowledge the support received from the CAN Foundation in Navarre, Spain (Grant ID 903 100010434 under the agreement LCF/PR/PR15/51100007).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

The role of simulation and serious games in teaching concepts on circular economy and sustainable energy

  • Torre-Martínez, María Rocío de la|||0000-0002-8662-8901
  • Juan, Angel A.|||0000-0003-1392-1776
  • Onggo, Bahkti S.
  • Corlu, Canan G.
  • Nogal, Maria
[EN] The prevailing need for a more sustainable management of natural resources depends not only on the decisions made by governments and the will of the population, but also on the knowledge of the role of energy in our society and the relevance of preserving natural resources. In this sense, critical work is being done to instill key concepts-such as the circular economy and sustainable energy-in higher education institutions. In this way, it is expected that future professionals and managers will be aware of the importance of energy optimization, and will learn a series of computational methods that can support the decision-making process. In the context of higher education, this paper reviews the main trends and challenges related to the concepts of circular economy and sustainable energy. Besides, we analyze the role of simulation and serious games as a learning tool for the aforementioned concepts. Finally, the paper provides insights and discusses open research opportunities regarding the use of these computational tools to incorporate circular economy concepts in higher education degrees. Our findings show that, while efforts are being made to include these concepts in current programs, there is still much work to be done, especially from the point of view of university management. In addition, the analysis of the teaching methodologies analyzed shows that, although their implementation has been successful in favoring the active learning of students, their use (especially that of serious games) is not yet widespread., This work has been partially supported by the Spanish Ministry of Science (PID2019-111100RB-C21-C22/AEI/10.13039/501100011033, RED2018-102642-T) and the SEPIE Erasmus+ Program (2019-I-ES01-KA103-062602).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Combining production and distribution in supply chains: The hybrid flow-shop vehicle routing problem

  • do C. Martins, Leandro
  • Gonzalez-Neira, Eliana M.
  • Hatami, Sara
  • Montoya-Torres, Jairo R.
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Many supply chains are composed of producers, suppliers, carriers, and customers. These agents must be coordinated to reduce waste and lead times. Production and distribution are two essential phases in most supply chains. Hence, improving the coordination of these phases is critical. This paper studies a combined hybrid flowshop and vehicle routing problem. The production phase is modeled as a hybrid flow-shop configuration. In the second phase, the produced jobs have to be delivered to a set of customers. The delivery is carried out in batches of products, using vehicles with a limited capacity. With the objective of minimizing the service time of the last customer, we propose a biased-randomized variable neighborhood descent algorithm. Different test factors, such as the use of alternative initial solutions, solution representations, and loading strategies, are considered and analyzed., This work has been partially supported by the Spanish Ministry of Science (PID2019111100RBC21, RED2018-102642-T) and the Erasmus+ program (2019IES01KA103062602).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A simheuristic algorithm for the capacitated location routing problem with stochastic demands

  • Quintero-Araujo, Carlos L.
  • Guimarans, Daniel
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The capacitated location routing problem (CLRP) integrates a facility location problem with a multi-depot vehicle routing problem. We consider the CLRP with stochastic demands, whose specific values are only revealed upon reaching each customer. The main goal is to minimise the expected costs of: (i) opening facilities, (ii) using a fleet of vehicles, (iii) executing a routing plan, and (iv) applying corrective actions. The latter are required whenever a route failure occurs due to unexpected high demands. We propose a simheuristic algorithm hybridizing simulation with an iterated local search metaheuristic, aimed at: (i) proposing a safety-stock policy to diminish the likelihood of route failure; and, (ii) estimating the expected cost and the reliability of each "elite" solution. We assess our approach on classical CLRP benchmarks, which are later extended to consider demand uncertainty. Finally, we also discuss the effects of the safety-stock policy on costs and reliability., This work has been partially supported by Rhenus Freight Logistics GmbH & Co. KG. We also acknowledge the support of the Erasmus+ Program (2019-I-ES01-KA103-062602).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks

  • Arnau, Quim
  • Barrena, Eva
  • Panadero, Javier
  • Torre-Martínez, María Rocío de la|||0000-0002-8662-8901
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Modern transport systems are not only large-scale but also highly dynamic, which makes it difficult to optimize by just employing classical methods. This paper analyzes a realistic and novel problem within the Physical Internet initiative which consists of container transportation throughout a spoke-hub network. Containers need to be transported from their origin locations to their final destinations on or before a given deadline, and they can be temporarily stored in network hubs. Each truck can move one container at a time from one hub to another, containers can be transported by different trucks during their path from their origin to their destination, and drivers need to be back at their starting points in due time. A deterministic heuristic, based on discrete-event simulation, is proposed as a first step to address the intrinsic dynamism of this time-evolving system. Then, in a second step, a biased-randomized version of this heuristic is incorporated into a multi-start framework (BR-MS) to generate better solutions. Next, our methodology is extended to a iterated local search (ILS) framework. Finally, a two-stage algorithm, combining both the BR-MS and the ILS frameworks is proposed. Several computational experiments have been carried out on a set of new benchmark instances, adapted from real road networks, to illustrate the problem and compare the performance of the different solving approaches., This work has been partially supported by the Spanish Ministry of Science (PID2019-111100RB-C21/AEI/10.13039/501100011033, RED2018-102642-T) , and the Erasmus+ program (2019-I-ES01-KA103-062602) .
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

Optimizing freight delivery routes: the time-distance dilemma

  • Alvarez Indave, Pablo
  • Serrano Hernández, Adrián
  • Lerga Valencia, Iosu
  • Faulín Fajardo, Javier
Traditional approaches to optimizing freight delivery routes are based on minimizing a distance-based cost function. New approaches also use time as an objective function to minimize. However, the trade-off between time and distance is sometimes unclear. This paper presents a new approach to route optimization in which both time and distance are considered conjointly. For this purpose, the vehicle operating cost and the value of time have been used to translate time and distance into monetary units. By studying three different networks in Spain with varying levels of detail (the region of Catalonia, the city of Barcelona, and the Pamplona city center), the results show that minimizing both time and distance yield better results than the traditional approach, especially at a local level, where congestion effects are more relevant. These findings are helpful for logistics companies to optimize their operations, as well as for public authorities who could employ these models to make decisions and create policies on logistics., This work has been partially supported by the Spanish Ministry of Science, Innovation, and Universities (PID2022-140278NBI00; RED2022-134703-T) and the SEPIE Erasmus+ Program (2019-I-ES01-KA103-062602). Additionally we acknowledge the support from the Public University of Navarra for Young Researchers Projects Program, Spain (PJUPNA26-2022) and the UNED-Pamplona for their research projects call (UNEDPAM/PI/PR24/04P).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

Valuations of transport nuisances and cognitive biases: a survey laboratory experiment in the Pyrenees region

  • Denant-Boemont, Laurent
  • Faulín Fajardo, Javier
  • Hammiche, Sabrina
  • Serrano Hernández, Adrián
We designed a survey that aims at estimating individual willingness-to-pay to reduce noise and air pollution arising from transportation activity near the Pyrenees in Navarre (Spain). Our participants cope with a series of contingent valuation questions and also with an economic experiment with real incentives about the same topic. Our goal is to identify several methodological problems in the valuation process coming from hypothetical bias, correlation effect and sequence effect when series of responses are requested. Our main results are that hypothetical bias is significant, because the willingness-to-pay is greater when the survey is hypothetical compared to when there is real monetary incentive. Likewise, the correlation effect also observes the same behavior since the willingness-to-pay for pollution mitigation is close to the one established for noise reduction. Finally, we have obtained mixed evidence for the sequence effect, being present only in the contingent valuation survey part., This work has been partially supported by the financial support of the Erasmus + Program (2019-I-ES01-KA103-062602), the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P) and the Spanish Ministry of Science, Innovation, and Universities (RED2018-102642-T). Support received from the CAN Foundation in Navarre, Spain (Grant ID 903616 100010434 under the agreement LCF/PR/PR15/51100007).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

A reliability-extended simheuristics for the sustainable vehicle routing problem with stochastic travel times and demands

  • Abdullahi, Hassana
  • Reyes-Rubiano, Lorena Silvana
  • Ouelhadj, Djamila
  • Faulín Fajardo, Javier
  • Juan, Ángel A.
Real-life transport operations are often subject to uncertainties in travel time or customers'demands. Additionally, these uncertainties greatly impact the economic, environmental, and social costs of vehicle routing plans. Thus, analysing the sustainability costs of transportation activities and reliability in the presence of uncertainties is essential for decision makers. Accordingly, this paper addresses the Sustainable Vehicle Routing Problem with Stochastic Travel times and Demands. This paper proposes a novel weighted stochastic recourse model that models travel time and demand uncertainties. To solve this challenging problem, we propose an extended simheuristic that integrates reliability analysis to evaluate the reliability of the generated solutions in the presence of uncertainties. An extensive set of computational experiments is carried out to illustrate the potential of the proposed approach and analyse the influence of stochastic components on the different sustainability dimensions., This work has been developed by the University of Portsmouth, Cardiff Metropolitan University and partially supported by the SEPIE Erasmus+ Program (2019-1-ES01-KA103-062602) in collaboration with the Public University of Navarre, the Petroleum Technology Development Fund (PTDF/E/OSS/PHD/HAH/699/14), and the Spanish Ministry of Science and Innovation (PID2019-111100RB-C21-C22 /AEI/ 10.13039/ 501100011033, RED2018-102642-T, the Barcelona City Council and 'La Caixa' (21S09355-001)).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Is time more important than distance to optimize freight delivery routes? An approach using the value of time

  • Alvarez Indave, Pablo
  • Serrano Hernández, Adrián
  • Lerga Valencia, Iosu
  • Faulín Fajardo, Javier
Traditional approaches to optimize freight delivery routes are based on minimizing a distance-based cost function. New approaches use also time as the objective function to minimize. However, the trade-off between time and distance is sometimes unclear. This paper presents a new approach to optimize delivery routes in which both time and distance are used together to optimize delivery routes. For this purpose, the operating cost of a vehicle and the value of time have been used to convert time and distance into monetary units. Through the study of three different networks in Spain with different level of detail (the region of Catalonia, the city of Barcelona, and the old part of Pamplona), the results have indicated that minimizing both time and distance provides better results than the traditional approach, especially at a local level where congestion effects are more relevant., This work was partially funded by the Spanish Ministry of Science, Innovation, and Universities (RED2022-134703- T; PID2019-111100RB-C22/AEI/10.13039/501100011033) and the SEPIE Erasmus+ Program (2019-I-ES01- KA103-062602). We also appreciate the help of the Public University of Navarra for Young Researchers Projects Program (PJUPNA26-2022).