Abstract

As instâncias de benchmark disponíveis para as versões dinâmicas do problema de coleta e entrega com janelas de tempo (PDPTW - Pickup and Delivery Problem with Time Windows) e do problema dial-a-ride (DARP - Dial-A-Ride Problem) não compartilham as mesmas características e não necessariamente cobrem todas as características de situações reais. Analisa-se conjuntos de instâncias de PDPTW e DARP dinâmicos (DPDPTW e DDARP) atualmente disponíveis para uso e os métodos usados para gerá-los a partir de instâncias estáticas. Cada método de dinamização é aplicado a cada instância estática originalmente usada por eles. As instâncias dinâmicas resultantes são analisadas com as medidas de grau de dinamismo e urgência, bem como pelo número de pedidos estáticos e a correlação entre os limites inferiores das janelas de tempo de coleta e os instantes de chegada dos pedidos. Os resultados mostram que os conjuntos estudados apresentam baixa variabilidade de grau de dinamismo e urgência independentemente do método ou da instância estática usados para a dinamização.

Highlights

  • Dynamic vehicle routing problems have been the subject of research for nearly three decades (Psaraftis et al, 2015)

  • FORMAL DEFINITION OF DYNAMIC PROBLEMS This section presents the formal de6initions of the dial-aride problem (DARP), the pickup and delivery problem with time windows (PDPTW), the dynamic dial-a-ride problem (DDARP) and the DPDPTW based on Cordeau and Laporte (2003)

  • We present the sets of dynamic benchmark instances of the DDARP and the DPDPTW and the dynamization methods used to derive them from static benchmark instances

Read more

Summary

INTRODUCTION

Dynamic vehicle routing problems have been the subject of research for nearly three decades (Psaraftis et al, 2015). (Dumas et al, 1991) are of great interest for the development of new urban transport technologies These are the problems that need to be solved when a dynamic ride-sharing service is needed (Agatz et al, 2012; Alonso-Gonzá lez et al, 2018), or when timely parcel delivery is required (Pankratz, 2005). With the expected technological advances in the area of connected vehicles, automated driving and the diversi6ication of public transport introduced mainly by mobility as a service (MaaS) systems, algorithms for solving DDARPs and DPDPTWs in less time and providing a better result are increasingly necessary (Fulton et al, 2017). Each method is applied to different sets of static instances and the degree of dynamism and urgency of the resulting dynamic instances are evaluated.

FORMAL DEFINITION OF DYNAMIC PROBLEMS
DDARP and DPDPTW
SETS OF BENCHMARK INSTANCES AND DYNAMIZATION METHODS
ANALYSES OF BENCHMARK INSTANCES AND DYNAMIZATION METHODS
Degree of dynamism
Urgency
Findings
CONCLUDING REMARKS
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call