|
Snow Plow Routing Problem
The snow plow routing problem is an application of the structure of Arc Routing Problems (ARPs) and Vehicle Routing Problems (VRPs) to snow removal that considers roads as edges of a graph. The problem is a simple routing problem when the arrival times are not specified. Snow plow problems consider constraints such as the cost of plowing downhill compared to plowing uphill. The Mixed Chinese Postman Problem The mixed Chinese postman problem (MCPP or MCP) is the search for the shortest traversal of a graph with a set of vertices V, a set of undirected edges E with positive rational weights, and a set of directed arcs A with positive rational weights t ... is applicable to snow routes where directed edges represent one-way streets and undirected edges represent two-way streets. Background The routing and scheduling of snow removal vehicles is an important topic for transportation planners and operation researchers This set of problems is part of a larger field of problems re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arc Routing Problem
Arc routing problems (ARP) are a category of general routing problems (GRP), which also includes node routing problems (NRP). The objective in ARPs and NRPs is to traverse the edges and nodes of a graph, respectively. The objective of arc routing problems involves minimizing the total distance and time, which often involves minimizing deadheading time, the time it takes to reach a destination. Arc routing problems can be applied to garbage collection, school bus route planning, package and newspaper delivery, deicing and snow removal with winter service vehicles that sprinkle salt on the road, mail delivery, network maintenance, street sweeping, police and security guard patrolling, and snow ploughing. Arc routings problems are NP hard, as opposed to route inspection problems that can be solved in polynomial-time. For a real-world example of arc routing problem solving, Cristina R. Delgado Serna & Joaquín Pacheco Bonrostro applied approximation algorithms to find the best schoo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vehicle Routing Problem
The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?" It generalises the travelling salesman problem (TSP). It first appeared in a paper by George Dantzig and John Ramser in 1959, in which the first algorithmic approach was written and was applied to petrol deliveries. Often, the context is that of delivering goods located at a central depot to customers who have placed orders for such goods. The objective of the VRP is to minimize the total route cost. In 1964, Clarke and Wright improved on Dantzig and Ramser's approach using an effective greedy algorithm called the savings algorithm. Determining the optimal solution to VRP is NP-hard, so the size of problems that can be optimally solved using mathematical programming or combinatorial optimization may be limited. Therefore, commercial solvers tend to use he ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Snow Removal
Snow removal or snow clearing is the job of removing snow after a snowfall to make travel easier and safer. This is done by both individual households and by governments and institutions. De-icing and anti-icing De-icing is defined as removal of existing snow, ice or frost from a roadway, airport runway, roof, or other surface. It includes both mechanical means, such as plowing, vacuuming or scraping, and chemical means, such as application of salt or other ice-melting chemicals. Anti-icing is treatment with ice-melting chemicals before or during the onset of a storm in order to prevent or delay the formation and adhesion of ice and snow to the surface. Brine, or wetted salt, is usually applied shortly before the beginning of a snowstorm. When properly performed, anti-icing can significantly reduce the amount of salt required and allow easier removal by mechanical methods, including plowing. The de-icing of roads has historically been accomplished by snowplows or specially de ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arc Routing
Arc routing problems (ARP) are a category of general routing problems (GRP), which also includes node routing problems (NRP). The objective in ARPs and NRPs is to traverse the edges and nodes of a graph, respectively. The objective of arc routing problems involves minimizing the total distance and time, which often involves minimizing deadheading time, the time it takes to reach a destination. Arc routing problems can be applied to garbage collection, school bus route planning, package and newspaper delivery, deicing and snow removal with winter service vehicles that sprinkle salt on the road, mail delivery, network maintenance, street sweeping, police and security guard patrolling, and snow ploughing. Arc routings problems are NP hard, as opposed to route inspection problems that can be solved in polynomial-time. For a real-world example of arc routing problem solving, Cristina R. Delgado Serna & Joaquín Pacheco Bonrostro applied approximation algorithms to find the best schoo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Operations Research
Operations research ( en-GB, operational research) (U.S. Air Force Specialty Code: Operations Analysis), often shortened to the initialism OR, is a discipline that deals with the development and application of analytical methods to improve decision-making. It is considered to be a subfield of mathematical sciences. The term management science is occasionally used as a synonym. Employing techniques from other mathematical sciences, such as modeling, statistics, and optimization, operations research arrives at optimal or near-optimal solutions to decision-making problems. Because of its emphasis on practical applications, operations research has overlap with many other disciplines, notably industrial engineering. Operations research is often concerned with determining the extreme values of some real-world objective: the maximum (of profit, performance, or yield) or minimum (of loss, risk, or cost). Originating in military efforts before World War II, its techniques have grown to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Snow Removal
Snow removal or snow clearing is the job of removing snow after a snowfall to make travel easier and safer. This is done by both individual households and by governments and institutions. De-icing and anti-icing De-icing is defined as removal of existing snow, ice or frost from a roadway, airport runway, roof, or other surface. It includes both mechanical means, such as plowing, vacuuming or scraping, and chemical means, such as application of salt or other ice-melting chemicals. Anti-icing is treatment with ice-melting chemicals before or during the onset of a storm in order to prevent or delay the formation and adhesion of ice and snow to the surface. Brine, or wetted salt, is usually applied shortly before the beginning of a snowstorm. When properly performed, anti-icing can significantly reduce the amount of salt required and allow easier removal by mechanical methods, including plowing. The de-icing of roads has historically been accomplished by snowplows or specially de ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
