Recent results on Arc Routing Problems: An annotated bibliography

Corberán, Ángel; Prins, Christian

doi:10.1002/net.20347

Cited by 69 publications

(42 citation statements)

References 135 publications

(187 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As it was mentioned, there are many applied metaheuristics presented in order to solve the optimization problems similar to the research problem [44][45][46][47][48][49]. Since the applicability and the robustness of the GA algorithms have been proved and it has generated appropriate solutions for CARPs in the literature [50][51][52][53][54], GA is proposed as the main algorithm for the current research.…”

Section: Hybrid Genetic Algorithm (Hga)mentioning

confidence: 99%

A Hybrid Genetic Algorithm for Multi-Trip Green Capacitated Arc Routing Problem in the Scope of Urban Services

et al. 2018

View full text Add to dashboard Cite

Greenhouse gases (GHG) are the main reason for the global warming during the past decades. On the other hand, establishing a well-structured transportation system will yield to create least cost-pollution. This paper addresses a novel model for the multi-trip Green Capacitated Arc Routing Problem (G-CARP) with the aim of minimizing total cost including the cost of generation and emission of greenhouse gases, the cost of vehicle usage and routing cost. The cost of generation and emission of greenhouse gases is based on the calculation of the amount of carbon dioxide emitted from vehicles, which depends on such factors as the vehicle speed, weather conditions, load on the vehicle and traveled distance. The main applications of this problem are in municipalities for urban waste collection, road surface marking and so forth. Due to NP-hardness of the problem, a Hybrid Genetic Algorithm (HGA) is developed, wherein a heuristic and simulated annealing algorithm are applied to generate initial solutions and a Genetic Algorithm (GA) is then used to generate the best possible solution. The obtained numerical results indicate that the proposed algorithm could present desirable performance within a suitable computational run time. Finally, a sensitivity analysis is implemented on the maximum available time of the vehicles in order to determine the optimal policy.

show abstract

Section: Hybrid Genetic Algorithm (Hga)mentioning

confidence: 99%

A Hybrid Genetic Algorithm for Multi-Trip Green Capacitated Arc Routing Problem in the Scope of Urban Services

et al. 2018

View full text Add to dashboard Cite

show abstract

“…In [3] the min-max k-vehicles windy rural postman is treated. General references for arc routing are [7,8].…”

Section: Surveymentioning

confidence: 99%

Heuristics for the weighted k-rural postman problem with applications to urban snow removal

Holmberg

2018

J Veh Routing Algorithms

View full text Add to dashboard Cite

We describe a weighted version of the k-Chinese and k-rural postman problem that occurs in the context of snow removal. The problem concerns the questions of which vehicle shall take care of each link and how the vehicles shall travel between links. We also consider different numbers of vehicles, in view of a fixed cost for each vehicle. We describe and discuss heuristic solution approaches, based on usable substructures, such as heuristics for rural postman problems, meta-heuristics, k-means clustering and local search improvements by moving cycles. The methods have been implemented and tested on real life examples.

show abstract

“…Other ARP applications include, for example, the routing of postmen, meter readers and power line inspectors. For a review of ARPs the reader is referred to Corberán and Prins (2010);Wøhlk (2008);Dror (2000);and Eiselt et al (1995a,b).…”

Section: Midfield-estatementioning

confidence: 99%

Applying min–maxkpostmen problems to the routing of security guards

Willemse¹,

Joubert

2012

Journal of the Operational Research Society

View full text Add to dashboard Cite

The most essential and alluring characteristic of a security estate is the estate's ability to provide 24-hour security to its residents, of which the continual patrolling of roads and paths is vital. The objective of this paper is to address the lack of sufficient patrol route design procedures by presenting a tabu search algorithm capable of generating multiple patrol routes for an estate's security guards. The paper shows that the problem of designing these routes can be modelled as an Arc Routing Problem, specifically as min-max k postmen problems. The algorithm is illustrated with a real problem instance from an estate in Gauteng, South Africa. The patrol routes generated by the algorithm provide a significant improvement in the even patrolling of the road network, and a more balanced work distribution among guards. The algorithm is also tested on several benchmark problems from literature.

show abstract

Recent results on Arc Routing Problems: An annotated bibliography

Cited by 69 publications

References 135 publications

A Hybrid Genetic Algorithm for Multi-Trip Green Capacitated Arc Routing Problem in the Scope of Urban Services

A Hybrid Genetic Algorithm for Multi-Trip Green Capacitated Arc Routing Problem in the Scope of Urban Services

Heuristics for the weighted k-rural postman problem with applications to urban snow removal

Applying min–maxkpostmen problems to the routing of security guards

Contact Info

Product

Resources

About