Solving vehicle routing problems with asymmetric costs and heterogeneous fleets
| Autor: | Angel A. Juan, Jose Caceres-Cruz, Alejandro Rodríguez, Rosa Herrero |
|---|---|
| Přispěvatelé: | Universitat Autònoma de Barcelona, Universitat Politècnica de València, Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3) |
| Jazyk: | angličtina |
| Rok vydání: | 2014 |
| Předmět: |
Organizational Behavior and Human Resource Management
Mathematical optimization Heuristic (computer science) Computer science Algorismes Heterogeneous fleets Management Science and Operations Research Cost matrix Vehicle algoritmos aleatorios flotes heterogènies problema de enrutamiento de vehículos Asymmetric costs Vehicle routing problem problema d'enrutament de vehicles real-life vehicle routing problem Algoritmos heterogeneous fleets Routing problem Real-life asymmetric costs costes asimétricos problema d'enrutament del vehicle Randomised algorithms algorismes aleatoris randomised algorithms Homogeneous flotas heterogéneas ORGANIZACION DE EMPRESAS Routing (electronic design automation) costos asimètrics Algorithms |
| Zdroj: | O2, repositorio institucional de la UOC Universitat Oberta de Catalunya (UOC) RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia instname Recercat. Dipósit de la Recerca de Catalunya |
| Popis: | [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). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|