A Scatter Search for the periodic capacitated arc routing problem

Chu, Feng; Labadi, Nacima; Prins, Christian

doi:10.1016/j.ejor.2004.08.017

Cited by 93 publications

(83 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…First works on periodic CARPs were published by Lacomme et al [26] and by Chu et al [10]. Fleury et al [14] considered a variant of the CARP where the amount of waste which has to be collected is stochastic.…”

Section: Introductionmentioning

confidence: 99%

A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

et al. 2007

View full text Add to dashboard Cite

The capacitated arc routing problem (CARP) focuses on servicing edges of an undirected network graph. A wide spectrum of applications like mail delivery, waste collection or street maintenance outlines the relevance of this problem. A realistic variant of the CARP arises from the need of intermediate facilities (IFs) to load up or unload the service vehicle and from tour length restrictions. The proposed Variable Neighborhood Search (VNS) is a simple and robust solution technique which tackles the basic problem as well as its extensions. Particularly, it outperforms all known heuristics on four sets of benchmark instances.

show abstract

Section: Introductionmentioning

confidence: 99%

A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

et al. 2007

View full text Add to dashboard Cite

show abstract

“…To the best of our knowledge, there are only a few published papers that deal with periodic arc routing (Lacomme et al 2005;Chu et al 2005Chu et al , 2006. A related issue involves setting the collection frequency for different types of waste.…”

Section: Arc Routing Problemsmentioning

confidence: 99%

Combinatorial optimization and Green Logistics

Sbihi

Eglese

2007

4OR

186

View full text Add to dashboard Cite

show abstract

“…In CARP, each arc in the graph can be traveled in both direction and each vertex corresponds to a road junction (node). Some variants extensions on CARP also can be seen Lacomme et al (2005); Chu et al (2006) where periodic CARP (PCARP) was applied; Bautista et al (2008) and Christiansen et al (2009) solved mixed CARP (MCARP) and CARPSD respectively.…”

Section: Introductionmentioning

confidence: 99%

Implementation Weather-Type Models of Capacitated Arc Routing Problem via Heuristics

Ismail¹,

Ramli

2011

American Journal of Applied Sciences

View full text Add to dashboard Cite

Problem statement:In this study, we introduced a new and real-life condition of Capacitated Arc Routing Problem (CARP), a model that represents vehicle's operation in waste collection. In general, we studied the element of rain drops that affected the collected waste weight in total by imposed a new variable namely rainy weight age. In rainy days, the household refusals did not increase in volumes, but in weights due to rain drops. Consequently, this matter thus burdened vehicle's capacity and prolonged its operation time. This dynamic variable thus changes the initial CARP model where the existing model did not consider other external elements that have effected onto the model. Approach: Then we developed and enhanced CARP by integrating stochastic demand and time windows to suit the models with our specific case. Results: Objectively, CARP with stochastic demand (CARPSD) and CARP with time windows (CARPTW) were designed to minimize the total routing cost and number of trips for a vehicle. Our approach is to design CARP models in almost likely to road layout in residential area and graphically this model is called mesh network. We also developed a constructive heuristic that is called nearest procedure based on highest demand/cost (NPHDC) and work in conjunction with switching rules to search the feasible solution. Conclusion: Our preliminary results show a higher cost and more trips are needed when the vehicle operates in rainy day compared to normal day operation.

show abstract

A Scatter Search for the periodic capacitated arc routing problem

Cited by 93 publications

References 18 publications

A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

Combinatorial optimization and Green Logistics

Implementation Weather-Type Models of Capacitated Arc Routing Problem via Heuristics

Contact Info

Product

Resources

About