Lower bounds for the mixed capacitated arc routing problem

Gouveia, Luís; Mourão, Maria Cândida; Pinto, Leonor Santiago

doi:10.1016/j.cor.2009.06.018

Cited by 35 publications

(28 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Computational experiments were conducted with the MCARP instances also used in Belenguer et al (2006) and Gouveia et al (2010), named lpr and mval. The instances characteristics are displayed in Table 2 and in Table 3.…”

Section: Test Instancesmentioning

confidence: 99%

“…The MCARP lower bound (LbF ) is computed using the MIP solver with the models by Gouveia et al (2010), within a time limit of two hours.…”

Section: U B−lb Lbmentioning

confidence: 99%

“…This is the case of household waste collection (see e.g. Ghiani et al (2005); Mourão and Amado (2005); Belenguer et al (2006); Bautista et al (2008); Mourão et al (2009) ;Gouveia et al (2010)), or road network maintenance (see e.g. Amaya et al (2007)).…”

Section: Introductionmentioning

confidence: 99%

“…After the literature review (Section 2), the relevant notation is presented in Section 3.1. Next, in Section 3.2 we review a model for the MCARP from Gouveia et al (2010) which will be used as a backbone to model the more restrictive version of the MCARP here studied. In Section 3.3 we describe a variant where we want to minimize the number of shared nodes, named as the non overlapping MCARP (NOMCARP).…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

The mixed capacitated arc routing problem with non-overlapping routes

Constantino

Gouveia

Mourão

et al. 2015

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

Real world applications for vehicle collection or delivery along streets usually lead to arc routing problems, with additional and complicating constraints. In this paper we focus on arc routing with an additional constraint to identify vehicle service routes with a limited number of shared nodes, i.e. vehicle service routes with a limited number of intersections. This constraint leads to solutions that are better shaped for real application purposes. We propose a new problem, the bounded overlapping MCARP (BCARP), which is defined as the mixed capacitated arc routing problem (MCARP) with an additional constraint imposing an upper bound on the number of nodes that are common to different routes. The best feasible upper bound is obtained from a modified MCARP in which the minimization criteria is given by the overlapping of the routes. We show how to compute this bound by solving a simpler problem. To obtain feasible solutions for the bigger instances of the BCARP heuristics are also proposed. Computational results taken from two well known instance sets show that, with only a small increase in total time traveled, the model BCARP produces solutions that are more attractive to implement in practice than those produced by the MCARP model.

show abstract

Section: Test Instancesmentioning

confidence: 99%

“…The MCARP lower bound (LbF ) is computed using the MIP solver with the models by Gouveia et al (2010), within a time limit of two hours.…”

Section: U B−lb Lbmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The mixed capacitated arc routing problem with non-overlapping routes

Constantino

Gouveia

Mourão

et al. 2015

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

show abstract

“…Since then, CARP progressed in theory and applications and had shown important roles in waste collection industry. Some of the latest developments and applications of CARP could be seen in Letchford and Oukil (2009) ;Christiansen et al (2009) ;Santos et al (2010);and Gouveia et al (2010).…”

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

Waste collection routing—limited multiple landfills and heterogeneous fleet

Rodrigues

Ferreira

2015

Networks

View full text Add to dashboard Cite

This article deals with a real-life waste collection routing problem. To efficiently plan waste collection, large municipalities may be partitioned into convenient sectors and only then can routing problems be solved in each sector. Three diverse situations are described, resulting in three different new models. In the first situation, there is a single point of waste disposal from where the vehicles depart and to where they return. The vehicle fleet comprises three types of collection vehicles. In the second, the garage does not match any of the points of disposal. The vehicle is unique and the points of disposal (landfills or transfer stations) may have limitations in terms of the number of visits per day. In the third situation, disposal points are multiple (they do not coincide with the garage), they are limited in the number of visits, and the fleet is composed of two types of vehicles. Computational results based not only on instances adapted from the literature but also on real cases are presented and analyzed. In particular, the results also show the effectiveness of combining sectorization and routing to solve waste collection problems.

show abstract

Lower bounds for the mixed capacitated arc routing problem

Cited by 35 publications

References 23 publications

The mixed capacitated arc routing problem with non-overlapping routes

The mixed capacitated arc routing problem with non-overlapping routes

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

Waste collection routing—limited multiple landfills and heterogeneous fleet

Contact Info

Product

Resources

About