A multi-facility AGV location-routing problem with uncertain demands and planar facility locations

Abstract

The Location Routing Problem (LRP), Automatic Guided Vehicle (AGV), and Uncertainty Planner Facility (UPF) in Facility Location Problems (FLP) have been critical. This research proposed the role of LRP in Intelligence AGV Location–Routing Problem (IALRP) and energy-consuming impact in CMS. The goal of problem minimization dispatching opening cost and the cost of AGV trucking. We set up multi-objective programming. To solve the model, we utilized and investigate the Imperialist Competitor Algorithm (ICA) with Variable Neighborhood Search (VNS). It is shown that the ICAVNS algorithm is high quality effects for the integrated LRP in AGVs and comparison, with the last researches, the sensitivity analysis, and numerical examples imply the validity and good convexity of the purposed model according to the cost minimization.

Keywords

• location-routing
• automatic guided vehicle
• stochastic programming
• uncertainty
• meta-heuristic algorithms