Made available in DSpace on 2016-12-23T14:05:56Z (GMT). No. of bitstreams: 1 patricia rodrigues parte 1 p 1-46.pdf: 620096 bytes, checksum: 2df2214171a193891fb63f38e815ac0e (MD5) Previous issue date: 2011-09-16 / Problems that deal with wheelchair users public transportation are often solved by Dial a Ride Problem (DARP) with time window (Time Window TW). The goal of this type of problem is the minimization of the operation cost, in other words, the ride time respecting constraints like time windows for pickup and delivery of each user, the number of vehicles available and each vehicle capacity. This thesis proposes an exact Mixed Integer Linear Program model to solve the DARPTW. In order to apply the model in a real application, the model was tested with data provided by the Vitória City Hall Infrastructure and Transportation Secretary. The model was implemented using CPLEX software and the results showed that instances up to 20 wheelchair users can be solved optimally. Moreover, it was done an analysis for fleet used / Os problemas de transporte público de cadeirantes são comumente resolvidos pelo modelo Dial-a-Ride Problem (DARP) com janelas de tempo (Time Window - TW). Com base nas restrições de janela de tempo na origem e no destino de cada cliente, no número de veículos e na capacidade de cada um deles, deseja-se minimizar os custos de atendimento dessas demandas, ou seja, o tempo de viagem. A presente dissertação propõe um modelo de Programação Linear Inteira Mista para resolver o problema do DARP-TW. Visando uma aplicação do modelo no transporte público de cadeirantes foram utilizados dados reais fornecidos pela Secretaria de Transportes, Trânsito e Infraestrutura da Prefeitura de Vitória. O modelo foi executado no software CPLEX e os resultados mostraram que cenários com até 20 clientes podem ser resolvidos otimamente. Além disso, foi possível uma análise em relação à frota utilizada

Made available in DSpace on 2016-12-23T14:21:18Z (GMT). No. of bitstreams: 1 Andre Manhaes Machado.pdf: 1039285 bytes, checksum: 2b356c4d0279c975232bd92c5e2ab326 (MD5) Previous issue date: 2013-11-16 / O petróleo é a principal fonte energética do mundo contemporâneo, insumo básico de diversos setores econômicos. Com a descoberta do Pré-sal, o Brasil tem a oportunidade de tornar-se um dos maiores produtores de petróleo. Entretanto, para que isso seja alcançado, vários desafios deverão ser superados e, dentre eles, encontra-se o problema de transporte de empregados para operarem as plataformas offshore, distantes até 300km de distância da costa brasileira. Os problemas referentes ao deslocamento de empregados por meio de helicópteros são usualmente tratados como o Capacitated Helicopter Routing Problem (CHRP). Com base nas restrições de origem e de destino de cada cliente, no número de veículos e na capacidade e restrições de voo dos helicópteros, neste tipo de problema deseja-se minimizar os custos de aluguel de helicópteros mais o custo total de quilômetros voados. A presente dissertação propõe um modelo de Programação Linear Inteira Mista (PLIM) para o problema de roteirização de helicópteros com base no Dial-a-Ride Problem (DARP). Além do modelo apresentado, foram apresentados duas abordagens para a execução do modelo de forma exata: i) abordagem sem agrupamento, na qual as requisições que possuem origens iguais e destinos iguais são modeladas como requisições distintas e ii) abordagem com agrupamento, na qual requisições que possuem origens iguais e destinos iguais são aglutinados numa nova e única requisição. O modelo matemático foi executado no software CPLEX e os resultados mostraram que instâncias com até 25 requisições podem ser resolvidas pela abordagem com agrupamento / Oil is the main energy source of contemporary world; it is basic inputs of various economic sectors. With the discovery of Brazil pre-salt, there is an opportunity to become one of the largest oil producers. However, to achieve her own goals, Brazil must overcome several challenges, including the problem of transporting employees to operate offshore platforms 300km distant away from the Brazilian coast. Problems related to displacement of employees by helicopters are usually treated as Capacitated Helicopter Routing Problem (CHRP). Based on source and destination restrictions of each client, the number of vehicles, capacity and helicopter flight constraints, this type of problem proposes to minimize the cost of renting helicopters and the total cost of flown kilometers. This dissertation proposes a model of Mixed Integer Linear Programming (MILP) for the helicopters routing problem based on a Dial-a-Ride Problem (DARP). Besides the presented model, we presented two approaches to implementing the model in an exact way: i) non-clustered approach, in which requests that have the same origin and destination are equal modeled as separate requests; and ii) clustered approach, in which requests that have the same origins and destinations are clumped together in a new single request. The mathematical model was implemented in software CPLEX and results showed that instances with up to 25 requests can be resolved in the clustered approach

Made available in DSpace on 2016-08-29T11:12:16Z (GMT). No. of bitstreams: 1 tese_6649_Dissertação - André Manhães.pdf: 1047859 bytes, checksum: 5602733dce0d5f103f7c07c76367c8c4 (MD5) Previous issue date: 2013-09-16 / O petróleo é a principal fonte energética do mundo contemporâneo, insumo básico de diversos setores econômicos. Com a descoberta do Pré-sal, o Brasil tem a oportunidade de tornar-se um dos maiores produtores de petróleo. Entretanto, para que isso seja alcançado, vários desafios deverão ser superados e, dentre eles, encontra-se o problema de transporte de empregados para operarem as plataformas offshore, distantes até 300km de distância da costa brasileira. Os problemas referentes ao deslocamento de empregados por meio de helicópteros são usualmente tratados como o Capacitated Helicopter Routing Problem (CHRP). Com base nas restrições de origem e de destino de cada cliente, no número de veículos e na capacidade e restrições de voo dos helicópteros, neste tipo de problema deseja-se minimizar os custos de aluguel de helicópteros mais o custo total de quilômetros voados. A presente dissertação propõe um modelo de Programação Linear Inteira Mista (PLIM) para o problema de roteirização de helicópteros com base no Dial-a-Ride Problem (DARP). Além do modelo apresentado, foram apresentados duas abordagens para a execução do modelo de forma exata: i) abordagem sem agrupamento, na qual as requisições que possuem origens iguais e destinos iguais são modeladas como requisições distintas e ii) abordagem com agrupamento, na qual requisições que possuem origens iguais e destinos iguais são aglutinados numa nova e única requisição. O modelo matemático foi executado no software CPLEX e os resultados mostraram que instâncias com até 25 requisições podem ser resolvidas pela abordagem com agrupamento / Oil is the main energy source of contemporary world; it is basic inputs of various economic sectors. With the discovery of Brazil pre-salt, there is an opportunity to become one of the largest oil producers. However, to achieve her own goals, Brazil must overcome several challenges, including the problem of transporting employees to operate offshore platforms 300km distant away from the Brazilian coast. Problems related to displacement of employees by helicopters are usually treated as Capacitated Helicopter Routing Problem (CHRP). Based on source and destination restrictions of each client, the number of vehicles, capacity and helicopter flight constraints, this type of problem proposes to minimize the cost of renting helicopters and the total cost of flown kilometers. This dissertation proposes a model of Mixed Integer Linear Programming (MILP) for the helicopters routing problem based on a Dial-a-Ride Problem (DARP). Besides the presented model, we presented two approaches to implementing the model in an exact way: i) non-clustered approach, in which requests that have the same origin and destination are equal modeled as separate requests; and ii) clustered approach, in which requests that have the same origins and destinations are clumped together in a new single request. The mathematical model was implemented in software CPLEX and results showed that instances with up to 25 requests can be resolved in the clustered approach

Cette thèse s’intéresse à trouver des solutions informatiques à certains problèmes de l’optimisation combinatoire, à savoir les problèmes de tournées de véhicules. Elle aborde les problèmes de Transport A la Demande (TAD). L’objectif principal visé dans cette thèse fait appel à certaines approches exactes et certaines approches méta-heuristiques pour résoudre des problèmes d’optimisation multi-objective de Transport A la Demande avec plusieurs véhicules. En effet, nos principaux objectifs de recherche consistent à : -I) Résoudre un problème multi-objectif de Transport A La Demande multi-véhicules basé sur la qualité de service ; - II) Résoudre un autre problème de Transport A la Demande multi-objectifs multi-véhicules. Ce problème traite un cas spécifique et qui consiste à l’application de ce problème aux domaines de l’Hospitalisation A Domicile (HAD). Nous avons appliqué des algorithmes exacts de "Branch and Bound" et des méthodes méta-heuristiques telles que l’algorithme évolutionnaire "Algorithme Génétique" et l’algorithme de "Colonie de Fourmis" pour apporter des solutions efficaces à ces différents problèmes. Un ensemble de résultats numériques est présenté pour chacune de ces méthodes pour montrer leurs capacités de produire des solutions de haute qualité en temps de calcul raisonnables. / This thesis focuses on finding computer science solutions for some combinatorial optimization problems, namely Vehicle Routing Problems (VRP). The thesis addresses the Dial A Ride Problems (DARP). Its main objective is to use some exact and meta-heuristics approaches to solve multi-objective optimization of Dial A Ride Problem with multi-vehicles. Hence, our main research aims are : - I)Solve a multi-objective Dial A Ride Problem with multi-vehicles based on quality of service, this problem treats a general case ; - II) Solve another multi-objective Dial A Ride Problem with multi-vehicles, this problem deals with a specific case which is an application of the Dial A Ride Problem in Home Health Care (HHC). We have also applied exact algorithms "Branch and Bound" and meta-heuristic algorithms such as evolutionary algorithms "Genetic Algorithm" and "Ant Colony" algorithm to provide effective solutions to these different problems. A set of numerical results are presented for each of these methods. Our results show that they produce high quality solutions in a reasonable execution time for all the treated problems.

Le Problème de Transport à la Demande (PTD), consiste à prendre en charge le transport des personnes d'un lieu de départ vers un lieu d'arrivée. Il est caractérisé par un ensemble de demandes de transport et d'un nombre de véhicules disponible. L'ultime objectif dans ce travail de thèse est d'offrir une alternative optimisée au déplacement individuel et collectif. Le PTD est classé parmi les problèmes NP-difficile, la majorité des travaux de recherche ont été concentrés sur l'utilisation des méthodes approchées pour le résoudre.Ce problème est également multicritère, la solution proposée dans ce travail permet à la fois une réduction du temps de voyage et également de la distance parcourue. Dans cette thèse, nous proposons notre contribution à l'étude et à la résolution du problème de transport à la demande multicritère et dynamique en appliquant l'algorithme de recuit simulé multi-objectif. Une grande partie de notre travail concerne la conception, le développement et la validation des approches qui permettent de donner des solutions optimales ou quasi optimales, pour un PTD. Ces approches utilisent une méthode multicritère qui s’appuie sur l’algorithme de recuit simulé. La modélisation du PTD est représentée par une architecture multi-acteurs. Cette architecture met en évidence l’aspect distribué du système ainsi que les interactions et les relations qui peuvent avoir lieu entre les différents acteurs. Nous présentons dans ce travail un Système Multi-Agents pour la planification des itinéraires des véhicules affectés au transport des voyageurs. Les agents de ce système utilisent le module d’optimisation développé dans la première partie / The Dial a Ride Problem (DRP) is to take passengers from a place of departures to places of arrivals. Different versions of the dynamic Dial a Ride Problem are found in every day practice; transportation of people in low-density areas, transportation of the handicapped and elderly persons and parcel pick-up and delivery service in urban areas. In the DRP, customers send transportation requests to an operator. A request consists of a specified pickup location and destination location along with a desired departure or arrival time. The ultimate aim is to offer an alternative to displacement optimized individually and collectively. The DRP is classified as NP-hard problem that’s why most research has been concentrated on the use of approximate methods to solve it. Indeed the DRP is a multi-criteria problem, the proposed solution of which aims to reduce both route duration in response to a certain quality of service provided. In this thesis, we offer our contribution to the study and solving the DRP in the application using a multi agent system based on the Multi-Objective Simulated Annealing Algorithm

Problèmes de tournées de véhicules statiques et déterministes ne peuvent pas être utilisés dans de nombreux systémes de la vieréelle, du fait que les données d’entrée ne sont pas fiables et sont révélées au fil du temps. Dans cette thèse, nous étudions un problème de ramassage et de livraison avec fenêtres de temps et un maximum de temps de trajet - le problème dial-a-ride - dans sa variante statique et dynamique, et nous faisons des propositions spécifiques sur les modèles d’optimisation robustes pour résoudre ce problème. Pour résoudre le modèle statique, nous développons une approche branch-and-price qui gère toutes les contraintes detemps dans le processus de création d’itinéraires de véhicules. Notre travail est axé sur les techniques de résolution du sous-problème et d’accélération pour l’approche branch-and-price. Nos résultats numériques montrent que la méthode est compétitive par rapport aux approches existantes qui sont basées sur le branch-and-cut. Dans le contexte dynamique, où certaines données d’entrée sont révélées dynamiquement ou modifiées au fil du temps, nous appliquons notre algorithme branch-and-price pour la ré-optimisation dans une approche sur horizon glissant. / Static and deterministic vehicle routing problems cannot be used in many real-life systems, as input data are not reliable and revealedover time. In this thesis, we study a pickup and delivery problem with time windows accounting for maximum ride time constraints – the so-called diala- ride problem – in its static and dynamic variant, and we make specific proposal on robust optimization models for this problem. To solve the static model, we develop a branch-and-price approach that handles ride time constraints in the process of generating feasible vehicle routes in the course of the optimization procedure. Our work is focussed on the pricing problem solver and acceleration techniques for the branch-and-price approach. Our numerical results show that the method is competitive compared to existing approaches that are based on branch-and-cut. In the dynamic context, where some input data are revealed or modified over time, we apply our branchand- price algorithm for re-optimization in a rolling horizon approach.

Les travaux présentés dans cette thèse visent à proposer des méthodes permettant de résoudre un problème de Transport à la Demande multicritère. Le premier travail réalisé dans cette thèse est l'étude d'un problème de Dial-a-Ride (DARP) statique multicritère. Trois critères qui peuvent être conflictuels ont été définis : le premier consiste à minimiser le coût de transport, le deuxième critère consiste à minimiser l'insatisfaction des passagers et enfin le troisième critère consiste à minimiser la quantité de CO2 émise par l'ensemble des véhicules. Nous avons développé une méthode évolutionnaire NSGA-II pour chercher un ensemble approximatif d'optimas de Pareto. Le second travail réalisé est l'étude d'un problème d'Optimal Timing dans une tournée. Ce problème consiste à calculer les dates de début de service optimales des points d'arrêts d'une tournée afin de minimiser l'insatisfaction des passagers. Le dernier travail de cette thèse a porté sur l'étude d'un problème de Transport à la Demande dynamique dans lequel de nouvelles requêtes à traiter arrivent en cours de journée. Deux méthodes ont été proposées pour résoudre ce problème : la première est une heuristique d'insertion rapide et la seconde est une méthode arborescente tronquée connue sous le nom de Recovering Beam Search. / The work presented in this thesis aims to propose methods to solve a multicriteria dial-a-ride problem (DARP). Three objective functions that have to be optimized in order to measure the potential efficiency of the DARP solution on different aspects : the cost for the transportation operator, the quality of service for users and the impact on the environment. The first work in this thesis is the study of static DARP for which a NSGA-II algorithm is developped to identify a good approximation of the Pareto optimal set. The second work deals with an optimal timing algorithm which computes pickup and delivery dates when the requests are sequenced on the vehicles, the objective is to minimize the total customer' dissatisfaction. The last problem studied in this thesis aims to solve the dynamic version of DARP for which two methods are proposed. The first one is a fast insertion heuristic based on an attractive index. However, the second methode uses a recovering beam search heuristic which unlike the insertion heuristic allows to modify the structure of the routes previously scheduled in order to schedule the new requests.

Made available in DSpace on 2015-05-14T12:36:37Z (GMT). No. of bitstreams: 1 ArquivoTotalDaniel.pdf: 2752447 bytes, checksum: 5dbeb5dd6c935f25f004b1edb1df7d70 (MD5) Previous issue date: 2013-03-22 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Problems of traffic jam, lack of vacancies in garages and cars underutilized are part of the current scenario of big cities. In this work is created a module for creating efficient routes for a system using the approach Dial-a-Ride Problem. The DARP is a vehicle routing problem that belongs to NP-complete class. It aims is to minimize operating costs while maintaining quality of service to the client. It is presented an algorithm that uses the metaheuristics Iterated Local Search with the Variable Neighborhood Search to solve the DARP. Compared to related work in the area, the results were better regarding to distance traveled and average travel time of customers. / Problemas de congestionamentos, falta de vagas em garagens e carros subutilizados fazem parte do cenário atual das grandes cidades. Neste trabalho é criado um módulo para criação de rotas eficiente para sistemas de caronas utilizando a abordagem Dial-a-Ride Problem. O DARP é um problema de roteamento pertencente a classe NP-Completo. Este tem como objetivo minimizar os custos operacionais, mas mantendo uma qualidade de serviço para o usuário. É apresentado um algoritmo que utiliza as metaheurística Iterated Local Search juntamente com a Variable Neighborhood Search para solucionar o DARP. Comparados com outros trabalhos relevantes na área, os resultados encontrados foram melhores no que se refere à distância percorrida e no tempo médio de viagem dos clientes.

Diplomová práce se zabývá analýzou a výpočtem optimalizační úlohy z praxe. Jedná se o optimalizaci nočních linek vnitrostátní přepravy na území ČR. Cílem je nalezení řešení, které zefektivní organizaci těchto linek a usnadní práci lidí s nimi spojenou. Celý výpočet úlohy je inspirován okružním problémem s doručením a vyzvednutím (?Pickup and Delivery Problem?). Na výpočet problému jsou použity dva modely: model založený na hledání optimálního více produktového toku a model spočívající na výběru tras. Modely jsou založeny na rozdílných přístupech. Díky oběma modelům je možné si uvědomit, že na jednu optimalizační úlohu lze pohlížet z více stran a z obdržených výsledků si pak vytvořit ucelenější pohled na problém.