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...

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...

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...

The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...

Contemporary vehicle routing requires ubiquitous computing and massive data in order to deal with the three aspects of transportation such as operations, planning and safety. Out of the three aspects, safety is the most vital and this study refers safety as the reduction of CO2 emissions and hazardous risks. Hence, this paper presents a data driven multi-objective differential evolution (MODE) ...

In the capacitated arc routing problem with multiple centers (M-CARP) the objective is to ®nd routes starting from the given depots or centers such that each required arc is served, capacity (and usually additional) constraints are satis®ed and total travel cost is minimized. In this paper we consider a heuristic transformation of the M-CARP into a multiple center capacitated minimum spanning t...

It is well-known that the tight lower bounds determine the effectiveness of the brancn and bound method for the NP-hard problems. In this paper, we present a new lower bounding procedure for the capacitated arc routing problem (CARP), one of the arc routing problems. They give the tight lower bounds and it is easy to develop an exact algorithm usinl~ their network structures.

This article addresses a general tri-objective two-echelon capacitated vehicle routing problem (2E-CVRP) to minimize the total travel cost, customers waiting times and carbon dioxide emissions simultaneously in distributing perishable products. In distributing perishable products, customers’ satisfaction is very important and is inversely proportional to the customers waiting times. The propose...