Formulations and branch-and-cut algorithms for production routing problems with time windows

Transportmetrica A: Transport Science

Volumn 14, Issue 8, 2018, Pages 669-690

  Qiu, Yuzhuo ^a,b   Wang, Liang ^a   Fang, Xuanjing ^a   Pardalos, Panos M ^b   Goldengorin, Boris ^c  

^a NANJING UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^b University of Florida   (United States)

^c Ohio University   (United States)

Author keywords

algorithms; cutting plane; deterministic; integer programming; inventory production; Vehicle routing

Indexed keywords

ALGORITHMS; ROUTING ALGORITHMS; VEHICLE ROUTING;

BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; CUTTING PLANES; DETERMINISTIC; INVENTORY/PRODUCTION; MIXED INTEGER OPTIMIZATION; MODEL AND ALGORITHMS; PRODUCTION VARIABLES;

INTEGER PROGRAMMING;

EID: 85041109360     PISSN: 23249935     EISSN: 23249943     Source Type: Journal    
DOI: 10.1080/23249935.2018.1427157     Document Type: Article

References (34)

1. Absi, N., C., Archetti, S., Dauzere-Peres, and D., Feillet. 2015. “A Two-Phase Iterative Heuristic Approach for the Production Routing Problem.” Transportation Science 49 (4): 784–795
2. Achterberg, T., T., Koch, and A., Martin. 2005. “Branching Rules Revisited.” Operations Research Letters 33 (1): 42–54
3. Adulyasak, Y., J.-F., Cordeau, and R., Jans. 2014a. “Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems.” INFORMS Journal on Computing 26 (1): 103–120
4. Adulyasak, Y., J.-F., Cordeau, and R., Jans. 2014b. “Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem.” Transportation Science 48 (1): 20–45
5. Adulyasak, Y., J.-F., Cordeau, and R., Jans. 2015a. “Benders Decomposition for Production Routing Under Demand Uncertainty.” Operations Research 63 (4): 851–867
6. Adulyasak, Y., J.-F., Cordeau, and R., Jans. 2015b. “The Production Routing Problem: A Review of Formulations and Solution Algorithms.” Computers & Operations Research 55, 141–152
7. Archetti, C., L., Bertazzi, G., Laporte, and M. G., Speranza. 2007. “A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem.” Transportation Science 41 (3): 382–391
8. Archetti, C., L., Bertazzi, G., Paletta, and M. G., Speranza. 2011. “Analysis of the Maximum Level Policy in a Production–Distribution System.” Computers & Operations Research 38 (12): 1731–1746
9. Armentano, V. A., A. L., Shiguemoto, and A., Lokketangen. 2011. “Tabu Search with Path Relinking for an Integrated Production–Distribution Problem.” Computers & Operations Research 38 (8): 1199–1209
10. Bard, J. F., G., Kontoravdis, and G., Yu. 2002. “A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows.” Transportation Science 36 (2): 250–269
11. Bard, J. F., and N., Nananukul. 2009a. “Heuristics for a Multi-Period Inventory Routing Problem with Production Decisions.” Computers & Industrial Engineering 57 (3): 713–723
12. Bard, J. F., and N., Nananukul. 2009b. “The Integrated Production–Inventory–Distribution–Routing Problem.” Journal of Scheduling 12 (3): 257–280
13. Bard, J. F., and N., Nananukul. 2010. “A Branch-and-Price Algorithm for an Integrated Production and Inventory Routing Problem.” Computers & Operations Research 37 (12): 2202–2217
14. Boudia, M., M. A. O., Louly, and C., Prins. 2007. “A Reactive Grasp and Path Relinking for a Combined Production–Distribution Problem.” Computers & Operations Research 34 (11): 3402–3419
15. Boudia, M., and C., Prins. 2009. “A Memetic Algorithm with Dynamic Population Management for an Integrated Production–Distribution Problem.” European Journal of Operational Research 195 (3): 703–715
16. Chandra, P., and M. L., Fisher. 1994. “Coordination of Production and Distribution Planning.” European Journal of Operational Research 72 (3): 503–517
17. Chow, J. Y., and A. E., Nurumbetova. 2015. “A Multi-Day Activity-Based Inventory Routing Model with Space-Time-Needs Constraints.” Transportmetrica A: Transport Science 11 (3): 243–269
18. Díaz-Madroñero, M., D., Peidro, and J., Mula. 2015. “A Review of Tactical Optimization Models for Integrated Production and Transport Routing Planning Decisions.” Computers & Industrial Engineering 88, 518–535
19. Fischetti, M., and P., Toth. 1997. “A Polyhedral Approach to the Asymmetric Traveling Salesman Problem.” Management Science 43 (11): 1520–1536
20. Fumero, F., and C., Vercellis. 1999. “Synchronized Development of Production, Inventory, and Distribution Schedules.” Transportation Science 33 (3): 330–340
21. Goldengorin, B., G., Jager, and P., Molitor. 2006. “Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP.” Lecture Notes in Computer Science 4235: 86–97
22. Kallehauge, B., N., Boland, and O. B. G., Madsen. 2007. “Path Inequalities for the Vehicle Routing Problem with Time Windows.” Networks 49 (4): 273–293
23. Kumar, R. S., K., Kondapaneni, V., Dixit, A., Goswami, L. S., Thakur, and M. K., Tiwari. 2016. “Multi-Objective Modeling of Production and Pollution Routing Problem with Time Window: A Self-Learning Particle Swarm Optimization Approach.” Computers & Industrial Engineering 99, 29–40
24. Lei, L., S., Liu, A., Ruszczynski, and S., Park. 2006. “On the Integrated Production, Inventory, and Distribution Routing Problem.” IIE Transactions 38 (11): 955–970
25. Lysgaard, J., 2006. “Reachability Cuts for the Vehicle Routing Problem with Time Windows.” European Journal of Operational Research 175 (1): 210–223
26. Lysgaard, J., A. N., Letchford, and R. W., Eglese. 2004. “A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem.” Mathematical Programming 100 (2): 423–445
27. Miller, C. E., A. W., Tucker, and R. A., Zemlin. 1960. “Integer Programming Formulation of Traveling Salesman Problems.” Journal of the ACM (JACM) 7 (4): 326–329
28. Naddef, D., and G., Rinaldi. 2001. “Branch-and-Cut Algorithms for the Capacitated VRP.” In The Vehicle Routing Problem, edited by P. Toth, D. Vigo, 53–84. Philadelphia, PA: Society for Industrial and Applied Mathematics
29. Pochet, Y., and L. A., Wolsey. 2006. Production Planning by Mixed Integer Programming. New York: Springer-Verlag
30. Qiu, Y., J., Qiao, and P. M., Pardalos. 2017. “A Branch-and-Price Algorithm for Production Routing Problems with Carbon Cap-and-Trade.” Omega 68, 49–61
31. Savelsbergh, M. W. P., 1985. “Local Search in Routing Problems with time Windows.” Annals of Operations Research 4 (1): 285–305
32. Solomon, M. M., 1987. “Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints.” Operations Research 35 (2): 254–265
33. Toth, P., and V., Daniele. 2014. Vehicle Routing: Problems, Methods, and Applications. Philadelphia, PA: SIAM
34. You, S. I., J. Y. J., Chow, and S. G., Ritchie. 2016. “Inverse Vehicle Routing for Activity-Based Urban Freight Forecast Modeling and City Logistics.” Transportmetrica A: Transport Science 12 (7): 650–673