Abstract
This paper addresses the Mixed Binary Linear Programming problems (MBLPs) by a collaborative approach using two component algorithms. The first is DCA (Difference of Convex functions Algorithm), an efficient deterministic algorithm in nonconvex programming framework, and the second is VNS (Variable Neighborhood Search), a well known metaheuristic method. The DCA and VNS are executed in parallel. At the end of each cycle, the best-found solution is exchanged between these algorithms via MPI (Message Passing Interface) library. The next cycle starts with the previous best-found solution as an initial solution. The performance of the proposed approach is tested on a set of benchmarks of the Capacitated Facility Location Problem. Numerical experiments show the efficiency of our approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Centre de Calcul de l’université de Bourgogne: Bases de la parallélisation par passage de message: MPI (Message Passing Interface) (2016)
Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001)
Le Thi, H.A., Pham Dinh, T.: A continuous approach for large-scale constrained quadratic zero-one programming. Optimization 45(3), 1–28 (2001). In honor of Professor ELSTER, Founder of the Journal Optimization
Le Thi, H.A., Pham Dinh, T.: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23–46 (2005)
Le Thi, H.A., Pham Dinh, T.: DC programming and DCA: thirty years of developments. Math. Program. 169(1), 5–68 (2018)
Le Thi, H.A., Pham Dinh, T., Muu, L.: Exact penalty in DC programming. Vietnam J. Math. 27(2), 169–178 (1999)
Le Thi, H.A., Pham Dinh, T., Van Ngai, H.: Exact penalty and error bounds in DC programming. J. Glob. Optim. 52(3), 509–535 (2011)
Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)
Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to D.C. programming: theory, algorithm and applications. Acta Mathematica Vietnamica 22(1), 289–355 (1997)
Polacek, M., Hartl, R.F., Doerner, K., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. J. Heuristics 10(6), 613–627 (2004)
Vidović, M., Popović, D., Ratković, B., Radivojević, G.: Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem. Int. Trans. Oper. Res. 24(3), 583–614 (2016)
Yagouni, M., Le Thi, H.A.: A collaborative metaheuristic optimization scheme: methodological issues. In: van Do, T., Le Thi, H.A., Nguyen, N.T. (eds.) Advanced Computational Methods for Knowledge Engineering. AISC, vol. 282, pp. 3–14. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-06569-4_1
Ta, A.S., Le Thi, H.A., Khadraoui, D., Pham Dinh, T.: Solving partitioning-hub location-routing problem using DCA. J. Ind. Manag. Optim. 8(1), 87–102 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Samir, S., Le Thi, H.A. (2019). A Collaborative Approach Based on DCA and VNS for Solving Mixed Binary Linear Programs. In: Nguyen, N., Gaol, F., Hong, TP., Trawiński, B. (eds) Intelligent Information and Database Systems. ACIIDS 2019. Lecture Notes in Computer Science(), vol 11431. Springer, Cham. https://doi.org/10.1007/978-3-030-14799-0_44
Download citation
DOI: https://doi.org/10.1007/978-3-030-14799-0_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-14798-3
Online ISBN: 978-3-030-14799-0
eBook Packages: Computer ScienceComputer Science (R0)