arc routing problem
The Periodic Capacitated Arc Routing Problem with Mobile Disposal Sites Specified for Waste Collection
... capacitated arc routing problem (PCARP)in mobile disposal sites is described and the authors seek to determine the optimal routes of required edges (streets or alleys) per week, number and location ...
13
Genetic programming hyper heuristic with vehicle collaboration for uncertain capacitated arc routing problem
... Capacitated Arc Routing Problem (UCARP) is an important optimisation ...solving routing problems under uncertainty, very few have considered UCARP, and none consider collaboration between ...
30
A deterministic tabu search algorithm for the capacitated arc routing problem
... capacitated arc routing problem (CARP) is a difficult optimisation problem in vehicle routing with applications where a service must be provided by a set of vehicles on specified ...
15
A novel heuristic method to solve the capacitated arc routing problem Pages 767-776 Download PDF
... capacitated arc routing problem is one of the most important routing problems with many applications in real world situations such as snow removing, winter gritting, refuse collection, ...this ...
10
Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: A waste collection application
... capacitated arc routing problem ...the problem, a hybrid metaheuristic algorithm is developed based on a simulated annealing algorithm and a heuristic ...
16
A Hybrid Ant Colony Optimization Algorithm using MapReduce for Arc Routing Problem
... data, arc cluster data and arc priority data, is continuously extracted from the solutions obtained throughout the search and is employed to guide the next improvement ...
5
A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem (CARP)
... If the number of nodes were less than or equal to six, then the heuristic was not applied and the optimum solution was found by complete enumeration. Tests were carried out to see what effect the use of this procedure ...
21
Capacitated arc routing problem with time window in solid waste operation
... Given the inherent computational difficulty of the routing problem, a variety of heuristics have been reported e.g. [9], [10] and [11], mostly for the hard time window. We implemented nearest procedure in ...
10
OPTIMIZING ROUTING OF RESIDENTIAL SOLID WASTE COLLECTION: CASE STUDY OF CHIKOVA RESIDENTIAL AREA IN ZIMBABWE
... the problem of being trapped in a local ...capacitated arc routing problem by replacing each edge with two arcs creating a directed formulation of the capacitated arc routing ...
18
Mathematical formulation of tabu search in combinatorial optimization
... on routing problem to understand the scenario of the ...Salesman Problem (TSP), Capacitated Arc Routing Problem (CARP) or Vehicle Routing Problem ...our ...
136
Constructive heuristics for weather-type models of capacitated arc routing problems in waste collection
... increase to double drastically and can easily exceed the truck capacity during rainy day operation. The load reaches capacity W faster during rainy days because of the waste weight is increases in the same relation. ...
48
Modeling the Capacitated-Time Windows Vehicle Routing Problem with the Existence of Closed Route
... Logically, a model whereby an algorithm identifies a potential path, and then this path is tried out on the actual network. In case of failure, further tests can be done to pinpoint a minimal closed subpath. Because such ...
5
The electric vehicle routing problem with backhauls Pages 131-152 Download PDF
... a problem of current interest that occurs in transport companies with fleets of electric vehicles that collect and deliver goods to ...a problem of greater complexity and much more restricted when it comes ...
22
Z-Dijkstra’s Algorithm to solve Shortest Path Problem in a Z-Graph
... 25. Deng, Yong., Chen, Yuxin., Zhang, Yazuman., and Mahadevan, Sankaran., Fuzzy Dijkstra Algorithm for Shortest Path Problem under uncertain environment, Applied Soft Computing, 12(3) 2012, pp. 1231-1237. 26. ...
7
Subset selection routing : modelling and heuristics : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Operations Research at Massey University
... the problem would change, as the number of vehicles used could become a decision variable or issues of feasi bility of the allowed vehicle routes could become more important than the selection ...the ...
496
Online Full Text
... IV. A D ECOMPOSITION A LGORITHM FOR VRP As the mathematical formulation shown in the previous section, exact method which gives the optimization solution is one of the choices in solving the problem. However, VRP ...
6
OPTIMIZING HETEROGENEOUS FLEETVEHICLE ROUTING PROBLEM
... vehicle routing problem incepted 45 years ...vehicle routing problem , which takes into consideration for constraints for example, length of routes and capacity of vehicles , have been ...
10
Cooperated Routing Problem for Ground Vehicle and
... Salesman Problem (TSP) and Vehicle Routing Problem (VRP) are both typical circulation problems.. 139.[r] ...
26
The Vehicle routing problem with a volunteer workforce
... Non-profit organizations like the Meals on Wheels association of America rely on a volunteer workforce to prepare and deliver meals to approximately one million homebound citizens nation- wide. At the community level, ...
92
Understanding Network Routing Problem and Study of Routing Algorithms and Heuristics through Implementation
... Distance-vector routing protocols use the Bellman–Ford algorithm, Ford–Fulkerson algorithm, or DUAL FSM (in the case of Cisco Systems's protocols) to calculate ...distance-vector routing protocol requires ...
6