A Branch-Cut-and-Price Approach for the Asymmetric Vehicle Routing Problem

키워드

참고문헌 (34)

1. Achuthan, N. R., "Integer linear programming formulation for a vehicle routing problem", European Journal of Operations Research, 52, pp.86~89 (1991)
2. Agarwal, Y., "A Set-partitioning-based Exact Algorithm for the Vehicle Routing Problem", Networks, 19, pp.731~749 (1989)
3. Baldacci, R., "An Exact Algorithm for the Capacitated Vehicle Routing Problem based on a Two-Commodity Network Flow Formulation", Operations Research, 52, pp.723~738 (2004)
4. Bramel, J., "On the Effectiveness of the Set-partitioning Formulation for the Vehicle Routing Problem", Operations Research, 15, pp.295~301 (1997)
5. Bramel, J., "Set-Covering-Based Algorithms for the Capacitated VRP, In: The Vehicle Routing Problem" (2002), SIAM
6. Christofides, N., "Exact Algorithms for the Vehicle Routing Problem, based on Spanning Tree and Shortest Path Relaxations", Mathematical Programming, 20, pp.255~282 (1981)
7. Clochard, J. M., "Use of Path Inequalities for TSP", Proceedings of the Third Workshop on Integer Programming and Combinatorial Optimization, pp.291~312 (1993), University of Louvain La Neuve
8. CPLEX Optimization, Inc., "Using the CPLEX Callable Library and CPLEX Mixed Integer Library", ~
9. Dell'Amico, M., "Algorithms and Codes for Dense Assignment Problems: The State of the Art", Discrete Applied Mathematics, 100, pp.17~48 (2000)
10. Desrochers, M., "A Column Generation Approach to the Urban Transit Scheduling Problem", Transportation Science, 23, pp.1~13 (1989)
11. Desrochers, M., "Improvements and Extensions to the Miller-Tucker-Zemlin Subtour Elimination Constraints", Operations Research Letters, 10, pp.27~36 (1991)
12. Desrochers, M., "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows", Operations Research, 40, pp.342~354 (1992)
13. Fischetti, M., "A Branch and Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs", Operations Research, 42, pp.846~859 (1994)
14. Fischetti, M., "An Additive Bounding Procedure for Combinatorial Optimization Problems", Operations Research, 37, pp.319~328 (1994)
15. Fisher, M. L., "Optimal Solution of Vehicle Routing Problems using Minimum K-trees", Operations Research, 42, pp.626~642 (1994)
16. Fukasawa, R, "Robust Branch-and-Cutand- Price for the Capacitated Vehicle Routing Problem", Mathematical Programming, 106(3), pp.491~511 (2006)
17. Computer Science Interfaces, "The Vehicle Routing Problem: Latest Advances and New Challenges, in: Operations Research", pp.2008, Golden, B.
18. Hadjiconstantinou, E., "A New Exact Algorithm for the Vehicle Routing Problem based on q-paths and k-shortest paths Relaxations", Annals of Operations Research, 61, pp.21~43 (1995)
19. Held, M., "Travelling-Salesman Problem and Minimum Spanning Trees: Part II", Mathematical Programming, 1, pp.6~25 (1971)
20. 강성민, "비대칭차량경로문제의 경로분할모형에 관한 연구", 한국생산관리학회지, 18(4), pp.3~31 (2007), 한국생산관리학회
21. 강성민, "복수순회외판원문제 경로분할모형의 최적화연구", 한국생산관리학회지, 19(2), pp.147~177 (2008), 한국생산관리학회
22. 강성민, "비대칭차량경로문제의 휴리스틱해법", 로지스틱스연구, 17(2), pp.5~18 (2009), 한국로지스틱스학회
23. Kara, I., "Integer Linear Programming Formulations of Multiple Salesman Problems and Its Variations", European Journal of Operational Research, 174, pp.1449~1458 (2006)
24. Laporte, G., "An Exact Algorithm for the Asymmetrical Capacitated Vehicle Routing Problem", Networks, 16, pp.33~46 (1986)
25. Laporte, G., "The Vehicle Routing Problem: an Overview of Exact and Approximate Algorithms", European Journal of Operational Research, 59, pp.345~358 (1992)
26. Lasdon, L., "Optimization Theory for Large Systems" (1970), Macmillan Company
27. Lysgaard, J., "A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem", Mathematical Programming, Ser. A, 100, pp.423~445 (2004)
28. Martinhon, C., "Stronger K-tree Relaxations for the Vehicle Routing Problem", European Journal of Operational Research, 158, pp.56~71 (2004)
29. Naddef, D., "Branch-and-Cut Algorithms for the Capacitated VRP, In: The Vehicle Routing Problem" (2002), SIAM Monographs on Discrete Mathematics and Applications
30. Computer Science Interfaces, "Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems, In: The Vehicle Routing Problem: Latest Advances and New Challenges, Operations Research", pp.2008, Pessoa, A.
31. Ralphs, T. K., "On the Capacitated Vehicle Routing Problem", Mathematical Programming, 94, pp.343~359 (2003)
32. Toth, P., "Models, Relaxations and Exact Approaches for the Capacitated Vehicle Routing Problem", Discrete Applied Mathematics, 123, pp.487~512 (2002)
33. Toth, P., "The Vehicle Routing Problem" (2002), SIAM Monographs on Discrete Mathematics and Applications
34. Vigo, D., "A Heuristic Algorithm for the Asymmetric Capacitated Vehicle Routing Problem", European Journal of Operational Research, 89, pp.108~126 (1986)

관련 논문AI추천