Listar Tesinas Ciencia de la Computación por tema "Iterated local search"

Mostrando ítems 1-2 de 2

    • OPtimizing solutions for the pickup and delivery problem 

      Sartori, Carlo Sulzbach (2016) [Tesinas de grado]
      Pickup and Delivery Problems are a variation of Vehicle Routing Problems that arise in many real-world transportation scenarios, such as product delivery and courier services. This work studies the Pickup and Delivery ...

    • Solving the dial-a-ride problem using iterated local serach 

      Medeiros, Pedro Gabriel de Souza Vereza (2016) [Tesinas de grado]
      The Dial-a-Ride Problem (DARP) is an NP-hard combinatorial problem. The DARP is a variant of the Vehicle Routing Problem (VRP), focusing in the transportation of passengers. It consists in, given a set of requests for ...