Approximation algorithms for solving the constrained arc routing problem in mixed graphs

2014 ◽  
Vol 239 (1) ◽  
pp. 80-88 ◽  
Author(s):  
Honglin Ding ◽  
Jianping Li ◽  
Ko-Wei Lih
Keyword(s):  
Approximation Algorithms ◽  
Arc Routing ◽  
Routing Problem ◽  
Mixed Graphs

A Scatter Search for the periodic capacitated arc routing problem

2006 ◽  
Vol 169 (2) ◽  
pp. 586-605 ◽  
Author(s):  
Feng Chu ◽  
Nacima Labadi ◽  
Christian Prins
Keyword(s):  
Scatter Search ◽  
Arc Routing ◽  
Routing Problem ◽  
Capacitated Arc Routing Problem ◽  
Capacitated Arc Routing

scholarly journals A branch-and-cut algorithm for the Orienteering Arc Routing Problem

2016 ◽  
Vol 66 ◽  
pp. 95-104 ◽  
Author(s):  
Claudia Archetti ◽  
Ángel Corberán ◽  
Isaac Plana ◽  
José M. Sanchis ◽  
M. Grazia Speranza
Keyword(s):  
Branch And Cut ◽  
Arc Routing ◽  
Routing Problem

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