1 resultado para Complex combinatorial problem
em Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland
Filtro por publicador
- Repository Napier (1)
- Abertay Research Collections - Abertay University’s repository (1)
- Aberystwyth University Repository - Reino Unido (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (11)
- Aquatic Commons (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (5)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (20)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (9)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (6)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (12)
- Boston University Digital Common (1)
- Brock University, Canada (5)
- Bulgarian Digital Mathematics Library at IMI-BAS (19)
- CaltechTHESIS (6)
- Cambridge University Engineering Department Publications Database (4)
- CentAUR: Central Archive University of Reading - UK (18)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (7)
- Cochin University of Science & Technology (CUSAT), India (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (2)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- Dalarna University College Electronic Archive (5)
- Deakin Research Online - Australia (45)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- Digital Commons - Michigan Tech (3)
- Digital Commons - Montana Tech (1)
- Digital Commons at Florida International University (5)
- Digital Peer Publishing (1)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- FUNDAJ - Fundação Joaquim Nabuco (4)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (5)
- Helda - Digital Repository of University of Helsinki (2)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (21)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico do Porto, Portugal (4)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Martin Luther Universitat Halle Wittenberg, Germany (1)
- Massachusetts Institute of Technology (3)
- National Center for Biotechnology Information - NCBI (6)
- Nottingham eTheses (4)
- Open University Netherlands (1)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (9)
- Queensland University of Technology - ePrints Archive (592)
- Repositorio Academico Digital UANL (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (4)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (38)
- Universidad de Alicante (6)
- Universidad Politécnica de Madrid (17)
- Universidade Federal de Uberlândia (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (5)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (3)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (5)
- University of Michigan (1)
- University of Queensland eSpace - Australia (4)
- University of Washington (3)
Resumo:
The goal of Vehicle Routing Problems (VRP) and their variations is to transport a set of orders with the minimum number of vehicles at least cost. Most approaches are designed to solve specific problem variations independently, whereas in real world applications, different constraints are handled concurrently. This research extends solutions obtained for the traveling salesman problem with time windows to a much wider class of route planning problems in logistics. The work describes a novel approach that: supports a heterogeneous fleet of vehicles dynamically reduces the number of vehicles respects individual capacity restrictions satisfies pickup and delivery constraints takes Hamiltonian paths (rather than cycles) The proposed approach uses Monte-Carlo Tree Search and in particular Nested Rollout Policy Adaptation. For the evaluation of the work, real data from the industry was obtained and tested and the results are reported.