메뉴 건너뛰기




Volumn 58, Issue 4, 2011, Pages 290-300

Improved exact method for the double TSP with multiple stacks

Author keywords

k best solution; longest common subsequence; packing; routing; TSP

Indexed keywords

EXACT METHODS; LOGISTICS PROBLEMS; LONGEST COMMON SUBSEQUENCES; MINIMUM COST; OPTIMAL SOLUTIONS; OPTIMALITY; PICKUP AND DELIVERY PROBLEMS; PREPROCESSING TECHNIQUES; ROUTING; TSP;

EID: 80755188934     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20473     Document Type: Conference Paper
Times cited : (11)

References (11)
  • 2
    • 51349124105 scopus 로고    scopus 로고
    • An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with lifo or fifo loading
    • F. Carrabs, R. Cerulli, and, J.-F. Cordeau, An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with lifo or fifo loading, INFOR Inform Syst Oper Res 45 (2007), 223-238.
    • (2007) INFOR Inform Syst Oper Res , vol.45 , pp. 223-238
    • Carrabs, F.1    Cerulli, R.2    Cordeau, J.-F.3
  • 3
    • 73849105288 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with lifo loading
    • J.-F. Cordeau, M. Iori, G. Laporte, and, J. J. Salazar-González, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with lifo loading, Networks 55 (2010), 46-59.
    • (2010) Networks , vol.55 , pp. 46-59
    • Cordeau, J.-F.1    Iori, M.2    Laporte, G.3    Salazar-González, J.J.4
  • 5
    • 64549097583 scopus 로고    scopus 로고
    • The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
    • A. Felipe, M. Ortuño, and, G. Tirado, The double traveling salesman problem with multiple stacks: A variable neighborhood search approach, Comput Oper Res, Cambridge, Massachusetts 36 (2009), 2983-2993.
    • (2009) Comput Oper Res, Cambridge, Massachusetts , vol.36 , pp. 2983-2993
    • Felipe, A.1    Ortuño, M.2    Tirado, G.3
  • 6
    • 67349142625 scopus 로고    scopus 로고
    • New neighborhood structures for the double traveling salesman problem with multiple stacks
    • A. Felipe, M. Ortuño, and, G. Tirado, New neighborhood structures for the double traveling salesman problem with multiple stacks, TOP 17 (2009), 190-213.
    • (2009) TOP , vol.17 , pp. 190-213
    • Felipe, A.1    Ortuño, M.2    Tirado, G.3
  • 7
    • 0001185362 scopus 로고
    • K best solutions to combinatorial optimization problems
    • H. W. Hamacher, and, M. Queyranne, K best solutions to combinatorial optimization problems, Ann Oper Res 4 (1985), 123-143.
    • (1985) Ann Oper Res , vol.4 , pp. 123-143
    • Hamacher, H.W.1    Queyranne, M.2
  • 8
    • 0000685484 scopus 로고
    • A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem
    • E. Lawler, A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem, Manag Sci 18 (1972), 401-405.
    • (1972) Manag Sci , vol.18 , pp. 401-405
    • Lawler, E.1
  • 9
    • 80755165459 scopus 로고    scopus 로고
    • An exact method for the double tsp with multiple stacks
    • R. M. Lusby, J. Larsen, M. Ehrgott, and, D. Ryan, An exact method for the double tsp with multiple stacks, Int Trans Oper Res 17 (2010), 637-652.
    • (2010) Int Trans Oper Res , vol.17 , pp. 637-652
    • Lusby, R.M.1    Larsen, J.2    Ehrgott, M.3    Ryan, D.4
  • 11
    • 62549093551 scopus 로고    scopus 로고
    • The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches
    • H. L. Petersen, and, O. B. G. Madsen, The double travelling salesman problem with multiple stacks-formulation and heuristic solution approaches, Eur J Oper Res 198 (2009), 139-147.
    • (2009) Eur J Oper Res , vol.198 , pp. 139-147
    • Petersen, H.L.1    Madsen, O.B.G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.