Improved Integer Programming-Based Neighborhood Search for Less-Than-Truckload Load Plan Design
Published Online:3 Aug 2016https://doi.org/10.1287/trsc.2016.0700
References
- (2008) An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Sci. 42(1):22–31.Link, Google Scholar
- (2004) UPS optimizes its air network. Interfaces 34(1):15–25.Link, Google Scholar
- (2010) Routing design for less-than-truckload motor carriers using ant colony optimization. Transportation Res. Part E: Logist. Transportation Rev. 46(3):367–383.Crossref, Google Scholar
- (1996) Air network design for express shipment service. Oper. Res. 44(6):852–863.Link, Google Scholar
- (2000) Railroad blocking: A network design application. Oper. Res. 48(4):603–614.Link, Google Scholar
- (2002) Network design for express shipment delivery. Comput. Optim. Appl. 21(3):239–262.Crossref, Google Scholar
- (2000) Dynamic routing for priority shipments in LTL service networks. Transportation Sci. 34(1): 86–98.Link, Google Scholar
- (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.Crossref, Google Scholar
- (1986) Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem. Transportation Res. Part B: Methodological 20(3):225–242.Crossref, Google Scholar
- (2006) A new ILP-based refinement heuristic for vehicle routing problems. Math. Programming B 105(2):471–499.Crossref, Google Scholar
- (2013a) Creating schedules and computing operating costs for LTL load plans. Comput. Oper. Res. 40(3):691–702.Crossref, Google Scholar
- (2013b) Improved load plan design through integer programming based local search. Transportation Sci. 47(3):412–427.Link, Google Scholar
- (2006) A new ILP-based refinement heuristic for vehicle routing problems. Math. Programming 105(2):471–499.Crossref, Google Scholar
- (2000) Planning models for long-haul operations of postal and express shipment companies. Eur. J. Oper. Res. 122(2):289–309.Crossref, Google Scholar
- (2010) Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J. Comput. 22(2):314–325.Link, Google Scholar
- (2011) An integer programming-based local search for large-scale maximal covering problems. Internat. J. Comput. Sci. Engrg. 3(2):837–843.Google Scholar
- (2011) An integer programming-based local search for large-scale multidimensional knapsack problems. Internat. J. Comput. Sci. Engrg. 3(6):2257–2264.Google Scholar
- (2004) Operational planning of a large-scale multi-modal transportation system. Eur. J. Oper. Res. 156(1):41–53.Crossref, Google Scholar
- (2009) Large-scale, less-than-truckload service network design. Oper. Res. 57(3):609–625.Link, Google Scholar
- (1999) Multimodal express package delivery: A service network design application. Transportation Sci. 33(4):391–407.Link, Google Scholar
- (2011) Service network design for freight railway transportation: the Italian case. J. Oper. Res. Soc. 62(12):2107–2119.Crossref, Google Scholar
- (1998) Constructing railroad blocking plans to minimize handling costs. Transportation Sci. 32(4):330–345.Link, Google Scholar
- (1997) A model for medium-term operations planning in an intermodal rail-truck service. Transportation Res. Part A: Policy Practice 31(2):91–107.Crossref, Google Scholar
- (1986) A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transportation Sci. 20(4):246–257.Link, Google Scholar
- (1992) Shipment routing algorithms with tree constraints. Transportation Sci. 26(3):230–245.Link, Google Scholar
- (1983) The load planning problem for motor carriers: Problem description and proposed solution approach. Transportation Res. Part A: Policy Practice 17(6):471–480.Crossref, Google Scholar
- (1989) Design and implementation of an interactive optimization system for network design in the motor carrier industry. Oper. Res. 37(1):12–29.Link, Google Scholar
- (2008) Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. Blum C, Aguilera MJB, Roli A, Sampels M, eds. Hybrid Metaheuristics: An Emerging Approach to Optimization (Springer-Verlag, Berlin Heidelberg), 31–62.Crossref, Google Scholar
- (2012) An integer programming-based local search for the covering salesman problem. Comput. Oper. Res. 39(11):2594–2602.Crossref, Google Scholar
- (2008) An optimization algorithm for inventory routing with continuous moves. Comput. Oper. Res. 35(7):2266–2282.Crossref, Google Scholar
- (2010) An integrated load-planning problem with intermediate consolidated truckload assignments. IIE Trans. 42(7):490–513.Crossref, Google Scholar
- (2007) Strategic network design for multi-zone truckload shipments. IIE Trans. 39(2):177–189.Crossref, Google Scholar
- (2008) Service network design for freight transportation: A review. OR Spectrum 30(1):77–112.Crossref, Google Scholar
- (2009) Designing multimodal freight transport networks: A heuristic approach and applications. Transportation Sci. 43(2):129–143.Link, Google Scholar
- (2014) Scheduled service network design for freight rail transportation. Oper. Res. 62(2):383–400.Link, Google Scholar

