Improved Load Plan Design Through Integer Programming Based Local Search

References

• Ahuja RK, Ergun O, Orlin JB, Punnen AP. A survery of very large scale neighborhood search techniques. Discrete Appl. Math. (2002) 123(1–3):75–102Crossref, Google Scholar
• Archetti C, Speranza MG, Savelsbergh MWP. An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Sci. (2008) 42(1):22–31Link, Google Scholar
• Crainic TG. Service network design in freight transportation. Eur. J. Oper. Res. (2000) 122(2):272–288Crossref, Google Scholar
• Crainic TG, Gendreau M. Cooperative parallel tabu search for capacitated network design. J. Heuristics (2002) 8(6):601–627Crossref, Google Scholar
• Crainic TG, Gendreau M, Farvolden JM. A simplex-based tabu search method for capacitated network design. INFORMS J. Comput. (2000) 12(3):223–236Link, Google Scholar
• Danna E, Rothberg E, Le Pape C. Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Programming (2005) 102(1):71–90Crossref, Google Scholar
• De Franceschi R, Fischetti M, Toth P. A new ILP-based refinement heuristic for vehicle routing problems. Math. Programming B (2006) 105(2–3):471–499Crossref, Google Scholar
• Dijkstra EW. A note on two problems in connexion with graphs. Numerische Mathematik (1959) 1(1):269–271Crossref, Google Scholar
• Espinoza D, Garcia R, Goycoolea M, Nemhauser GL, Savelsbergh MWP. Per-seat, on-demand air transportation part II: Parallel local search. Transportation Sci. (2008) 42(3):279–291Link, Google Scholar
• Farvolden JM, Powell WB. Subgradient methods for the service network design problem. Transportation Sci. (1994) 28(3):256–272Link, Google Scholar
• Ghamlouche I, Crainic TG, Gendreau M. Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. (2003) 51(4):655–667Link, Google Scholar
• Ghamlouche I, Crainic TG, Gendreau M. Path relinking, cycle-based neighborhoods and capacitated multicommodity network design. Ann. Oper. Res. (2004) 131(1–4):109–133Crossref, Google Scholar
• Hewitt M, Nemhauser GL, Savelsbergh MWP. Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J. Comput. (2010) 22(2):314–325Link, Google Scholar
• Jarrah AI, Johnson E, Neubert LC. Large-scale, less-than-truckload service network design. Oper. Res. (2009) 57(3):609–625Link, Google Scholar
• Pederson MB, Crainic TG, Madsen OBG. Models and tabu search metaheuristics for service network design with asset-balance requirements. Transportation Sci. (2009) 43(2):158–177Link, Google Scholar
• Powell WB. A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transportation Sci. (1986) 20(4):246–257Link, Google Scholar
• Powell WB, Koskosidis IA. Shipment routing algorithms with tree constraints. Transportation Sci. (1992) 26(3):230–245Link, Google Scholar
• Powell WB, Sheffi Y. The load planning problem of motor carriers: Problem description and proposed solution approach. Transportation Res.–A (1983) 17A(6):471–480Google Scholar
• Powell WB, Sheffi Y. Design and implementation of an interactive optimization system for network design in the motor carrier industry. Oper. Res. (1989) 37(1):12–29Link, Google Scholar
• Savelsbergh MWP, Song J-H. An optimization algorithm for inventory routing with continuous moves. Comput. Oper. Res. (2008) 35(7):2266–2282Crossref, Google Scholar
• Schmid V, Doerner KF, Hartl RF, Savelsbergh MWP, Stoecher W. A hybrid solution approach for ready-mixed concrete delivery. Transportation Sci. (2009) 43(1):70–85Link, Google Scholar
• Wieberneit N. Service network design for freight transportation: A review. OR Spectrum (2008) 30(1):77–112Crossref, Google Scholar
• Zhang Y. Advances in LTL load plan design. (2010) . Ph.D. thesis, Georgia Institute of Technology, AtlantaGoogle Scholar