A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs
暂无分享,去创建一个
Andreas Fischer | Guntram Scheithauer | Franziska Theurich | A. Fischer | G. Scheithauer | Franziska Theurich
[1] Nasser A. El-Sherbeny,et al. Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods , 2010 .
[2] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[3] T. Bektaş. The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .
[4] Gilbert Laporte,et al. Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..
[5] R. Prim. Shortest connection networks and some generalizations , 1957 .
[6] G. Reinelt. The traveling salesman: computational solutions for TSP applications , 1994 .
[7] Nicos Christofides,et al. Technical Note - Bounds for the Travelling-Salesman Problem , 1972, Oper. Res..
[8] Niklas Kohl,et al. Exact methods for time constrained routing and related scheduling problems , 1995 .
[9] Roberto Tadei,et al. Job Order Assignment at Optimal Costs in Railway Maintenance , 2013, ICORES.
[10] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[11] Guntram Scheithauer,et al. Introduction to Cutting and Packing Optimization , 2018 .
[12] Edward K. Baker,et al. Technical Note - An Exact Algorithm for the Time-Constrained Traveling Salesman Problem , 1983, Oper. Res..
[13] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .
[14] Marshall L. Fisher,et al. Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..
[15] Leah Epstein,et al. Minimum Weighted Sum Bin Packing , 2007, WAOA.
[16] Andreas Fischer,et al. A railway maintenance scheduling problem with customer costs , 2015, EURO J. Transp. Logist..
[17] Egon Balas,et al. Report of the Session on: Branch and Bound/Implicit Enumeration , 1979 .
[18] Bezalel Gavish,et al. An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems , 1986, Oper. Res..
[19] Guido Perboli,et al. A Generalized Bin Packing Problem for parcel delivery in last-mile logistics , 2019, Eur. J. Oper. Res..
[20] Abilio Lucena,et al. Time-dependent traveling salesman problem-the deliveryman case , 1990, Networks.
[21] William J. Cook,et al. Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.