Synchronized arc routing for snow plowing operations

Salazar-Aguilar, M. Angélica; Langevin, André; Laporte, Gilbert

doi:10.1016/j.cor.2011.08.014

Cited by 78 publications

(38 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(iii) Movement synchronization: Two or more vehicles must move along a part of their itinerary together. For example, a trailer has to be pulled by a truck (Section 1.3.4), and for winter road maintenance, when routing snow plows, the clearing of a twolane or three-lane street requires that several snow plows follow one another to clear the snow away (see Salazar-Aguilar, Langevin, and Laporte [119]). (iv) Load synchronization: The right amount of load is collected, delivered, and transshipped at all locations and for all vehicles and their combinations when interacting.…”

Section: Inter-route Constraintsmentioning

confidence: 99%

Chapter 1: The Family of Vehicle Routing Problems

Irnich¹,

Toth²,

Vigo³

2014

Vehicle Routing

View full text Add to dashboard Cite

A generic verbal definition of the family of vehicle routing problems can be the following:Given: A set of transportation requests and a fleet of vehicles.The problem is then to find a plan for the following:Task: Determine a set of vehicle routes to perform all (or some) transportation requests with the given vehicle fleet at minimum cost; in particular, decide which vehicle handles which requests in which sequence so that all vehicle routes can be feasibly executed.In this type of problem, subsumed under the term Vehicle Routing Problem (VRP), the transportation requests to be served are generally concentrated in specific points of a road network as opposed to the Arc Routing Problems (ARP; see the companion book by Corberán and Laporte [35]), where the requests are dispersed along the arcs, i.e., street segments of the underlying road network. The following sections will shed light on the basic VRP components, which are the transportation requests and how they can be performed, the fleet of vehicles, the related costs and profits (if relevant), and the feasibility of routes.Before going into the details, however, we discuss the economic relevance of computersupported vehicle routing. Indeed, the large number of real-world applications have widely shown that the use of computerized solution methods for the solution of VRP, both at the planning and the operational levels, yields substantial savings in the global transportation costs. The success of the utilization of optimization techniques is due not only to the power of the current computer systems and to the full integration of the information systems into the operations and commercial processes, but it can also be attributed to the development of rigorous mathematical models, which are able to take into account al-1 Downloaded 12/15/14 to 132.236.27.111. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php 2 Chapter 1. The Family of Vehicle Routing Problems most all the characteristics of the VRP arising in real-world applications. Furthermore, the corresponding algorithms and their computer implementations (software tools) play an essential role in finding high-quality feasible solutions for real-world instances within acceptable computing times. Compared to procedures not based on optimization techniques, significant cost savings and a better utilization of the vehicle fleet can be achieved. In addition, by means of such planning software it is possible to improve the automation, standardization, and integration into the organizations' overall planning processes, leading to less time-consuming and more cost-efficient planning processes with respect to manual planning. Moreover, computerized planning allows planners to compare several different planning scenarios, and herewith to choose a best one through a careful and fast evaluation of cost and service-related performance indicators.In the last years, software tools integrating telematics services (electronic data transmission between vehicles and planners) have b...

show abstract

Section: Inter-route Constraintsmentioning

confidence: 99%

Chapter 1: The Family of Vehicle Routing Problems

Irnich¹,

Toth²,

Vigo³

2014

Vehicle Routing

View full text Add to dashboard Cite

show abstract

“…This algorithm has been used in the arc routing domain for the synchronized arc routing problem [26] in which snow plowing operations are performed by coordinating a set of vehicles, and for a road marking application [27]. Applications that require the combination of routing and inventory decisions in the node routing domain that use the ALNS can be found in [5] and [4].…”

Section: Adaptive Large Neighborhood Searchmentioning

confidence: 99%

Location arc routing problem with inventory constraints

Riquelme-Rodríguez

Gamache

Langevin

2016

Computers & Operations Research

Self Cite

View full text Add to dashboard Cite

“…Routing for snow plowing vehicles is the core work in Refs. , and . As with the Hungarian salting route study discussed above, Liu et al also resort to existing CARP methodologies, in this case to minimize the total travel distance for snow plowing operations in the south part of the city of Edmonton in Alberta, Canada.…”

Section: Arc Routing Applicationsmentioning

confidence: 99%

An updated annotated bibliography on arc routing problems

Mourão

Pinto

2017

Networks

View full text Add to dashboard Cite

The number of arc routing publications has increased significantly in the last decade. Such an increase justifies a second annotated bibliography, a sequel to Corberán and Prins (Networks 56 (2010), 50–69), discussing arc routing studies from 2010 onwards. These studies are grouped into three main sections: single vehicle problems, multiple vehicle problems and applications. Each main section catalogs problems according to their specifics. Section 2 is therefore composed of four subsections, namely: the Chinese Postman Problem, the Rural Postman Problem, the General Routing Problem (GRP) and Arc Routing Problems (ARPs) with profits. Section 3, devoted to the multiple vehicle case, begins with three subsections on the Capacitated Arc Routing Problem (CARP) and then delves into several variants of multiple ARPs, ending with GRPs and problems with profits. Section 4 is devoted to applications, including distribution and collection routes, outdoor activities, post‐disaster operations, road cleaning and marking. As new applications emerge and existing applications continue to be used and adapted, the future of arc routing research looks promising. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(3), 144–194 2017

show abstract

Synchronized arc routing for snow plowing operations

Cited by 78 publications

References 13 publications

Chapter 1: The Family of Vehicle Routing Problems

Chapter 1: The Family of Vehicle Routing Problems

Location arc routing problem with inventory constraints

An updated annotated bibliography on arc routing problems

Contact Info

Product

Resources

About