1. Ant colony optimization, genetic algorithm and hybrid metaheuristics: A new solution for parallel machines scheduling with sequence-dependent set-up times

Mahdi Nakhaeinejad

Volume 7, Issue 2 , Summer and Autumn 2020, , Pages 223-239

http://dx.doi.org/10.22116/jiems.2020.206474.1310

Abstract
  The parallel machine scheduling problem (PMSP) is one of the most difficult classes of problem. Due to the complexity of the problem, obtaining optimal solution for the problems with large size is very time consuming and sometimes, computationally infeasible. So, heuristic algorithms that provide near-optimal ...  Read More

2. Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization

M. Sayyah; H. Larki; M. Yousefikhoshbakht

Volume 3, Issue 1 , Winter and Spring 2016, , Pages 15-38

Abstract
  One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) ...  Read More