An augmented sweep clustering method for inventory-routing problem with simultaneous pickup and delivery considering lateral transshipment between repair centers

In this paper, an inventory-routing problem for a network of appliance repair service is discussed including several repair depots and customers. The customer in this network makes a demand to have his/her faulty appliance repaired. Then, the repairman is assigned to the demand based on the skill needed for repairing of appliance differing for each one. The assigned repairman picks up the faulty appliance from the customer place using the vehicle for transferring faulty appliances to repair depot. The vehicle for picking up and delivering the appliances has a maximum capacity. Additionally, the repair depot needs spare parts to repair the faulty appliances that is supplied either by the supplier or lateral transshipment from the other depots. The capacitated vehicle inventory-routing problem with simultaneous pickup and delivery is NP-hard which needs special optimization procedure. Regarding the skill of repairman, it becomes more complex. Many solution approaches have been provided so far which have their pros and cons to deal with. In this study, an augmented angle-based sweep method is developed to cluster nodes for solving the problem. Finally, the heuristic is used in the main body of genetic algorithm with special representation.

کلیدواژه ها:

Vehicle Routing problem ، Heuristic ، Appliance repair service network ، Genetic algorithm