Research Article
A Branch-and-Price Algorithm for an Integrated Online and Offline Retailing Distribution System with Product Return
| Require: The initial solution | | Ensure: | (1) | Generate an initial route set based on the data of ; | (2) | Create a search stack , ; | (3) | Set the optimal route set ; | (4) | Set an upper bound limit ; | (5) | Whiledo | (6) | | (7) | repeat | (8) | Solve the RLPM with the basis of using simplex algorithm; | (9) | Calculate the dual values and use to construct the subproblem; | (10) | Call the dynamic programming algorithm to search the route set denoted by ; | (11) | | (12) | until; | (13) | Obtain the cost ; | (14) | ifthen | (15) | if fractional arc then | (16) | Branch on arc ; | (17) | Obtain two branching route sets and from ; | (18) | ; | (19) | else | (20) | , ; | (21) | end if | (22) | end if | (23) | end while | (24) | Return |
|