Formulations and branch-and-cut algorithms for multi-product multi-vehicle production routing problems with startup cost

Expert Systems with Applications

Volumn 98, Issue , 2018, Pages 1-10

  Qiu, Yuzhuo ^a,b   Wang, Liang ^a   Xu, Xiaoling ^a   Fang, Xuanjing ^a   Pardalos, Panos M ^b  

^a NANJING UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^b University of Florida   (United States)

Author keywords

Branch and cut; Generalized (l, S) inequalities; Production planning; Routing

Indexed keywords

COSTS; PLANNING; PRODUCTION CONTROL; ROUTING ALGORITHMS; VEHICLES;

BRANCH AND CUT; BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL EXPERIMENT; GENERALIZED (L, S) INEQUALITIES; INVENTORY ROUTING PROBLEMS; MIXED INTEGER LINEAR PROGRAMMING MODEL; PRODUCTION PLANNING; ROUTING;

INTEGER PROGRAMMING;

EID: 85040310199     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2018.01.006     Document Type: Article

References (29)

1. Absi, N., Archetti, C., Dauzere-Peres, S., Feillet, D., A two-phase iterative heuristic approach for the production routing problem. Transportation Science 49:4 (2015), 784–795.
2. Adulyasak, Y., Cordeau, J.-F., Jans, R., Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS Journal on Computing 26:1 (2014), 103–120.
3. Adulyasak, Y., Cordeau, J.-F., Jans, R., Optimization-based adaptive large neighborhood search for the production routing problem. Transportation Science 48:1 (2014), 20–45.
4. Adulyasak, Y., Cordeau, J.-F., Jans, R., Benders decomposition for production routing under demand uncertainty. Operations Research 63:4 (2015), 851–867.
5. Adulyasak, Y., Cordeau, J.-F., Jans, R., The production routing problem: A review of formulations and solution algorithms. Computers & Operations Research 55 (2015), 141–152.
6. Archetti, C., Bertazzi, L., Laporte, G., Speranza, M.G., A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Science 41:3 (2007), 382–391.
7. Archetti, C., Bertazzi, L., Paletta, G., Speranza, M.G., Analysis of the maximum level policy in a production-distribution system. Computers & Operations Research 38:12 (2011), 1731–1746.
8. Armentano, V., Shiguemoto, A., Lokketangen, A., Tabu search with path relinking for an integrated production-distribution problem. Computers & Operations Research 38:8 (2011), 1199–1209.
9. Bard, J.F., Nananukul, N., Heuristics for a multiperiod inventory routing problem with production decisions. Computers & Industrial Engineering 57:3 (2009), 713–723.
10. Bard, J.F., Nananukul, N., The integrated production-inventory-distribution-routing problem. Journal of Scheduling 12:3 (2009), 257–280.
11. Bard, J.F., Nananukul, N., A branch-and-price algorithm for an integrated production and inventory routing problem. Computers & Operations Research 37:12 (2010), 2202–2217.
12. Boudia, M., Louly, M., Prins, C., A reactive GRASP and path relinking for a combined production-distribution problem. Computers & Operations Research 34:11 (2007), 3402–3419.
13. Boudia, M., Prins, C., A memetic algorithm with dynamic population management for an integrated production-distribution problem. European Journal of Operational Research 195:3 (2009), 703–715.
14. Brahimi, N., Aouam, T., Multi-item production routing problem with backordering: A milp approach. International Journal of Production Research 54:4 (2016), 1076–1093.
15. Chandra, P., Fisher, M.L., Coordination of production and distribution planning. European Journal of Operational Research 72:3 (1994), 503–517.
16. Cinar, D., Gakis, K., Pardalos, P.M., A 2-phase constructive algorithm for cumulative vehicle routing problems with limited duration. Expert Systems with Applications 56 (2016), 48–58.
17. Coelho, L.C., Laporte, G., A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. International Journal of Production Research 51:23–24 (2013), 7156–7169.
18. Díaz-Madroñero, M., Peidro, D., Mula, J., A review of tactical optimization models for integrated production and transport routing planning decisions. Computers & Industrial Engineering 88 (2015), 518–535.
19. Eppen, G.D., Martin, R.K., Solving multi-item capacitated lot-sizing problems using variable redefinition. Operations Research 35:6 (1987), 832–848.
20. Fumero, F., Vercellis, C., Synchronized development of production, inventory, and distribution schedules. Transportation Science 33:3 (1999), 330–340.
21. Groër, C., Golden, B., Wasil, E., A library of local search heuristics for the vehicle routing problem. Mathematical Programming Computation 2:2 (2010), 79–101.
22. Karmarkar, U.S., Kekre, S., Kekre, S., The dynamic lot-sizing problem with startup and reservation costs. Operations Research 35:3 (1987), 389–398.
23. Kumar, R.S., Kondapaneni, K., Dixit, V., Goswami, A., Thakur, L., Tiwari, M., Multi-objective modeling of production and pollution routing problem with time window: A self-learning particle swarm optimization approach. Computers & Industrial Engineering 99 (2016), 29–40.
24. Lei, L., Liu, S., Ruszczynski, A., Park, S., On the integrated production, inventory, and distribution routing problem. IIE Transactions 38:11 (2006), 955–970.
25. Li, J., Pardalos, P.M., Sun, H., Pei, J., Zhang, Y., Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups. Expert Systems with Applications 42:7 (2015), 3551–3561.
26. Lysgaard, J., Letchford, A.N., Eglese, R.W., A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming 100:2 (2004), 423–445.
27. Pochet, Y., Wolsey, L.A., Production planning by mixed integer programming. Springer Science & Business Media, 2006.
28. Shi, Y., Boudouh, T., Grunder, O., A hybrid genetic algorithm for a home health care routing problem with time window and fuzzy demand. Expert Systems with Applications 72 (2017), 160–176.
29. Vanderbeck, F., Lot-sizing with startup times. Management Science 44:10 (1998), 1409–1425.