[PDF] Top 20 A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints

... an exact algorithm for the multi-depot vehicle routing problem (MDVRP) under capacity and route length ...a vehicle-flow and a ... See full document

... location routing problem with intermediate replenishment facilities (LRPIRF), an extension of the location routing problem (LRP), where the vehicles can replenish at some intermediate ...the ... See full document

... a new version of the problem – denoted as VSP with Route and Fueling Time Constraints (VSPRFTC) – was presented in which they consider electric ...two new constraints: the ... See full document

... the vehicle, fuel consumption and shortage as the first objective function and minimizing the shortage of products ...one route. Eq. (4) guarantees whether vehicle v enter in node c, it should leave ... See full document

... the route of a vehicle could be composed of multiple stops at intermediate depots in order for the vehicle to be ...central depot, the one each vehicle starts from and ends at, are set ... See full document

... In New Orleans, over 1,400 people were killed during Hurricane Katrina, mostly due to lack of efficient transportation and proper emergency evacuation planning ...the New Orleans region and dispatch systems ... See full document

... The routing process is considered when the route duration and vehicle capacity conditions are not violated while appending the customer to the present route and it is sustained till ... See full document

... A multi-objective evolutionary algorithm is used for CVRP (Borgulya Istvan, ...solved vehicle routing problem, minimized transportation cost and recombined a new problem ... See full document

... Genetic Algorithm (GA) is one of the methods of Meta- heuristic ...Meta-heuristic algorithm finds solutions in less computational time for routing ...Search Algorithm for the Multi ... See full document

... The Vehicle Routing Problem ( VRP ) , proposed by Dantzig and Ramser [ 1 ] , is an important re- search area in operation search given its impor- tance in logistic ...Capacitated Vehicle ... See full document

... The Vehicle Routing Problem (VRP) is a classic combinatorial optimization problem of great scientific interest in the field of Operations Research due to its high economic impact and its ... See full document

... constrained routing and scheduling problems in ...the vehicle routing problem with soft time ...for multi-objective vehicle routing problem with soft time ...a ... See full document

... distance. Constraints (2) and (3) ensure that from any node except depot just one route ...passes. Constraints (4) and (5) denote the number of vehicles leaving the depot must equal the ... See full document

... complicated problem. We refer to [30], [31] for exact, heuristic and metaheuristic algorithms, and to [2] for recent exact algorithms applied to the ...related problem also frequently seen in ... See full document

... reactive routing protocol employing the current topology of traffic for identifying its ...of routing as it includes a destination sequence number for identifying paths that are more ...the new ... See full document

... a routing algorithm, such as routing metric and route recovery ...mechanism. Routing metric, that is the standard to choose next hop, is studied in another research work of ours ...the ... See full document

... a Vehicle Routing Problem ...location-allocation problem in the warehouse, Multiple Depot Vehicle Routing Problem (MDVRP) at the distribution level, and customer ... See full document

... the problem becomes more complex, and different tree based solutions are proposed [12] [13] [14] ...(MCM) problem aims to compute a sub-graph M = ( { } s D , , H ) that contains a feasible path from the ... See full document

... to route selection/allocation ...ALNS algorithm first selects a method to remove a number of tasks from a ...no route selector is applied, this means that potentially a task can be planned in a ... See full document

... James Kennedy reviewed the PSO concept and introduced a new form of particle swarm optimizer [9]. They examined how changes in the procedure affect the number of iteration required to meet an error criterion, and ... See full document