[PDF] Top 20 On a capacitated multivehicle routing problem

... Vehicle Routing Problem (VRP) is a combinatorial optimization problem with applications to diverse areas such as resource allocation, load balancing, and sensor ...this problem has been widely ... See full document

... Vehicle Routing Problem (VRP) is one of the well-known NP hard problems requiring excessive time to be exactly ...the Capacitated VRP (CVRP) which has some constraints on the capacities of the ... See full document

... a problem of a distribution ...vehicle routing problem (VRP). This optimization problem is to specify a homogeneous set of vehicles and routes, in which each vehicle starts from a depot and ... See full document

... [40] proposed a cooperative approach, which com- bines the Lagrangean relaxation and granular tabu search (GTS), to solve the CLRP. The algo- rithm alternates between a location sub-problem, solved by Lagrangean ... See full document

... The VRP is a very important NP-hard optimization problem that arises in the management of smart cities. Several variants of EAs have shown great promise in dealing with the VRP. However, when dealing with ... See full document

... two-echelon capacitated vehicle routing problem (2E-CVRP) that accounts for vehicle type, traveled distance, vehicle speed, load, multiple time zones and ...two-echelon capacitated vehicle ... See full document

... such as wireless sensor network [18], power system optimization [19], motor control [20], production scheduling [21] and so on. In the above, the PSO algorithm can produce a better performance than other conventional ... See full document

... the Capacitated Vehicle Routing Problem (CVRP) is analyzed, which can be described in a simple way, such as a fleet of vehicles with homogeneous capacities that have to satisfy the uniformly ... See full document

... In this paper, a particle swarm optimization with adaptive multi-swarm strategy (AMSPSO) is proposed to solve a capacitated vehicle routing problem with pickups and deliveries (CVRPPD). The proposed ... See full document

... significantly enhance the performance of traditional single-start simulated annealing algorithm. Wang and Li [Wang and Li, 2017] studied on a low carbon for LRP with heterogeneous fleet, simultaneous pickup- delivery and ... See full document

... The first objective function (1) minimizes the total cost consisting of the sum of depot opening costs, routing costs and vehicles using fixed costs. The second objective function (2) minimizes the total risk ... See full document

... Abstract: In this paper a new genetic algorithm is developed for solving capacitated vehicle routing problem (CVRP) in situations where demand is unknown till the beginning of the trip. In these ... See full document

... Fleet Capacitated Vehicle Routing Problem with Time Windows and Three- Dimensional Loading Constraints (3L-HFCVRPTW) combines the aspects of 3D loading, het- erogeneous transport with capacity ... See full document

... both problem domains (exam timetabling and capacitated vehicle routing problems), GE-HH obtained competitive results, if not better (on some instances), when compared against existing best methods in ... See full document

... Constructive heuristics build feasible solutions partially. Many works have been proposed be- longing to that class, for example: the Nearest Neighborhood Heuristic ( NNH ) in which addi- tional nodes are added at each ... See full document

... the problem of self- calibration of a moving camera whose intrinsic parameters are known, except the focal length, which can vary freely between different ... See full document

... Incremental ETL is associated to near real time ETL. In one hand, the historical and business contexts of this category of ETL are sketched in [3] where authors motivate and explain why this new category of ETL. In other ... See full document

... due to designer’s considerations, AD can be implemented using a simple comparator. Dynamic power consumption of CMOS logic gates is a strong function of the switching activities on the internal node capacitances. In the ... See full document

... The Contention-aware Admission Control Protocol (CACP) [6] calculates the contention count using two phases that are used for the route discovery by reactive routing protocols. In the request phase each node ... See full document

... Capacitated Clustering Vehicle Routing Problem (CCVRP) deals with a single depot collection system servicing a set of customers by means of a homogeneous fleet of vehicles. The vehicles leave the ... See full document