Ant Colony Algorithm for Waste Collection Vehicle Arc Routing Problem with Turn Constraints

2012 ◽  
Author(s):  
Jie Liu ◽  
Yanfeng He
Keyword(s):  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Arc Routing ◽  
Waste Collection ◽  
Routing Problem

scholarly journals Open capacitated arc routing problem by hybridized ant colony algorithm

2021 ◽  
Author(s):  
Bilal Kanso ◽  
Ali Kansou ◽  
Adnan Yassine
Keyword(s):  
Ant Colony Algorithm ◽  
Search Algorithm ◽  
Ant Colony ◽  
Arc Routing ◽  
Local Search Algorithm ◽  
Routing Problem ◽  
Capacitated Arc Routing Problem ◽  
Cost Distance ◽  
Benchmark Instances ◽  
Capacitated Arc Routing

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 a given service area at a minimal cost distance. The main real application for OCARP is the Meter Reader Routing Problem (MRRP). In MRRP problem, each worker in the electric (or gas) company must visit and read the electric (or gas) meters to a set of customers by starting his route from the first customer on his visit list and finishing with the last one. The worker leaves where he wants once all the associated customers have been visited. In this paper, a meta-heuristic called an Hybridized Ant Colony Algorithm (HACA) is developed and hybridized with a local search algorithm that involves the 2-opt, Swap, Relocate and Cross-exchange moves to solve OCARP problem. Computational results conducted on five different sets of OCARP-instances showed that our proposed algorithm HACA has reached good and competitive results on  benchmark instances for the problem.

scholarly journals Quantum Max-min Ant Colony Algorithm For QoS Routing Problem

2021 ◽  
Vol 1827 (1) ◽  
pp. 012163
Author(s):  
Yalong Li ◽  
Wang Wei ◽  
Sun Jing ◽  
Wan Jie
Keyword(s):  
Ant Colony Algorithm ◽  
Qos Routing ◽  
Ant Colony ◽  
Routing Problem

scholarly journals A hybrid ant colony algorithm based on multiple strategies for the vehicle routing problem with time windows

2021 ◽  
Author(s):  
Hongguang Wu ◽  
Yuelin Gao ◽  
Wanting Wang ◽  
Ziyu Zhang
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Time Window ◽  
Time Windows ◽  
Ant Colony ◽  
Routing Problem ◽  
Multiple Strategies ◽  
Hard Time ◽  
Mutation Operation

AbstractIn this paper, we propose a vehicle routing problem with time windows (TWVRP). In this problem, we consider a hard time constraint that the fleet can only serve customers within a specific time window. To solve this problem, a hybrid ant colony (HACO) algorithm is proposed based on ant colony algorithm and mutation operation. The HACO algorithm proposed has three innovations: the first is to update pheromones with a new method; the second is the introduction of adaptive parameters; and the third is to add the mutation operation. A famous Solomon instance is used to evaluate the performance of the proposed algorithm. Experimental results show that HACO algorithm is effective against solving the problem of vehicle routing with time windows. Besides, the proposed algorithm also has practical implications for vehicle routing problem and the results show that it is applicable and effective in practical problems.

scholarly journals Heuristics for Waste Collection Arc Routing Problem

MENDEL ◽  
2019 ◽  
Vol 25 (1) ◽  
pp. 15-22
Author(s):  
Vlastimír Nevrlý ◽  
Radovan Šomplák ◽  
Pavel Popela
Keyword(s):  
Arc Routing ◽  
Waste Collection ◽  
Traffic Light ◽  
Exact Methods ◽  
Routing Problem ◽  
Real Practice ◽  
The Mathematical Model ◽  
Route Scheduling ◽  
Municipal Level

Waste management is still an expanding eld which needs to be constantly enhanced so that waste transportation and treatment is as eective as possible. An important part of this process is a waste collection at the municipal level. Decision-making about daily routing for all vehicles from a heterogenous eet substantially in uences the expenses of technical services. The need of route scheduling comes also from the newly separated fractions. Transportation features include the capacity of vehicles, number and type of containers on the route, traffic light delays and many others. The mathematical model that properly describes the real practice of servicing containers has not been published yet. Moreover, routing problemsare generally not solvable by exact methods, so the appropriate heuristic algorithm has been developed. A case study with obtained results is discussed. This solution serves not only to improve the current operational situation, but also to create new route schedules for increasing number of collected commodities. 

Sign in / Sign up

Export Citation Format

Share Document