Premium
Solving capacitated part‐routing problems with setup times and costs: a Dantzig–Wolfe decomposition‐based solution approach
Author(s) -
Nsakanda Aaron Luntala,
Diaby Moustapha,
Cao Yuheng
Publication year - 2011
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.2010.00774.x
Subject(s) - mathematical optimization , routing (electronic design automation) , decomposition , computer science , vehicle routing problem , relaxation (psychology) , decomposition method (queueing theory) , mathematics , computer network , psychology , ecology , social psychology , biology , discrete mathematics
We develop a Dantzig–Wolfe decomposition‐based approach for solving the capacitated part‐routing problem with routing flexibilities, setup times, and setup costs. Large instances of the problem are solved to near‐optimality using the proposed approach. The computational performance of the approach is compared with that of the existing Lagrangean relaxation‐based approach in terms of solution quality and computational times.