DCDaniel Silva Crepalde

Daniel Silva Crepalde

*This is an algorithmically generated author record based on publicly available information.

Daniel Silva Crepalde has a total of 6 co-authors. Here are the top co-authors by number of shared publications:

  • Abilio Augusto Marinho Oliveira

    Universidade Federal de São João Del-Rei -UFSJ Departamento de Tec. em Eng. Civil Computação e Humanidades Campus Alto Paraopeba Km 7 -Fazenda do Cadete Caixa Postal 131 MG-443 Rodovia

    1 shared publication
  • Eder Junio Silva

    Universidade Federal de São João Del-Rei -UFSJ Departamento de Tec. em Eng. Civil Computação e Humanidades Campus Alto Paraopeba Km 7 -Fazenda do Cadete Caixa Postal 131 MG-443 Rodovia

    1 shared publication
  • Felipe Augusto Lima Reis

    Centro Federal de Educação Tecnológica de MG -CEFET-MG Departamento de Computação Av. Amazonas Nova Gameleira -Belo Horizonte -MG -Brasil 7675

    1 shared publication
  • Marconi de Arruda Pereira

    Departamento de Tecnologias (DTECH), Universidade Federal de São João del Rei (UFSJ), Ouro Branco, Brazil

    1 shared publication
  • Matheus Patrocínio Souza

    Universidade Federal de São João Del-Rei -UFSJ Departamento de Tec. em Eng. Civil Computação e Humanidades Campus Alto Paraopeba Km 7 -Fazenda do Cadete Caixa Postal 131 MG-443 Rodovia

    1 shared publication
  • Paulo Eduardo Maciel Almeida

    Instituto de Telecomunicações, Departamento de Engenharia Electrotécnica e de Computadores, Universidade de Coimbra, 3030-290, Portugal

    1 shared publication

Latest Publications

  • Open Access

    OPTIMIZATION OF TAXI CABS ASSIGNMENT USING A GEOGRAPHICAL LOCATION-BASED SYSTEM IN DISTINCT OFFER AND DEMAND SCENARIOS

    by Matheus Patrocínio Souza, Abilio Augusto Marinho Oliveira, Marconi Arruda Pereira, Felipe Augusto Lima Reis, Paulo Eduardo Maciel Almeida, Eder Junio Silva, Daniel Silva Crepalde

    In this paper, diff erent approaches are evaluated to assign taxi cabs to customers in geographical location-based systems. The main purpose of this work is to identify the solution in which all current customers are met in an acceptable time, however minimizing the distance traveled by existing free taxi cabs. Two aspects are considered: 1) the method to calculate the distance between vehicles and customers; and 2) a vehicle assignment strategy. The methods to calculate the distance between vehicles and customers are: a GPS-based routing (a shortest path algorithm) and the Euclidean distance. On the other hand, as vehicle assignment approaches, the considered strategies are: a greedy algorithm, which assigns each vehicle to the closest customer, and an optimization algorithm, which assigns vehicles considering the whole scenario, minimizing the global distance traveled by taxi cabs to meet the customers. This last strategy considers an optimization model in such a way that the calls are not readily answered. In this case, a short waiting window is implemented, where the calls are stored and then the optimization algorithm is executed, in order to minimize the required distance and to meet all current customers. The combination of the two methods of distance calculation and the two vehicle assignment strategies formed four possible approaches, which are evaluated in a realistic simulator. We propose some diff erent traffi c scenarios, varying the amount of calls and available taxis in order to better evaluate the algorithms´ performance. Results show that the approach which uses the shortest path algorithm and an optimization algorithm reduces the average service time by up to 27.59%, and the average distance traveled by up to 45.79%.