최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기정보과학회논문지. Journal of KIISE. 소프트웨어 및 응용, v.31 no.6, 2004년, pp.829 - 839
황준하 (금오공과대학교 컴퓨터공학부) , 류광렬 (부산대학교 컴퓨터공학과, 부산대학교 컴퓨터 및 정보통신연구소)
Methods based on integer programming have been shown to be very effective in solving various crew pairing optimization problems. However, their applicability is limited to problems with linear constraints and objective functions. Also, those methods often require an unacceptable amount of time and/o...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
L. Bodin, B. Golden, A. Assad, and M. Ball, 'Routing and scheduling of vehicles and crews: the state of the art,' Computers and Operations Research, 10:63-211, 1983
A. Caprara, M. Fischetti, P.L. Guida, P. Toth, and D. Vigo, 'Solution of large-scale railway crew planning problems: The Italian experience,' Technical Report OR-97-9, DEIS University of Bologna, 1997
S. Ceria, P. Nobill, and A. Sassano, 'A Lagrangian-based heuristic for large-scale set covering problems,' Mathematical Programming, 81:215-228, 1998
J,E. Beasly, and P.C. Chu, 'A genetic algorithm for the set covering problem,' European Journal of Operational Research, 94:392-404, 1996
S. Lavoie, M. Minoux, and E. Odier, 'A new approach for crew pairing problems by column generation with an application to air transportation,' European Journal of Operations Research, 35:45-58, 1988
C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance, 'Branch and price: Column generation for huge integer programs,' Operations Research, 46:316-329, 1998
E. Aarts, J. Korst, and P. Laarhoven, 'Simulated annealing,' Local Search in Combinatorial Optimization, John Wiley & Sons, 91-120, 1997
F. Glover, and M. Laguna, Tabu search, Kluwer Academic Publishers, 1997
L.A. Wolsey, Integer programming, Wiley, 1998
R. Church, and C. ReVelle, 'The maximal covering location problem,' Papers of the Regional Science Association, 32:101-118, 1974
ILOG CPLEX, Reference and User Manual, Version 7.0, 2000
※ AI-Helper는 부적절한 답변을 할 수 있습니다.