The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools.
In this problem @cite_95 , a fleet of vehicles, all of them located at a central depot and with a known capacity, must serve a set of streets network, with minimum total cost such that the load assigned to each vehicle does not exceed its capacity.
@cite_95
1591506270
Preface. Contributing Authors. 1. A Historical Perspective on Arc Routing H.A. Eiselt, G. Laporte. Part I. Theory: 2. Traversing Graphs: The Eulerian and Hamiltonian Theme h. Fleischner. 3. Matching: Arc Routing and Solution Connection U. Derigs. 4. Arc Routing: Complexity and Approximability M. Dror. 5. Chinese Postman and Euler Tour Problems in Bi-directed Graphs E.L.Johnson. Part II. Solutions: 6. Polyhedral Theory for Arc Routing Problems R.W. Eglese, A.N. Letchford. 7. Linear Programming Based Methods for Solving Arc Routing Problems E. Benavent, et al 8. Transformations and Exact Node Routing Solutions by Column Generation M. Dror, A. Langevin. 9. Heuristic Algorithms A. Hertz, M. Mittaz. Part III. Applications: 10. Roadway Snow and Ice Control J.F. Campbell, A. Langevin. 11. Scheduling of Local Delivery Carrier Routes for the United States Postal Service L. Bodin, L. Levy. 12. Livestock Feed Distribution and Arc Traversal Problems M. Dror, et al