Navegação por Assunto "Iterated local search"

Resultados 1-3 de 3

    • Automatic algorithm configuration for flow shop scheduling problems 

      Brum, Artur Ferreira (2020) [Tese]
      Scheduling problems have been a subject of interest to the optimization researchers for many years. Flow shop problems, in particular, are one of the most widely studied scheduling problems due to their application to many ...

    • OPtimizing solutions for the pickup and delivery problem 

      Sartori, Carlo Sulzbach (2016) [Trabalho de conclusão de graduação]
      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) [Trabalho de conclusão de graduação]
      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 ...