This paper presents a comparative study of the Floyd-Warshall (FW) algorithm and the Simulated Annealing (SA) heuristic for solving shortest path problems in static and dynamic traffic-based graphs.

Transportation significantly impacts urban energy consumption and environmental sustainability, making optimization critical. Quantum computing provides a promising approach to improving ...

In this paper, we address an interesting variant of the vehicle routing problem with time windows (VRPTW) faced by the China National Petroleum Corporation (CNPC). The CNPC owns a limited number of ...

This paper describes a Savings Based algorithm for the Extended Vehicle Routing Problem. This algorithm is compared with a sequential insertion algorithm on real-life data. Besides the traditional ...

Discover what black box models are, their applications in finance and investing, and examples of how they drive decision-making without revealing internal processes.