Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem

INFORMS Journal on Computing

Volumn 22, Issue 2, 2010, Pages 314-325

  Hewitt, Mike ^a   Nemhauser, George L ^a   Savelsbergh, Martin W P ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Fixed charge network flow; Integer programming; Local search; Multicommodity

Indexed keywords

EID: 77952059163     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1090.0348     Document Type: Article

References (20)

1. Ahuja, R. K., Ö. Ergun, J. B. Orlin, A. P. Punnen. 2002. A survery of very large-scale neighborhood search techniques. Discrete Appl. Math. 123(1-3) 75-102.
2. Archetti, C., M. G. Speranza, M. W. P. Savelsbergh. 2008. An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Sci. 42(1) 22-31.
3. Balinski, M. 1961. Fixed cost transportation problem. Naval Res. Logist. Quart 8(1) 41-54.
4. Crainic, T. G., M. Gendreau. 2002. Cooperative parallel tabu search for capacitated network design. J. Heuristics 8(6) 601-627.
5. Crainic, T. G., A. Frangioni, B. Gendron. 2001. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. 112(1-3) 73-99.
6. Crainic, T. G., M. Gendreau, J. M. Farvolden. 2000. A simplex-based tabu search method for capacitated network design. INFORMS J. Comput. 12(3) 223-236.
7. Crainic, T. G., B. Gendron, G. Hernu. 2004. A slope scaling/ Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. J. Heuristics 10(5) 525-545.
8. Danna, E., E. Rothberg, C. Le Pape. 2005. Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Programming 102(1) 71-90.
9. De Franceschi, R., M. Fischetti, P. Toth. 2006. A new ILP-based refinement heuristic for vehicle routing problems. Math. Programming B 105(2-3) 471-499.
10. Fischetti, M., A. Lodi. 2003. Local branching. Math. Programming 98(1-3) 23-47.
11. Ghamlouche, I., T. G. Crainic, M. Gendreau. 2003. Cycle-based neighborhoods for fixed charge capacitated multicommodity network design. Oper. Res. 51(4) 655-667.
12. Ghamlouche, I., T. G. Crainic, M. Gendreau. 2004. Path relinking, cycle-based neighborhoods and capacitated multicommodity network design. Ann. Oper. Res. 131(1-4) 109-133.
13. Gu, Z., G. L. Nemhauser, M. W. P. Savelsbergh. 1998. Lifted cover inequalities for 0-1 integer programs: Computation. INFORMS J. Comput. 10(4) 427-437.
14. Holmberg, K., D. Yuan. 2000. A Lagrangean heuristic based branchand- bound approach for the capacitated network design problem. Oper. Res. 48(3) 461-481.
15. Kim, D., P. Pardalos. 1999. A solution to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4) 195-203.
16. Pisinger, D., S. Ropke. 2007. A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8) 2403-2435.
17. Powell, W. B., Y. Sheffi. 1989. Design and implementation of an interactive optimization system for network design in the motor carrier industry. Oper. Res. 37(1) 12-29.
18. Ropke, S., D. Pisinger. 2006. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4) 455-472.
19. Savelsbergh, M., J.-H. Song. 2008. An optimization algorithm for inventory routing with continuous moves. Comput. Oper. Res. 35(7) 2266-2282.
20. Schmid, V., K. F. Doerner, R. F. Hartl, M. W. P. Savelsbergh, W. Stoecher. 2009. A hybrid solution approach for ready-mixed concrete delivery. Transportation Sci. 43(1) 70-85.