Premium
Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints
Author(s) -
Luo Zhixing,
Qin Hu,
Zhu Wenbin,
Lim Andrew
Publication year - 2016
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.21683
Subject(s) - branch and cut , vehicle routing problem , mathematical optimization , synchronization (alternating current) , computer science , job shop scheduling , routing (electronic design automation) , scheduling (production processes) , clique , branch and bound , upper and lower bounds , node (physics) , mathematics , integer programming , combinatorics , computer network , channel (broadcasting) , mathematical analysis , structural engineering , engineering
In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016