An optimized genetic algorithm engine for solving large-scale Travelling Salesman Problem instances with custom mutation, crossover, and hyper-parameter tuning.

Pull requests help you collaborate on code with other people. As pull requests are created, they’ll appear here in a searchable and filterable list. To get started, you should create a pull request.

This paper deals with the two-dimensional strip packing problem (2D-SPP) with the order/or multi-drop and vertical stability constraints. The existing exact algorithm that solves this problem is not ...

ABSTRACT: Time-cost trade off problem (TCTP), known in the literature as project crashing problem (PCP) and project speeding up problem (PSP) is a part of project management in planning phase. In this ...

Abstract: Optimization problem is which mainly focuses on finding feasible solution out of all possible solutions. Travelling salesman problem belongs to this one. As it is not possible to find its ...

Abstract: The traveling salesman problem is difficult to solve by traditional genetic algorithms because of the requirement that each node must be visited exactly once. In response to this critical ...