Abstract
The N-vehicle exploration problem (NVEP) is a nonlinear discrete scheduling problem, and the complexity status remains open. To our knowledge, there is no literature until now employing mixed integer linear programming (MILP) technology to solve this problem except for Wang (J Oper Res Soc China 3(4):489–498, 2015). However, they did not give numerical experiments since their model existed strictly inequalities and the number of constraints was up to \(O(n^3)\), which was inefficient to solve practical problems. This paper establishes a more concise MILP model, where the number of constraints is just \(O(n^2)\). Therefore, the existing efficient MILP algorithms can be used to solve NVEP. Secondly, we provide some properties of N-vehicle problem and give three methods for cutting plane construction, which can increase the solving speed significantly. Finally, a numerical experiment is provided to verify the effectiveness and robustness for different instances and scales of acceleration techniques.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Fine, J.: The jeep problem. Am. Math. Mon. 54, 24–31 (1947)
Woeginger, G.: Scheduling (dagstuhl seminar 10071). Dagstuhl Research Online Publication Server p. 24 (2010)
Carlier, J.: The one-machine sequencing problem. Eur. J. Oper. Res. 11, 42–47 (1982)
Liu, R., Lu, H., Cui, J., Li, X.: Studies on the heuristic algorithm for the N-vehicle exploration problem (NVEP). In: The Tenth International Symposium on Operations Research and Its Applications, pp. 107–114. Citeseer (2011)
Höhn, W.: Scheduling (dagstuhl seminar 13111). Dagstuhl Research Online Publication Server pp. 32–33 (2013)
Li, X., Cui, J.: Real-time algorithm scheme for N-vehicle exploration problem. In: Combinatorial Optimization and Applications. In: Third International Conference, COCOA 2009, Huangshan, China, June 10–12, 2009. Proceedings, pp. 287–300. Springer, Berlin (2009)
Xu, Y., Cui, J.: Multitask \(N\)-vehicle exploration problem: complexity and algorithm. J. Syst. Sci. Complex. 25(6), 1080–1092 (2012)
Xu, Y., Cui, J.: A kind of \(\varepsilon \)-approximation algorithm for the exploration problem with N-vehicles. Acta Math. Appl. Sin. 32(6), 1036–1043 (2009)
Li, X.: A kind of rollout algorithm for \(N\)-vehicles exploration problem. Acta Math. Appl. Sin. 37(1), 99–108 (2014)
Liu, A., Deng, X., Tong, Z., Xu, F., Liu, B., Duan, W., Li, Z.: A tabu-based variable neighborhood local search for n-vehicles exploration problem. In: Control and Automation (ICCA), 2016 12th IEEE International Conference on, pp. 951–955. IEEE (2016)
Gamzu, I., Segev, D.: A polynomial-time approximation scheme for the airplane refueling problem. J. Sched. (2015). https://doi.org/10.1007/s10951-018-0569-x
Wang, L.L., She, B.L., Liu, J.F., Cui, J.C.: A linear mixed integer programming model for N-vehicle exploration problem. J. Oper. Res. Soc. China 3(4), 489–498 (2015)
Vásquez, O.C.: For the airplane refueling problem local precedence implies global precedence. Optim. Lett. 9(4), 663–675 (2015)
Bansal, N., Dürr, C., Thang, N.K., Vásquez, O.C.: The local-global conjecture for scheduling with non-linear cost. J. Sched. 20(3), 239–254 (2017)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by Key Laboratory of Management, Decision and Information Systems, Chinese Academy of Science.
Rights and permissions
About this article
Cite this article
Zhang, GJ., Cui, JC. A Novel MILP Model for N-vehicle Exploration Problem. J. Oper. Res. Soc. China 9, 359–373 (2021). https://doi.org/10.1007/s40305-019-00289-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40305-019-00289-2