A MILP-based column generation strategy for managing large-scale maritime distribution problems

Computers and Chemical Engineering

Volumn 72, Issue , 2015, Pages 350-362

  Cóccola, Mariana E ^a   Dondo, Rodolfo ^a   Méndez, Carlos A ^a  

^a UNIVERSIDAD NACIONAL DEL LITORAL   (Argentina)

Author keywords

Column generation; MILP slave formulation; Ship routing and scheduling; Tramp shipping

Indexed keywords

COLUMN GENERATION; DISTRIBUTION PROBLEM; MILP-SLAVE-FORMULATION; ROUTING AND SCHEDULING;

EID: 84908353719     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compchemeng.2014.04.008     Document Type: Article

References (18)

1. Barnhart C., Johnson E., Nemhauser G., Savelsbergh M., Vance P. Branch and Price. Column generation for solving huge integer programs. Oper Res 2000, 48:316-329.
2. Bettinelli A., Ceselli A., Rifghini G. A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transport Res C: Emerg Technol 2011, 19:723-740.
3. Brønmo G., Christiansen M., Nygreen B. Ship routing and scheduling with flexible cargo sizes. J Oper Res Soc 2007, 58:1167-1177.
4. Brønmo G., Nygreen B., Lysgaard J. Column generation approaches to ship scheduling with flexible cargo sizes. Eur J Oper Res 2010, 200:139-150.
5. Christiansen M., Fagerholt K., Nygreen B., Ronen D. Maritime transportation. Handbook in Operations Research and Management Science: Transportation 2007, vol. 14:189-284. Elsevier, North-Holland, Amsterdam.
6. Christiansen M., Fagerholt K., Nygreen B., Ronen D. Ship routing and scheduling in the new millennium. Eur J Oper Res 2013, 228:467-483.
7. Dantzig G., Wolfe P. Decomposition principles for linear programs. Oper Res 1960, 8:101-111.
8. Desaulniers G., Desrosiers A., Erdmann A., Solomon M., Soumis F. VRP with pickup and delivery. The vehicle routing problem, SIAM monographs on discrete mathematics and applications 2002, vol. 9:225-242. SIAM, Philadelphia.
9. Desrosiers J., Lübbecke M.E. Branch-price-and-cut algorithms. Wiley encyclopedia of operations research and management science 2010, vol. 8. Wiley, New York, NY.
10. Dondo R., Méndez C.A., Cerdá J. Optimal management of logistic activities in multi-site environments. Comput Chem Eng 2008, 32:2547-2569.
11. Jetlund A.S., Karimi I.A. Improving the logistics of multi-compartment chemical tankers. Comput Chem Eng 2004, 28:1267-1283.
12. Nishi T., Izuno T. Column generation heuristics for ship routing and scheduling problems in crude oil transportation with split deliveries. Comput Chem Eng 2014, 60:329-338.
13. Papageorgiou L.G. Supply chain optimisation for the process industries: advances and opportunities. Comput Chem Eng 2009, 33:1931-1938.
14. Ropke S., Cordeau S. Branch and cut and price for the pickup and delivery problem with time windows. Transport Sci 2009, 43:267-286.
15. Ryan D., Foster B. An integer programming approach to scheduling. Computer scheduling of public transport, urban passenger vehicle and crew scheduling, 1981, 269-280. North-Holland, Amsterdam. A. WREN (Ed.).
16. Savelsbergh M., Sol M. The general pick-up and delivery problem. Transport Sci 1995, 29:17-29.
17. Savelsbergh M., Sol M. DRIVE: Dynamic Routing of Independent Vehicles. Oper Res 1998, 46:474-490.
18. UNCTAD Review of Maritime Transport 2012, .