IEEE

Enhancing Genetic Algorithm Efficiency: A Comparative Study of Serial and Parallel Computation for TSP

Abstract: The Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem with applications in logistics, transportation, and network design. Traditional approaches, ...
IEEE

Research on M-TSP Problem Based on the Hybrid Genetic Swarm Algorithm

Abstract: For the multi-vehicle path optimization problem in automotive logistics and transportation, the traditional genetic algorithm is difficult to meet the efficient distribution needs of ...
GitHub

PDF Diff Viewer, a side-by-side, visual highlight, sync-scroll, PDF comparer, written in Python. Open source, mostly powered by PyMuPDF and Tkinter. Optional support for git ...

Windows binaries are provided; while no installation is needed, you need to decompress everything and then run "pdf_viewer_app.exe" within the folder "pdf_viewer_app". Make sure you have writing ...
GitHub

GitHub - arnobt78/Vehicle-Routing-Problem-Time-Windows-Solver-Comparison--VRPTW-Python-React: A comprehensive Python implementation comparing multiple metaheuristic algorithms ...

A comprehensive Python implementation comparing multiple metaheuristic algorithms for solving the Vehicle Routing Problem with Time Windows (VRPTW). It provides a detailed comparison of four ...