Arc routing: problems, methods, and applications by Ángel Corberán, Gilbert Laporte

By Ángel Corberán, Gilbert Laporte

This booklet presents an intensive and updated dialogue of arc routing via world-renowned researchers. equipped by means of challenge sort, the ebook deals a rigorous therapy of complexity concerns, types, algorithms, and applications.

Arc Routing: difficulties, equipment, and Applications opens with a old viewpoint of the sphere and is through 3 sections that disguise complexity and the chinese language Postman and the agricultural Postman difficulties; the Capacitated Arc Routing challenge and routing issues of min-max and revenue maximization pursuits; and demanding functions, together with meter studying, snow elimination, and waste collection.

Audience: This ebook might be of curiosity to practitioners, researchers, and graduate scholars in operations examine, engineering, logistics, arithmetic, and business.

Contents: record of figures; record of tables; Preface; bankruptcy 1: A old viewpoint on Arc Routing; half I: Arc routing issues of a unmarried car; bankruptcy 2: The Complexity of Arc Routing difficulties; bankruptcy three: The undirected chinese language Postman challenge; bankruptcy four: The chinese language Postman challenge on Directed, combined, and Windy Graphs; bankruptcy five: The Undirected Rural Postman challenge; bankruptcy 6: the agricultural Postman challenge on Directed, combined, and Windy Graphs; half II: Arc routing issues of a number of autos; bankruptcy 7: The CARP: Heuristics; bankruptcy eight: The CARP: Combinatorial decrease Bounds; bankruptcy nine: The Capacitated Arc Routing challenge: certain Algorithms; bankruptcy 10: editions of the Capacitated Arc Routing challenge; bankruptcy eleven: Arc Routing issues of Min-Max ambitions; bankruptcy 12: Arc Routing issues of earnings; half III: functions; bankruptcy thirteen: course Optimization for Meter interpreting and Salt Spreading; bankruptcy 14: Advances in motor vehicle Routing for Snow Plowing; bankruptcy 15: Routing in Waste assortment; bankruptcy sixteen: Arc Routing purposes in Newspaper supply; Index

Show description

Read or Download Arc routing: problems, methods, and applications PDF

Similar graph theory books

Spectra of graphs. Theory and application

The idea of graph spectra can, in a manner, be regarded as an try to make the most of linear algebra together with, specifically, the well-developed concept of matrices for the needs of graph conception and its functions. notwithstanding, that doesn't suggest that the speculation of graph spectra will be lowered to the speculation of matrices; to the contrary, it has its personal attribute beneficial properties and particular methods of reasoning absolutely justifying it to be taken care of as a conception in its personal correct.

Graph Theory and Interconnection Networks

The development of enormous scale built-in circuit expertise has enabled the development of advanced interconnection networks. Graph idea presents a primary device for designing and studying such networks. Graph concept and Interconnection Networks offers an intensive realizing of those interrelated themes.

Fractional Graph Theory

"Both authors are first-class expositors-exceptionally so-and this makes for a pleasant learn and makes it possible for transparent realizing of the mathematical options. " -Joel Spencer Fractional Graph idea explores a number of the ways that integer-valued graph thought strategies should be transformed to derive nonintegral values.

Extra info for Arc routing: problems, methods, and applications

Example text

Due to their potentially large and evergrowing sizes, a storage-efficient representation is critical to reduce and possibly eliminate redundant information across different time-points. Second, new data model concepts need to be investigated to represent and classify potentially new alternative semantics for common graph operations such as shortest-path and connectivity. For example, a shortest path between a given pair of nodes may have at least two interpretations, one for a given start time-point and the other for the shortest travel-time for any start time in a given time interval.

F [s] = S P[s]; C = ; S = s ; Insert s in priority queue Q. while u = d { u = extract_min(Q); C = C u; S = S − u; for each node v adjacent to u do { i f ( f [v] > c[u] + duv (c[u]) + S Pvd (c[u]) c[v] = c[u] + duv (c[u]); f [v] = c[u] + duv (c[u]) + S Pvd (c[u]); if v is not in Q, insert v in Q; } update Q; } } } Output the route from s to d. Lemma 6 SP-TAG_∗ is correct. Proof The A∗ algorithm finds the shortest path for a given start time. 3 Shortest Path Computation for Fixed Start Time 35 minimum values over the entire time horizon.

The total travel time for the route is 14 time units. It can be seen that there is another route N1–N3–N4–N5 for the same start time which takes a travel time of 12 time units. This is an optimal route from N1 to N5, which suggests that the algorithm might not always compute the shortest path. 2 Start and arrival times at nodes Route computed by algorithm Node Arrival time Start time N1 N2 N3 N4 1 2 – 6 1 2 – 6 Total travel time = 14 ,4] 2,3 , 1 [ 1 N2 Optimal route N5 15 15 Node N1 N2 N3 N4 Arrival time 1 – 3 7 Start time 1 – 3 7 Total travel time = 12 [1, 2,3 ,4] 1 N1 N4 [1, 2 2 2,3 ,4] N5 13 13 [1,2,5,8] 1 N5 4] ,3, N3 2 [1, Fig.

Download PDF sample

Rated 4.08 of 5 – based on 40 votes