Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective
Tóm tắt
Từ khóa
Tài liệu tham khảo
Bérubé, 2009, An exact ϵ-constraint method for bi-objective combinatorial optimization problems: application to the traveling salesman problem with profits, Eur J Oper Res, 194, 39, 10.1016/j.ejor.2007.12.014
Boland, 2006, Accelerated label setting algorithms for the elementary resource constrained shortest path problem, Oper Res Lett, 34, 58, 10.1016/j.orl.2004.11.011
Current, 1994, The median tour and maximal covering tour problems: formulations and heuristics, Eur J Oper Res, 73, 114, 10.1016/0377-2217(94)90149-X
Das, 1997, A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems, Struct Optim, 14, 63, 10.1007/BF01197559
Delort C, Spanjaard O (2010) Using bound sets in multiobjective optimization: application to the biobjective binary knapsack problem. In: Festa P (ed) Experimental algorithms, Springer, pp 253–265.
Desaulniers G, Desrosiers J, Solomon MM (2002) Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems. In: Ribeiro CC et al (eds) Essays and surveys in metaheuristics, operations research/computer science interfaces series, vol 15. Springer, US, pp 309–324
Ehrgott, 2007, Bound sets for biobjective combinatorial optimization problems, Comput Oper Res, 34, 2674, 10.1016/j.cor.2005.10.003
Ehrgott M, Tind J (2007) Column generation in integer programming with applications in multicriteria optimization. Tech. rep., Faculty of Engineering, University of Auckland, New Zealand
Feillet, 2004, An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems, Networks, 44, 216, 10.1002/net.20033
Fishburn, 1967, Additive utilities with incomplete product sets: application to priorities and assignments, Oper Res, 15, 537, 10.1287/opre.15.3.537
Hà, 2013, An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices, Eur J Oper Res, 226, 211, 10.1016/j.ejor.2012.11.012
Hachicha, 2000, Heuristics for the multi-vehicle covering tour problem, Comput Oper Res, 27, 29, 10.1016/S0305-0548(99)00006-4
Haimes, 1971, On a bicriterion formulation of the problems of integrated system identification and system optimization, IEEE Trans Syst Man Cybern, 1, 296
Hodgson, 1998, A covering tour model for planning mobile health care facilities in SuhumDistrict, Ghama, J Reg Sci, 38, 621, 10.1111/0022-4146.00113
Jozefowiez, 2012
Jozefowiez, 2007, The bi-objective covering tour problem, Comput Oper Res, 34, 1929, 10.1016/j.cor.2005.07.022
Labbé, 1986
Peng, 2012, A new column-generation-based algorithm for VMAT treatment plan optimization, Phys Med Biol, 57, 4569, 10.1088/0031-9155/57/14/4569
Reinhardt, 2011, Multi-objective and multi-constrained non-additive shortest path problems, Comput Oper Res, 38, 605, 10.1016/j.cor.2010.08.003
Righini, 2008, New dynamic programming algorithms for the resource constrained elementary shortest path problem, Networks, 51, 155, 10.1002/net.20212
Salari, 2013, A column-generation-based method for multi-criteria direct aperture optimization, Phys Med Biol, 58, 621, 10.1088/0031-9155/58/3/621
Sarpong BM, Artigues C, Jozefowiez N (2013) Column generation for bi-objective vehicle routing problems with a min–max objective. In: 13th workshop on algorithmic approaches for transportation modelling, optimization, and systems, OASICS, vol 33, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp 137–149
Sarpong, 2013
Sourd, 2008, A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem, INFORMS J Comput, 20, 472, 10.1287/ijoc.1070.0260