1 resultado para routing algorithms
em Universidade Complutense de Madrid
Filtro por publicador
- Aberdeen University (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (7)
- AMS Campus - Alm@DL - Università di Bologna (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (33)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (23)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (8)
- Aston University Research Archive (6)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (12)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (23)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (58)
- Brock University, Canada (12)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- CentAUR: Central Archive University of Reading - UK (100)
- Cochin University of Science & Technology (CUSAT), India (19)
- Coffee Science - Universidade Federal de Lavras (1)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (54)
- Cor-Ciencia - Acuerdo de Bibliotecas Universitarias de Córdoba (ABUC), Argentina (2)
- CUNY Academic Works (12)
- Dalarna University College Electronic Archive (8)
- Department of Computer Science E-Repository - King's College London, Strand, London (49)
- Digital Commons - Michigan Tech (8)
- Digital Commons at Florida International University (3)
- Digital Peer Publishing (5)
- DigitalCommons@The Texas Medical Center (4)
- DigitalCommons@University of Nebraska - Lincoln (12)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (20)
- DRUM (Digital Repository at the University of Maryland) (1)
- Galway Mayo Institute of Technology, Ireland (1)
- Glasgow Theses Service (1)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Instituto Politécnico do Porto, Portugal (38)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Martin Luther Universitat Halle Wittenberg, Germany (6)
- Massachusetts Institute of Technology (6)
- Memorial University Research Repository (1)
- National Center for Biotechnology Information - NCBI (2)
- Publishing Network for Geoscientific & Environmental Data (2)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (4)
- Repositório da Produção Científica e Intelectual da Unicamp (1)
- Repositório da Universidade Federal do Espírito Santo (UFES), Brazil (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (39)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (15)
- Scielo Saúde Pública - SP (3)
- Universidad Autónoma de Nuevo León, Mexico (2)
- Universidad de Alicante (7)
- Universidad Politécnica de Madrid (63)
- Universidade Complutense de Madrid (1)
- Universidade do Minho (13)
- Universidade Federal de Uberlândia (1)
- Universidade Federal do Pará (3)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitat de Girona, Spain (18)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (7)
- Université de Lausanne, Switzerland (33)
- Université de Montréal, Canada (17)
- University of Connecticut - USA (1)
- University of Michigan (43)
- University of Queensland eSpace - Australia (32)
- University of Southampton, United Kingdom (4)
Resumo:
In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort.