Logistics is no longer seen as tactical and cost-driven – it is strategic. Considering the driver-on-time rules and with the perishable nature of the products, the travel length/time is one of the critical constraints in distribution logistics. We consider a typical logistics problem with...

Generalised assignment problem (GAP) is a well-known non-deterministic polynomial (NP) hard combinatorial optimisation problem to find the minimum cost during assignment of jobs to agents so that each job is assigned exactly once and agents are not overloaded. In this research, we look at the...

Generalised assignment problem (GAP) is a well-known non-deterministic polynomial (NP) hard combinatorial optimisation problem to find the minimum cost during assignment of jobs to agents so that each job is assigned exactly once and agents are not overloaded. In this research, we look at the...