Pasar al contenido principal

ALGORITMOS Y SOFTWARE DISTRIBUIDO PARA EL DISEÑO DE RUTAS OPTIMAS EN PYMES

TRA2010-21644-C03-02

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2010
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario FUNDACIO PER A LA UNIVERSITAT OBERTA DE CATALUNYA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

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

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

Solving vehicle routing problems with asymmetric costs and heterogeneous fleets

  • Herrero, Rosa
  • Cáceres-Cruz, José
  • Rodríguez Villalobos, Alejandro|||0000-0003-1079-6121
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The vehicle routing problem (VRP) is a flourishing research area with clear applications to real-life distribution companies. However, most VRP-related academic articles assume the existence of a homogeneous fleet of vehicles and/or a symmetric cost matrix. These assumptions are not always reasonable in real-life scenarios. To contribute in closing this gap between theory and practice, we propose a hybrid methodology for solving the asymmetric and heterogeneous vehicle routing problem (AHVRP). In our approach, we consider: 1) different types of vehicle loading capacities (heterogeneous fleets); 2) asymmetric distance-based costs. The proposed approach combines a randomised version of a well-known savings heuristic with several local searches specifically adapted to deal with the asymmetric nature of costs. A computational experiment allows us to discuss the efficiency of our approach and also to analyse how routing costs vary when slight departures from the homogeneous fleet assumption are considered., This work has been partially supported by the Ibero-American Program for Science, Technology and Development (CYTED2010-511RT0419, IN3-HAROSA network) and by the Spanish Ministry of Science and Innovation (TRA2010-21644-C03).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Contribución de congreso (ConferenceOutput)

Horizontal cooperation in vehicle routing problems with backhauling and environmental criteria

  • Juan, Angel A.|||0000-0003-1392-1776
  • Pérez Bernabeu, Elena|||0000-0002-9221-7623
  • Faulin, Javier
  • Jozefowiez, Nicolas
Horizontal cooperation in logistics refers to how two or more companies can cooperate in order to achieve a common objective, which is usually related to minimization of global distribution costs. This paper discusses backhaul-based horizontal cooperation in road transportation and supports the relevance of this praxis as a way of reducing both routing costs as well as costs due to CO2 emissions. After describing the problem context and reviewing some related work, the paper examines different numerical examples in order to quantify the savings in routing and emissions costs that can be attained throughout backhaul-based horizontal cooperation. Both cooperative and non-cooperative scenarios are discussed and compared against each other. These considerations raise the value of the global objective function, permitting a realistic analysis of the importance of horizontal cooperation in the control of the environmental impact of road transportation. (C) 2013 The Authors. Published by Elsevier Ltd. Selection and/or peer-review under responsibility of Scientific Committee, This work has been partially supporled by the Department of Universities Research & lnformation Society of the Catalan Government (2012-CTP-00005) and by the Spanish Ministry of Science and Innovation (TRA2010-21644-C03).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times

  • Juan, Angel A.|||0000-0003-1392-1776
  • Vallada Regalado, Eva|||0000-0003-3918-1788
  • Barrios, Barry B.
  • Riera, Daniel
  • Jorba, Josep
This paper describes a simulation optimization algorithm for the Permutation Flow shop Problem with Stochastic processing Times (PFSPST). The proposed algorithm combines Monte Carlo simulation with an Iterated Local Search metaheuristic in order to deal with the stochastic behavior of the problem. Using the expected makespan as initial minimization criterion, our simheuristic approach is based on the assumption that high-quality solutions (permutations of jobs) for the deterministic version of the problem are likely to be high-quality solutions for the stochastic version i.e., a correlation will exist between both sets of solutions, at least for moderate levels of variability in the stochastic processing times. No particular assumption is made on the probability distributions modeling each job-machine processing times. Our approach is able to solve, in just a few minutes or even less, PFSPST instances with hundreds of jobs and dozens of machines. Also, the paper proposes the use of reliability analysis techniques to analyze simulation outcomes or historical observations on the random variable representing the makespan associated with a given solution. This way, criteria other than the expected makespan can be considered by the decision maker when comparing different alternative solutions. A set of classical benchmarks for the deterministic version of the problem are adapted and tested under several scenarios, each of them characterized by a different level of uncertainty variance level of job-machine processing times., This work has been partially supported by the Spanish Ministry of Science and Innovation (TRA2010-21644-C03). It has been developed in the context of the IN3-ICSO program and the CYTED-HAROSA network (http://dpcs.uoc.edu).