The uncertain capacitated arc routing problem is an important optimization with many real-world applications. Genetic programming considered a promising hyper-heuristic technique to automatically evolve policies that can make effective real-time decisions in environment. Most existing research on genetic for the only focused test performance aspect. As result, evolved by are usually too large a...

We present an adaptation of the active-guided evolution strategies metaheuristic for the capacitated vehicle routing problem. The capacitated vehicle routing problem is a classical problem in operations research in which a set of minimum total cost routes must be determined for a fleet of identical capacitated vehicles in order to service a number of demand or supply points. The applied metaheu...

Mixed Capacitated Arc Routing Problem (MCARP) models arise in distribution or collecting problems where activities are performed by vehicles, with limited capacity, and are continuously distributed along some predefined links (routes, streets) of an associated network. Considering directed as well as undirected required links, it is a generalization of the well known Capacitated Arc Routing pro...

The Open Capacitated Arc Routing Problem OCARP is a well-known NP-hard real-world combinatorial optimization problem. It consists of determining optimal routes for vehicles in given service area at minimal cost distance. main real application the Meter Reader (MRRP). In MRRP problem, each worker electric (or gas) company must visit and read meters to set customers by starting his route from fir...

Location-Routing Problem (LRP) emerges as one of the hybrid optimization problems in distribution networks in which, total cost of the system would be reduced significantly by simultaneous optimization of locating a set of facilities among candidate locations and routing vehicles. In this paper, a mixed integer linear programming model is presented for a two-echelon location-routing problem wit...