SOLVING VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERY AND PICK-UP USING AN ALGORITHM BASED ON BACTERIAL FORAGING OPTIMIZATION

In vehicle routing problem with simultaneous delivery and pick-up (vrp_sdp), each customer has both delivery and pick-up demand simultaneously. vrp_sdp is very difficult combinatorial optimization problem. for this reason, in recent years, it is observed studies focused on metaheuristic methods. in this study, a heuristic solution approach based on bacterial foraging optimization algorithm (bfoa) has been improved and its performance has been evaluated. in the scope of this study vrp_sdp has been solved in order to minimize the total distanced travelled and the results have been tested with the insertion based heuristic that is known in the literature. bfoa obtained good solutions about 24 problems of 40 test problems.