Pasar al contenido principal

TRANSPORTE, LOGISTICA, Y PRODUCCION INTELIGENTE

TRA2015-71883-REDT

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Redes Investigación /Redes Excelencia
Año convocatoria 2015
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Unidad de gestión Secretaría de Estado de Investigación, Desarrollo e Innovación
Centro beneficiario FUNDACIO PER A LA UNIVERSITAT OBERTA DE CATALUNYA
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

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

Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Multi criteria biased randomized method for resource allocation in distributed systems: Application in a volunteer computing system

  • Panadero, Javier
  • De Armas, Jésica
  • Serra, Xavier
  • Marquès, Joan Manuel
Volunteer computing is a type of distributed computing in which a part or all the resources (processing power and storage) necessary to run the system are donated by users. In other words, participants contribute their idle computing resources to help running the system. Due to the fact that the nodes which compose the system are provided by a large number of users instead of a single (or a few) institution, a main drawback of volunteer computing is the unreliability of these nodes. For this reason, the selection of nodes to be involved in each task becomes a key issue. In this paper, we propose the Multi Criteria Biased Randomized (MCBR) method, a novel selection method for large-scale systems that use unreliable nodes. MCBR method is based on a multicriteria optimization strategy. We evaluated the method in a microblogging social network formed by a large number of microservices hosted in nodes voluntarily contributed by their participants. Simulation results show that our proposal is able to select nodes in a fast and efficient manner while requiring low computational power., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P, TRA2015-71883-REDT), FEDER and the Erasmus+ programme (20161ES01KA108023465).
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Biased randomization of heuristics using skewed probability distributions: a survey and some applications

  • Grasas, Àlex
  • Juan, Angel A.
  • Faulin, Javier
  • De Armas, Jésica
  • Ramalhinho-Lourenço, Helena
Randomized heuristics are widely used to solve large scale combinatorial optimization problems. Among the plethora of randomized heuristics, this paper reviews those that contain biased-randomized procedures (BRPs). A BRP is a procedure to select the next constructive ‘movement’ from a list of candidates in which their elements have different probabilities based on some criteria (e.g., ranking, priority rule, heuristic value, etc.). The main idea behind biased randomization is the introduction of a slight modification in the greedy constructive behavior that provides a certain degree of randomness while maintaining the logic behind the heuristic. BRPs can be categorized into two main groups according to how choice probabilities are computed: (i) BRPs using an empirical bias function; and (ii) BRPs using a skewed theoretical probability distribution. This paper analyzes the second group and illustrates, throughout a series of numerical experiments, how these BRPs can benefit from parallel computing in order to significantly outperform heuristics and even simple metaheuristic approaches, thus providing reasonably good solutions in ‘real time’ to different problems in the areas of transportation, logistics, and scheduling., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness and FEDER (TRA2013-48180-C3-P, TRA2015-71883-REDT), the Ibero-American Program for Science and Technology for Development (CYTED2014-515RT0489), and the Erasmus+ Program (2016-1-ES01-KA108-023465).
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Designing e‐commerce supply chains: a stochastic facility–location approach

  • Pagès Bernaus, Adela
  • Ramalhinho-Lourenço, Helena
  • Juan, Angel A.
  • Calvet Mir, Laura
E‐Commerce activity has been increasing during recent years, and this trend is expected to continue in the near future. e‐Commerce practices are subject to uncertainty conditions and high variability in customers’ demands. Considering these characteristics, we propose two facility–location models that represent alternative distribution policies in e‐commerce (one based on outsourcing and another based on in‐house distribution). These models take into account stochastic demands as well as more than one regular supplier per customer. Two methodologies are then introduced to solve these stochastic versions of the well‐known capacitated facility–location problem. The first is a two‐stage stochastic‐programming approach that uses an exact solver. However, we show that this approach is not appropriate for tackle large‐scale instances due to the computational effort required. Accordingly, we also introduce a “simheuristic” approach that is able to deal with large‐scale instances in short computing times. An extensive set of benchmark instances contribute to illustrate the efficiency of our approach, as well as its potential utility in modern e‐commerce practices., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness and FEDER (TRA2013-48180-C3-P, TRA2015-71883-REDT) and the Erasmus+ programme (2016-1-ES01-KA108-023465). We also thank the support of the UOC doctoral programme.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign

  • Coelho, Vitor Nazário
  • Oliveira, Thays Aparecida de
  • Coelho, Igor Machado
  • Coelho, Bruno N.
  • Fleming, Peter J.
  • Guimarães, Frederico G.
  • Ramalhinho-Lourenço, Helena
  • Souza, Marcone Jamilson Freitas
  • Talbi, El-Ghazali
  • Lust, Thibaut
Cross-selling campaigns seek to offer the right products to the set of customers with the goal of maximizing expected profit, while, at the same time, respecting the purchasing constraints set by investors. In this context, a bi-objective version of this NP-Hard problem is approached in this paper, aiming at maximizing both the promotion campaign total profit and the risk-adjusted return, which is estimated with the reward-to-variability ratio known as Sharpe ratio. Given the combinatorial nature of the problem and the large volume of data, heuristic methods are the most common used techniques. A Greedy Randomized Neighborhood Structure is also designed, including the characteristics of a neighborhood exploration strategy together with a Greedy Randomized Constructive technique, which is embedded in a multi-objective local search metaheuristic. The latter combines the power of neighborhood exploration by using a Pareto Local Search with Variable Neighborhood Search. Sets of non-dominated solutions obtained by the proposed method are described and analyzed for a number of problem instances., The authors would like to thank Brazilian agency CAPES, CNPq (grants 305506/2010-2, 552289/2011-6, 306694/2013-1 and 312276/2013-3), FAPEMIG (grants APQ-04611-10, PPM CEX497-13) and FP7 CORDIS, “New Horizons for Multi Criteria Decision Making”, for supporting the development of this work. Helena Ramalhinho was also partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013- 48180-C3-P, TRA2015-71883-REDT).
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Modeling and solving the non-smooth arc routing problem with realistic soft constraints

  • De Armas, Jésica
  • Ferrer, Albert
  • Juan, Angel A.
  • Lalla-Ruiz, Eduardo
This paper considers the non-smooth arc routing problem (NS-ARP) with soft constraints in order to capture in more perceptive way realistic constraints violations arising in transportation and logistics. To appropriately solve this problem, a biased-randomized procedure with iterated local search (BRILS) and a mathematical model for this ARP variant is proposed. An extensive computational study is conducted on rich and diverse problem instances. The results highlight the competitiveness of BRILS in terms of quality and time, where it provides high-quality solutions within reasonable computational times. In the context of real-world environments, the performance exhibited by BRILS motivates its incorporation in intelligent and integrative systems where frequent and fast solutions are required., Supported by the Spanish Ministry of Economy and Competitiveness & FEDER (TRA2015-71883-REDT, TRA2013-48180-C3-P, SEV-2015-0563).
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

A VNS approach for book marketing campaigns generated with quasi-bicliques probabilities

  • Oliveira, Thays Aparecida de
  • Coelho, Vitor Nazário
  • Ramalhinho-Lourenço, Helena
  • Souza, Marcone Jamilson Freitas
  • Coelho, Bruno N.
  • Rezende, Daniel C.
  • Coelho, Igor Machado
This paper focuses on Book Marketing Campaigns, where the benefit of offering each book is calculated based on a bipartite graph (biclique). A quasi Biclique problem is assessed for obtaining the probabilities of success of a given client buy a given book, considering it had received another book as free offer. The remaining optimization decision problem can be solved following the Targeted Offers Problem in Direct Marketing Campaigns. The main objective is to maximize the feedback of customers purchases, offering books to the set of customers with the highest probability of buying others ones from its biclique and, at the same time, minimizing campaign operational costs. Given the combinatorial nature of the problem and the large volume of data, which can involve real cases with up to one million customers, metaheuristics procedures have been used as an efficient way for solving it. Here, a hybrid trajectory search based algorithm, namely GGVNS, which combines the Greedy Randomized Adaptive Search Procedures and General Variable Neighborhood Search, is used. The strategy for generating the quasi Biclique problem is described and a new instance generator for the TOPDMC is introduced. Computational results regarding the GGVNS algorithm shows it is able to find useful and profitable sets of clients., The authors thank the Brazilian agencies CNPq (grants 306694/2013-1, 552289/2011-6 and 202380/2012-2) and FAPEMIG (grants PPM CEX 772/15 and APQ-04611-10) for supporting the development of this work. Helena Ramalhinho was also partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P, TRA2015-71883-REDT).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Horizontal collaboration in freight transport: concepts, benefits and environmental challenges

  • Serrano-Hernandez, Adrian
  • Faulin, Javier
  • Perez-Bernabeu, Elena
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Since its appearance in the 1990s, horizontal collaboration (HC) practices have revealed themselves as catalyzers for optimizing the distribution of goods in freight transport logistics. After introducing the main concepts related to HC, this paper offers a literature review on the topic and provides a classification of best practices in HC. Then, the paper analyses the main benefits and optimization challenges associated with the use of HC at the strategic, tactical, and operational levels. Emerging trends such as the concept of ` green' or environmentally- friendly HC in freight transport logistics are also introduced. Finally, the paper discusses the need of using hybrid optimization methods, such as simheuristics and learnheuristics, in solving some of the previously identified challenges in real- life scenarios dominated by uncertainty and dynamic conditions., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness & FEDER (TRA2013-48180-C3-P, TRA2015-71883-REDT), The Erasmus+ program (2016-1-ES01-KA108-023465), the Ibero American Program of Science and Technology for Development (CYTED2014-515RT-0489), the CAN Foundation (CAN2014-3758, CAN2015-70473), and the Spanish Ministry of Education (FPU-14/00024).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Multi-Criteria Optimization for Fleet Size with Environmental Aspects

  • Sawik, Bartosz
  • Faulin, Javier
  • Pérez-Bernabeu, Elena
[EN] This research concerns multi-criteria vehicle routing problems. Mathematical models are formulated with mixed-integer programming. We consider maximization of capacity of truck vs. minimization of utilization of fuel, carbon emission and production of noise. The problems deal with green logistics for routes crossing the Western Pyrenees in Navarre, Basque Country and La Rioja, Spain. We consider heterogeneous fleet of trucks. Different types of trucks have not only different capacities, but also require different amounts of fuel for operations. Consequently, the amount of carbon emission and noise vary as well. Companies planning delivery routes must consider the trade-off between the financial and environmental aspects of transportation. Efficiency of delivery routes is impacted by truck size and the possibility of dividing long delivery routes into smaller ones. The results of computational experiments modeled after real data from a Spanish food distribution company are reported. Computational results based on formulated optimization models show some balance between fleet size, truck types, utilization of fuel, carbon emission and production of noise. As a result, the company could consider a mixture of trucks sizes and divided routes for smaller trucks. Analyses of obtained results could help logistics managers lead the initiative in environmental conservation by saving fuel and consequently minimizing pollution., This work has been partially supported by the National Research Center (NCN), Poland (DEC2013/11/B/ST8/04458), by AGH, and by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180- C3-P and TRA2015-71883-REDT), and the Ibero-American Program for Science and Technology for Development (CYTED2014-515RT0489). Likewise, we want to acknowledge the support received by the CAN Foundation in Navarre, Spain (Grants CAN2014-3758 and CAN2015-70473). The authors are grateful to anonymous reviewers for their comments.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Multicriteria Analysis for the Green VRP: A Case Discussion for the Distribution Problem of a Spanish Retailer

  • Sawik, Bartosz
  • Faulin, Javier
  • Pérez Bernabeu, Elena|||0000-0002-9221-7623
[EN] This research presents the group of green vehicle routing problems with environmental costs translated into money versus production of noise, pollution and fuel consumption. This research is focused on multi-objective green logistics optimization. Optimality criteria are environmental costs: minimization of amount of money paid as externality cost for noise, pollution and costs of fuel versus minimization of noise, pollution and fuel consumption themselves. Some mixed integer programming formulations of multi-criteria vehicle routing problems have been considered. Mathematical models were formulated under assumption of existence of asymmetric distance-based costs and use of homogeneous fleet. The exact solution methods are applied for finding optimal solutions. The software used to solve these models is the CPLEX solver with AMPL programming language. The researchers were able to use real data from a Spanish company of groceries. Problems deal with green logistics for routes crossing the Spanish regions of Navarre, Basque Country and La Rioja. Analyses of obtained results could help logistics managers to lead the initiative in area of green logistics by saving money paid for environmental costs as well as direct cost of fuel and minimization of pollution and noise., This work has been partially supported by the National Research Center (NCN), Poland (DEC-2013/11/B/ST8/04458), by AGH, and by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P and TRA2015-71883-REDT), and the Ibero-American Program for Science and Technology for Development (CYTED2014-515RT0489). Likewise, we want to acknowledge the support received by the CAN Foundation in Navarre, Spain (Grants CAN2014-3758 and CAN2015-70473)
O2, repositorio institucional de la UOC
Publicación Artículo científico (JournalArticle)

A simheuristic algorithm for solving the arc routing problem with stochastic demands

  • González Martín, Sergio
  • Juan, Angel A.
  • Riera Terrén, Daniel
  • Elizondo, Monica G.
  • Ramos, Juan Jose
This paper proposes a simheuristic algorithm for solving the Arc Routing Problem with Stochastic Demands (ARPSD). Our approach combines Monte Carlo Simulation (MCS) with the RandSHARP metaheuristic, which was originally designed for solving the Capacitated Arc Routing Problem with deterministic demands (CARP). The RandSHARP metaheuristic is a biased-randomized version of a savings-based heuristic for the CARP, which allows it to obtain competitive results for this problem in low computational times. The RandSHARP is then combined with MCS to cope with the stochastic variant of the problem in a natural and efficient way. Our work is based on the use of a safety stock during the route-design stage. This safety stock can then be used during the delivery stage to satisfy unexpected demands. A reliability index is also defined to evaluate the robustness of each solution with respect to possible route failures caused by random demands. Some numerical experiments contribute to validate our approach and to illustrate its potential benefits.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Modeling and solving the non-smooth arc routing problem with realistic soft constraints

  • De Armas, Jésica
  • Ferrer, Albert
  • Juan, Angel A.
  • Lalla-Ruiz, Eduardo
This paper considers the non-smooth arc routing problem (NS-ARP) with soft constraints in order to capture in more perceptive way realistic constraints violations arising in transportation and logistics. To appropriately solve this problem, a biased-randomized procedure with iterated local search (BRILS) and a mathematical model for this ARP variant is proposed. An extensive computational study is conducted on rich and diverse problem instances. The results highlight the competitiveness of BRILS in terms of quality and time, where it provides high-quality solutions within reasonable computational times. In the context of real-world environments, the performance exhibited by BRILS motivates its incorporation in intelligent and integrative systems where frequent and fast solutions are required., Supported by the Spanish Ministry of Economy and Competitiveness & FEDER (TRA2015-71883-REDT, TRA2013-48180-C3-P, SEV-2015-0563).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Multi criteria biased randomized method for resource allocation in distributed systems: Application in a volunteer computing system

  • Panadero, Javier
  • De Armas, Jésica
  • Serra, Xavier
  • Marquès, Joan Manuel
Volunteer computing is a type of distributed computing in which a part or all the resources (processing power and storage) necessary to run the system are donated by users. In other words, participants contribute their idle computing resources to help running the system. Due to the fact that the nodes which compose the system are provided by a large number of users instead of a single (or a few) institution, a main drawback of volunteer computing is the unreliability of these nodes. For this reason, the selection of nodes to be involved in each task becomes a key issue. In this paper, we propose the Multi Criteria Biased Randomized (MCBR) method, a novel selection method for large-scale systems that use unreliable nodes. MCBR method is based on a multicriteria optimization strategy. We evaluated the method in a microblogging social network formed by a large number of microservices hosted in nodes voluntarily contributed by their participants. Simulation results show that our proposal is able to select nodes in a fast and efficient manner while requiring low computational power., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P, TRA2015-71883-REDT), FEDER and the Erasmus+ programme (20161ES01KA108023465).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign

  • Coelho, Vitor Nazário
  • Oliveira, Thays Aparecida de
  • Coelho, Igor Machado
  • Coelho, Bruno N.
  • Fleming, Peter J.
  • Guimarães, Frederico G.
  • Ramalhinho-Lourenço, Helena
  • Souza, Marcone Jamilson Freitas
  • Talbi, El-Ghazali
  • Lust, Thibaut
Cross-selling campaigns seek to offer the right products to the set of customers with the goal of maximizing expected profit, while, at the same time, respecting the purchasing constraints set by investors. In this context, a bi-objective version of this NP-Hard problem is approached in this paper, aiming at maximizing both the promotion campaign total profit and the risk-adjusted return, which is estimated with the reward-to-variability ratio known as Sharpe ratio. Given the combinatorial nature of the problem and the large volume of data, heuristic methods are the most common used techniques. A Greedy Randomized Neighborhood Structure is also designed, including the characteristics of a neighborhood exploration strategy together with a Greedy Randomized Constructive technique, which is embedded in a multi-objective local search metaheuristic. The latter combines the power of neighborhood exploration by using a Pareto Local Search with Variable Neighborhood Search. Sets of non-dominated solutions obtained by the proposed method are described and analyzed for a number of problem instances., The authors would like to thank Brazilian agency CAPES, CNPq (grants 305506/2010-2, 552289/2011-6, 306694/2013-1 and 312276/2013-3), FAPEMIG (grants APQ-04611-10, PPM CEX497-13) and FP7 CORDIS, “New Horizons for Multi Criteria Decision Making”, for supporting the development of this work. Helena Ramalhinho was also partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013- 48180-C3-P, TRA2015-71883-REDT).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Designing e‐commerce supply chains: a stochastic facility–location approach

  • Pagès Bernaus, Adela
  • Ramalhinho-Lourenço, Helena
  • Juan, Angel A.
  • Calvet Mir, Laura
E‐Commerce activity has been increasing during recent years, and this trend is expected to continue in the near future. e‐Commerce practices are subject to uncertainty conditions and high variability in customers’ demands. Considering these characteristics, we propose two facility–location models that represent alternative distribution policies in e‐commerce (one based on outsourcing and another based on in‐house distribution). These models take into account stochastic demands as well as more than one regular supplier per customer. Two methodologies are then introduced to solve these stochastic versions of the well‐known capacitated facility–location problem. The first is a two‐stage stochastic‐programming approach that uses an exact solver. However, we show that this approach is not appropriate for tackle large‐scale instances due to the computational effort required. Accordingly, we also introduce a “simheuristic” approach that is able to deal with large‐scale instances in short computing times. An extensive set of benchmark instances contribute to illustrate the efficiency of our approach, as well as its potential utility in modern e‐commerce practices., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness and FEDER (TRA2013-48180-C3-P, TRA2015-71883-REDT) and the Erasmus+ programme (2016-1-ES01-KA108-023465). We also thank the support of the UOC doctoral programme.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A VNS approach for book marketing campaigns generated with quasi-bicliques probabilities

  • Oliveira, Thays Aparecida de
  • Coelho, Vitor Nazário
  • Ramalhinho-Lourenço, Helena
  • Souza, Marcone Jamilson Freitas
  • Coelho, Bruno N.
  • Rezende, Daniel C.
  • Coelho, Igor Machado
This paper focuses on Book Marketing Campaigns, where the benefit of offering each book is calculated based on a bipartite graph (biclique). A quasi Biclique problem is assessed for obtaining the probabilities of success of a given client buy a given book, considering it had received another book as free offer. The remaining optimization decision problem can be solved following the Targeted Offers Problem in Direct Marketing Campaigns. The main objective is to maximize the feedback of customers purchases, offering books to the set of customers with the highest probability of buying others ones from its biclique and, at the same time, minimizing campaign operational costs. Given the combinatorial nature of the problem and the large volume of data, which can involve real cases with up to one million customers, metaheuristics procedures have been used as an efficient way for solving it. Here, a hybrid trajectory search based algorithm, namely GGVNS, which combines the Greedy Randomized Adaptive Search Procedures and General Variable Neighborhood Search, is used. The strategy for generating the quasi Biclique problem is described and a new instance generator for the TOPDMC is introduced. Computational results regarding the GGVNS algorithm shows it is able to find useful and profitable sets of clients., The authors thank the Brazilian agencies CNPq (grants 306694/2013-1, 552289/2011-6 and 202380/2012-2) and FAPEMIG (grants PPM CEX 772/15 and APQ-04611-10) for supporting the development of this work. Helena Ramalhinho was also partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P, TRA2015-71883-REDT).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Biased randomization of heuristics using skewed probability distributions: a survey and some applications

  • Grasas, Àlex
  • Juan, Angel A.
  • Faulin, Javier
  • De Armas, Jésica
  • Ramalhinho-Lourenço, Helena
Randomized heuristics are widely used to solve large scale combinatorial optimization problems. Among the plethora of randomized heuristics, this paper reviews those that contain biased-randomized procedures (BRPs). A BRP is a procedure to select the next constructive ‘movement’ from a list of candidates in which their elements have different probabilities based on some criteria (e.g., ranking, priority rule, heuristic value, etc.). The main idea behind biased randomization is the introduction of a slight modification in the greedy constructive behavior that provides a certain degree of randomness while maintaining the logic behind the heuristic. BRPs can be categorized into two main groups according to how choice probabilities are computed: (i) BRPs using an empirical bias function; and (ii) BRPs using a skewed theoretical probability distribution. This paper analyzes the second group and illustrates, throughout a series of numerical experiments, how these BRPs can benefit from parallel computing in order to significantly outperform heuristics and even simple metaheuristic approaches, thus providing reasonably good solutions in ‘real time’ to different problems in the areas of transportation, logistics, and scheduling., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness and FEDER (TRA2013-48180-C3-P, TRA2015-71883-REDT), the Ibero-American Program for Science and Technology for Development (CYTED2014-515RT0489), and the Erasmus+ Program (2016-1-ES01-KA108-023465).
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A simheuristic approach for the two-dimensional vehicle routing problem with stochastic travel times

  • Guimarans, Daniel|||0000-0002-5268-7241
  • Dominguez, Oscar
  • Panadero, Javier|||0000-0002-3793-3328
  • Juan, Ángel A|||0000-0003-1392-1776
The two-dimensional vehicle routing problem (2L-VRP) is a realistic extension of the classical vehicle routing problem in which customers' demands are composed by sets of non-stackable items. Examples can be found in real-life applications such as the transportation of furniture or industrial machinery. Often, it is necessary to consider stochastic travel times due to traffic conditions or customers availability. However, there is a lack of works discussing stochastic versions of the 2L-VRP. This paper offers a model of the 2L-VRP with stochastic travel times that also includes penalty costs generated by overtime. To solve this stochastic and non-smooth version of the 2L-VRP, a hybrid simheuristic algorithm is proposed. Our approach combines Monte Carlo simulation, an iterated local search framework, and biased-randomised routing and packing heuristics. Our algorithm is tested on an extensive benchmark, which extends the deterministic one for the 2L-VRP with unrestricted and non-oriented loading.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Combining variable neighborhood search with simulation for the inventory routing problem with stochastic demands and stock-outs

  • Gruler, Aljoscha|||0000-0003-0510-117X
  • Panadero, Javier|||0000-0002-3793-3328
  • Armas Adrián, Jésica de|||0000-0002-7619-7407
  • Moreno Pérez, José Andrés|||0000-0001-9506-5197
  • Juan, Ángel A|||0000-0003-1392-1776
Vendor managed inventory aims at reducing supply chain costs by centralizing inventory management and vehicle routing decisions. This integrated supply chain approach results in a complex combinatorial optimization problem known as the inventory routing problem (IRP). This paper presents a variable neighborhood search metaheuristic hybridized with simulation to solve the IRP under demand uncertainty. Our simheuristic approach is able to solve large sized instances for the single period IRP with stochastic demands and stock-outs in very short computing times. A range of experiments underline the algorithm's competitiveness compared to previously used heuristic approaches. The results are analyzed in order to provide closer managerial insights.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Agri-food supply chains with stochastic demands, a multi-period inventory routing problem with perishable products

  • Onggo, Bhakti Stephan|||0000-0001-5899-304X
  • Panadero, Javier|||0000-0002-3793-3328
  • Corlu, Canan G.
  • Juan, Ángel A|||0000-0003-1392-1776
This paper considers an agri-food supply chain with a single fresh food supplier, who owns a central warehouse that serves several retail centers. Retail centers carry a certain amount of inventory of the fresh product, which is prone to deterioration. The supplier makes both inventory and routing decisions to minimize the inventory, transportation, food-waste, and stock-out costs in the face of stochastic customer demand and perishable products that need to be delivered to each retail center. This inventory routing problem is known as perishable inventory routing problem (PIRP) with stochastic demands in the literature. We model it using a mixed integer program and propose a simheuristic algorithm, which integrates Monte Carlo simulation within an iterated local search, to solve it. Our experiments show that the proposed algorithm can improve the initial solution with reasonable computational times. The resulting procedure is easy to implement and is applicable to other domains where a multi-period PIRP with stochastic demands may appear.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Multi criteria biased randomized method for resource allocation in distributed systems, application in a volunteer computing system

  • Panadero, Javier|||0000-0002-3793-3328
  • Armas Adrián, Jésica de|||0000-0002-7619-7407
  • Serra, Xavier
  • Marquès Puig, Joan Manuel
Volunteer computing is a type of distributed computing in which a part or all the resources (processing power and storage) necessary to run the system are donated by users. In other words, participants contribute their idle computing resources to help running the system. Due to the fact that the nodes which compose the system are provided by a large number of users instead of a single (or a few) institution, a main drawback of volunteer computing is the unreliability of these nodes. For this reason, the selection of nodes to be involved in each task becomes a key issue. In this paper, we propose the Multi Criteria Biased Randomized (MCBR) method, a novel selection method for large-scale systems that use unreliable nodes. MCBR method is based on a multicriteria optimization strategy. We evaluated the method in a microblogging social network formed by a large number of microservices hosted in nodes voluntarily contributed by their participants. Simulation results show that our proposal is able to select nodes in a fast and efficient manner while requiring low computational power.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

The location routing problem using electric vehicles with constrained distance

  • Almouhanna, Abdullah
  • Quintero Araujo, Carlos Leonardo|||0000-0001-8563-4456
  • Panadero, Javier|||0000-0002-3793-3328
  • Khosravi, Banafsheh|||0000-0003-4314-6715
  • Ouelhadj, Djamila|||0000-0001-9866-1402
  • Juan, Ángel A|||0000-0003-1392-1776
The introduction of Electric Vehicles (EVs) in modern fleets facilitates a shift towards greener road transportation practices. However, the driving ranges of EVs are limited by the duration of their batteries, which raises some operational challenges. This paper discusses the Location Routing Problem with a Constrained Distance (LRPCD), which is a natural extension of the Location Routing Problem when EVs are utilized. A fast multi-start heuristic and a metaheuristic are proposed to solve the LRPCD. The former combines biased-randomization techniques with the well-known Tillman's heuristic for the Multi-Depot Vehicle Routing Problem. The latter incorporates the biased-randomized approach into the Variable Neighborhood Search (VNS) framework. A series of computational experiments show that the multi-start heuristic is able to generate good-quality solutions in just a few seconds, while the biased-rendomized VNS metaheuristic provides higher-quality solutions by employing more computational time.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A variable neighborhood search simheuristic for project portfolio selection under uncertainty

  • Panadero, Javier|||0000-0002-3793-3328
  • Doering, Jana
  • Kizys, Renatas|||0000-0001-9104-1809
  • Juan, Ángel A|||0000-0003-1392-1776
  • Fitó Bertran, Àngels|||0000-0002-7782-7685
With limited financial resources, decision-makers in firms and governments face the task of selecting the best portfolio of projects to invest in. As the pool of project proposals increases and more realistic constraints are considered, the problem becomes NP-hard. Thus, metaheuristics have been employed for solving large instances of the project portfolio selection problem (PPSP). However, most of the existing works do not account for uncertainty. This paper contributes to close this gap by analyzing a stochastic version of the PPSP: the goal is to maximize the expected net present value of the inversion, while considering random cash flows and discount rates in future periods, as well as a rich set of constraints including the maximum risk allowed. To solve this stochastic PPSP, a simulation-optimization algorithm is introduced. Our approach integrates a variable neighborhood search metaheuristic with Monte Carlo simulation. A series of computational experiments contribute to validate our approach and illustrate how the solutions vary as the level of uncertainty increases.
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 Artículo científico (JournalArticle)

Managing transportation externalities in the Pyrenees region: measuring the willingness-to-pay for road freight noise reduction using an experimental auction mechanism

  • Denant-Boemont, Laurent
  • Faulín Fajardo, Javier
  • Hammiche, Sabrina
  • Serrano Hernández, Adrián
The estimation of the noise impact caused by road freight transportation is critical to have acknowledgment of the ambiance pollution caused by road traffic crossing geographical areas containing important natural resources. Thus, our work proposes a within-subject survey where a Contingent Valuation Method (CVM) is combined with a laboratory economic experimental auction. Our study objective is to measure the willingness-to-pay (WTP) for reducing traffic noise nuisances due to freight transportation in the region of Navarre, Spain. A special focus is made regarding the measurement of the hypothetical bias, when a comparison is done between hypothetical WTP, coming from the CVM study, with real-incentivized one, as the outcome of the economic experiment. Additionally, statistical analyses are conducted in order to find explanation factors for these outcomes. Results suggest a strong evidence for an upward hypothetical bias (from 50% to 160%) indicating the income, the educational level, the gender, and the age as the main factors which explain that bias., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P and TRA2015-71883-REDT), and the Ibero-American Program for Science and Technology for Development (CYTED2014-515RT0489). Likewise, the authors want to acknowledge the support received by CAN Foundation in Navarre, Spain (Grant CAN2015-70473).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

Horizontal collaboration in freight transport: concepts, benefits and environmental challenges

  • Serrano Hernández, Adrián
  • Juan Pérez, Ángel Alejandro
  • Faulín Fajardo, Javier
  • Pérez Bernabeu, Elena
Since its appearance in the 1990s, horizontal collaboration (HC) practices have revealed them-selves as catalyzers for optimizing the distribution of goods in freight transport logistics. After introducing the main concepts related to HC, this paper offers a literature review on the topic and provides a classification of best practices in HC. Then, the paper analyses the main benefits and optimization challenges associated with the use of HC at the strategic, tactical, and operational levels. Emerging trends such as the concept of ‘green’ or environmentally-friendly HC in freighttransport logistics are also introduced. Finally, the paper discusses the need of using hybrid optimization methods, such as simheuristics and learnheuristics, in solving some of the previously identified challenges in real-life scenarios dominated by uncertainty and dynamic conditions., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness & FEDER (TRA2013-48180-C3-P, TRA2015-71883-REDT), The Erasmus+ program (2016-1-ES01-KA108-023465), the Ibero American Program of Science and Technology for Development (CYTED2014-515RT-0489), the CAN Foundation (CAN2014-3758, CAN2015-70473), and the SpanishMinistry of Education (FPU-14/00024).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

An extended behavior model for explaining the willingness to pay to reduce the air pollution in road transportation

  • Sánchez García, Mercedes
  • Zouaghi, Ferdaous
  • Lera López, Fernando
  • Faulín Fajardo, Javier
Road transportation constitutes a key sector in developed countries, as an essential catalyst for economic and social activities. Nevertheless, it is relevant to emphasize the negative impacts of this activity identified in Economics as negative externalities. At the European Union, road transportation is the main cause of the air pollution impact on the population. Thus, this study explores the factors that influence the willingness to pay (WTP) on behalf of the citizens to reduce air pollution generated by road transport. In doing so, we propose two fundamental theoretical frameworks to explain individual behavior towards the environment actions: the Theory of Planned Behavior (TPB) and the Value-Belief-Norm (VBN) models. A questionnaire survey with 1,612 residents was used to collect data in 65 localities located in the Spanish Pyrenees and performing a statistical analysis with the resulting data relied on application of Structural Equation Models (SEM). Moreover, the survey results highlight the importance of psychological aspects as predictors of proenvironmental behaviors. Our empirical results provide a novel contribution about how governments and educational policies can enhance the positive attitude towards environmental actions, unifying the struggle in favor of environmental protection from early childhood., This work has been partly supported by the Spanish Ministry of Economy and Competitiveness (TRA2010-21644-C03-01, TRA2013-48180-C3-P, TRA2015-71883-REDT and ECO2017-86305-C4-4-R (AEI /FEDER, EU), and the Ibero-American Program for Science and Technology for Development (CYTED2014-515RT0489). 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).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

Locating a biorefinery in Northern Spain: decision making and economic consequences

  • Serrano Hernández, Adrián
  • Faulín Fajardo, Javier
Biofuels are emerging as a prominent renewable and sustainable energy sources in developed countries. In this sense, this paper presents a case study in which a biorefinery has to be sited in Northern Spain. Thus, the strategic decision of locating such a facility is deeply investigated through strategic policy evaluation. Then, tactical decisions ranging from purchasing and transportation policies to storage protocols are carried out. Only local and limited biomass can be harvested for supplying the biorefinery through a heterogeneous vehicle fleet. Moreover two different and mutually exclusive storage strategies are evaluated: direct supply from crops to biorefinery and using intermediate-collectors. Additionally, crop exploitation factors and biorefinery sizes are used to generate several scenarios in which the strategic decision of location as well as all the tactic decisions are made. Some mixed integer linear programming models are proposed to figure out all relevant decision problems. The results suggest that the Northwest study area as the best option to locate the biorefinery and recommend the intermediate-collector storage strategy. Moreover, the key information about critical biomass, crops and times are also provided., This work has been partially supported by the Government of Navarre (Biorefinery Navarra project IIM14196.RI1), the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P and TRA2015-71883-REDT), and the Ibero-American Program for Science and Technology for Development (CYTED2014-515RT0489). Likewise, we want to acknowledge the support received by the CAN Foundation in Navarre, Spain (Grant CAN2017-6101).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

Short- and mid-term evaluation of the use of electric vehicles in urban freight transport collaborative networks: a case study

  • Muñoz Villamizar, Andrés
  • Quintero Araújo, Carlos L.
  • Montoya Torres, Jairo R.
  • Faulín Fajardo, Javier
Despite its negative impacts, freight transportation is a primary component of all supply chains. Decision makers have considered diverse strategies, such as Horizontal Collaboration (HC) and the usage of alternative types of vehicles, to reduce overall cost and the related environmental and social impacts. This paper assesses the implementation of an electric fleet of vehicles in urban goods distribution under HC strategy between carriers. A biased randomisation based algorithm is used to solve the problem with a multi-objective function to explore the relationships between both delivery and environmental costs. Real data from the city of Bogota, Colombia are used to validate this approach. Experiments with different costs and demands projections are performed to analyse short- and medium-term impacts related to the usage of electric vehicles in collaborative networks. Results show that the optimal selection of vehicle types depends considerably on the time horizon evaluation and demand variation., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P and TRA2015-71883-REDT) and the Ibero-American Program for Science and Technology for Development (CYTED2014-515RT0489). Likewise, we want to acknowledge the support received by the Special Patrimonial Fund from Universidad de La Sabana (Colombia) and the doctoral grant from the UOC-Open University of Catalonia (Spain).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

Electric vehicles in logistics and transportation: a survey on emerging environmental, strategic, and operational challenges

  • Juan Pérez, Ángel Alejandro
  • Méndez, Carlos Alberto
  • Faulín Fajardo, Javier
  • Armas, Jesica de
  • Grasman, Scott Erwin
Incluye correcciones [Energies 2016, 9(7), 546; doi:10.3390/en9070546], Current logistics and transportation (L&T) systems include heterogeneous fleets consisting of common internal combustion engine vehicles as well as other types of vehicles using “green” technologies, e.g., plug-in hybrid electric vehicles and electric vehicles (EVs). However, the incorporation of EVs in L&T activities also raise some additional challenges from the strategic, planning, and operational perspectives. For instance, smart cities are required to provide recharge stations for electric-based vehicles, meaning that investment decisions need to be made about the number, location, and capacity of these stations. Similarly, the limited driving-range capabilities of EVs, which are restricted by the amount of electricity stored in their batteries, impose non-trivial additional constraints when designing efficient distribution routes. Accordingly, this paper identifies and reviews several open research challenges related to the introduction of EVs in L&T activities, including: (a) environmental-related issues; and (b) strategic, planning and operational issues associated with “standard” EVs and with hydrogen-based EVs. The paper also analyzes how the introduction of EVs in L&T systems generates new variants of the well-known Vehicle Routing Problem, one of the most studied optimization problems in the L&T field, and proposes the use of metaheuristics and simheuristics as the most efficient way to deal with these complex optimization problems., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P and TRA2015-71883-REDT), FEDER, and the CYTED Program (CYTED2014-515RT0489). Likewise, we want to acknowledge the support received by the Catalan Government (2014-CTP-00001) and the CAN Foundation (CAN2014-3758 and CAN2015-70473).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

Internalizing negative externalities in vehicle routing problems through green taxes and green tolls

  • Serrano Hernández, Adrián
  • Faulín Fajardo, Javier
Road freight transportation includes various internal and external costs that need to be accounted for in the construction of efficient routing plans. Typically, the resulting optimization problem is formulated as a vehicle routing problem in any of its variants. While the traditional focus of the vehicle routing problem was the minimization of internal routing costs such as travel distance or duration, numerous approaches to include external factors related to environmental routing aspects have been recently discussed in the literature. However, internal and external routing costs are often treated as competing objectives. This paper discusses the internalization of external routing costs through the consideration of green taxes and green tolls. Numeric experiments with a biased-randomization savings algorithm, show benefits of combining internal and external costs in delivery route planning., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness (TRA2013-48180-C3-P and TRA2015-71883-REDT), FEDER, and the Ibero-American Program for Science and Technology for Development (CYTED2014-515RT0489). Moreover, the authors appreciate the financial support of the Erasmus+ Program (2016-1-ES01-KA108-023465) and the CAN Foundation in Navarre, Spain (Grant CAN2017-6101). Likewise, we want to acknowledge the financial support received by Spanish Ministry of Education (Grant FPU 2014-0024).