IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v50y2015icp1-17.html
   My bibliography  Save this article

A genetic algorithm-based decomposition approach to solve an integrated equipment-workforce-service planning problem

Author

Listed:
  • Li, Gang
  • Jiang, Hongxun
  • He, Tian

Abstract

We develop a new genetic algorithm to solve an integrated Equipment-Workforce-Service Planning problem, which features extremely large scales and complex constraints. Compared with the canonical genetic algorithm, the new algorithm is innovative in four respects: (1) The new algorithm addresses epistasis of genes by decomposing the problem variables into evolutionary variables, which evolve with the genetic operators, and the optimization variables, which are derived by solving corresponding optimization problems. (2) The new algorithm introduces the concept of Capacity Threshold and calculates the Set of Efficient and Valid Equipment Assignments to preclude unpromising solution spaces, which allows the algorithm to search much narrowed but promising solution spaces in a more efficient way. (3) The new algorithm modifies the traditional genetic crossover and mutation operators to incorporate the gene dependency in the evolutionary procedure. (4) The new algorithm proposes a new genetic operator, self-evolution, to simulate the growth procedure of an individual in nature and use it for guided improvements of individuals. The new genetic algorithm design is proven very effective and robust in various numerical tests, compared to the integer programming algorithm and the canonical genetic algorithm. When the integer programming algorithm is unable to solve the large-scale problem instances or cannot provide good solutions in acceptable times, and the canonical genetic algorithm is incapable of handling the complex constraints of these instances, the new genetic algorithm obtains the optimal or close-to-optimal solutions within seconds for instances as large as 84 million integer variables and 82 thousand constraints.

Suggested Citation

  • Li, Gang & Jiang, Hongxun & He, Tian, 2015. "A genetic algorithm-based decomposition approach to solve an integrated equipment-workforce-service planning problem," Omega, Elsevier, vol. 50(C), pages 1-17.
    • Handle: RePEc:eee:jomega:v:50:y:2015:i:c:p:1-17
    DOI: 10.1016/j.omega.2014.07.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048314000802
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2014.07.003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Wang, S.M. & Chen, J.C. & Wang, K.-J., 2007. "Resource portfolio planning of make-to-stock products using a constraint programming-based genetic algorithm," Omega, Elsevier, vol. 35(2), pages 237-246, April.
    2. Thibaut Vidal & Teodor Gabriel Crainic & Michel Gendreau & Nadia Lahrichi & Walter Rei, 2012. "A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems," Operations Research, INFORMS, vol. 60(3), pages 611-624, June.
    3. Min, Hokey & Jeung Ko, Hyun & Seong Ko, Chang, 2006. "A genetic algorithm approach to developing the multi-echelon reverse logistics network for product returns," Omega, Elsevier, vol. 34(1), pages 56-69, January.
    4. Ruiz, Rubén & Maroto, Concepciøn & Alcaraz, Javier, 2006. "Two new robust genetic algorithms for the flowshop scheduling problem," Omega, Elsevier, vol. 34(5), pages 461-476, October.
    5. Broos Maenhout & Mario Vanhoucke, 2008. "Comparison and hybridization of crossover operators for the nurse scheduling problem," Annals of Operations Research, Springer, vol. 159(1), pages 333-353, March.
    6. Hanan Luss, 1982. "Operations Research and Capacity Expansion Problems: A Survey," Operations Research, INFORMS, vol. 30(5), pages 907-947, October.
    7. Vallada, Eva & Ruiz, Rubén, 2010. "Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem," Omega, Elsevier, vol. 38(1-2), pages 57-67, February.
    8. Julka, Nirupam & Baines, Tim & Tjahjono, Benny & Lendermann, Peter & Vitanov, Val, 2007. "A review of multi-factor capacity expansion models for manufacturing plants: Searching for a holistic decision aid," International Journal of Production Economics, Elsevier, vol. 106(2), pages 607-621, April.
    9. Yu, Ming-Miin & Chern, Ching-Chin & Hsiao, Bo, 2013. "Human resource rightsizing using centralized data envelopment analysis: Evidence from Taiwan's Airports," Omega, Elsevier, vol. 41(1), pages 119-130.
    10. Nam, Sang-jin & Logendran, Rasaratnam, 1992. "Aggregate production planning -- A survey of models and methodologies," European Journal of Operational Research, Elsevier, vol. 61(3), pages 255-272, September.
    11. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
    12. Noah Gans & Yong-Pin Zhou, 2002. "Managing Learning and Turnover in Employee Staffing," Operations Research, INFORMS, vol. 50(6), pages 991-1006, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ballings, Michel & Van den Poel, Dirk & Bogaert, Matthias, 2016. "Social media optimization: Identifying an optimal strategy for increasing network size on Facebook," Omega, Elsevier, vol. 59(PA), pages 15-25.
    2. Sabar, Nasser R. & Kendall, Graham, 2015. "An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem," Omega, Elsevier, vol. 56(C), pages 88-98.
    3. Gang Li & Joy M. Field & Hongxun Jiang & Tian He & Youming Pang, 2019. "Decision Models for Workforce and Technology Planning in Services," Papers 1909.12829, arXiv.org.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Georgiadis, Patroklos & Athanasiou, Efstratios, 2013. "Flexible long-term capacity planning in closed-loop supply chains with remanufacturing," European Journal of Operational Research, Elsevier, vol. 225(1), pages 44-58.
    2. Glock, Christoph H. & Grosse, Eric H., 2021. "The impact of controllable production rates on the performance of inventory systems: A systematic review of the literature," European Journal of Operational Research, Elsevier, vol. 288(3), pages 703-720.
    3. Ornella Tarola, 2010. "Public Utilities: Privatization without Regulation," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 4(1), pages 062-078, March.
    4. Pan, Quan-Ke & Ruiz, Rubén, 2012. "Local search methods for the flowshop scheduling problem with flowtime minimization," European Journal of Operational Research, Elsevier, vol. 222(1), pages 31-43.
    5. Sabet, Ehsan & Yazdani, Baback & Kian, Ramez & Galanakis, Kostas, 2020. "A strategic and global manufacturing capacity management optimisation model: A Scenario-based multi-stage stochastic programming approach," Omega, Elsevier, vol. 93(C).
    6. Liang, Wen-Yau & Huang, Chun-Che, 2008. "A hybrid approach to constrained evolutionary computing: Case of product synthesis," Omega, Elsevier, vol. 36(6), pages 1072-1085, December.
    7. Martínez-Costa, Carme & Mas-Machuca, Marta & Benedito, Ernest & Corominas, Albert, 2014. "A review of mathematical programming models for strategic capacity planning in manufacturing," International Journal of Production Economics, Elsevier, vol. 153(C), pages 66-85.
    8. Zhao, Ze & Wang, Jianzhou & Zhao, Jing & Su, Zhongyue, 2012. "Using a Grey model optimized by Differential Evolution algorithm to forecast the per capita annual net income of rural households in China," Omega, Elsevier, vol. 40(5), pages 525-532.
    9. Samavati, Mehran & Essam, Daryl & Nehring, Micah & Sarker, Ruhul, 2018. "A new methodology for the open-pit mine production scheduling problem," Omega, Elsevier, vol. 81(C), pages 169-182.
    10. Fernandez-Viagas, Victor & Ruiz, Rubén & Framinan, Jose M., 2017. "A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation," European Journal of Operational Research, Elsevier, vol. 257(3), pages 707-721.
    11. Sachchida Nand Chaurasia & Shyam Sundar & Alok Singh, 2017. "Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates," Operational Research, Springer, vol. 17(1), pages 275-295, April.
    12. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    13. Pan, Quan-Ke & Wang, Ling, 2012. "Effective heuristics for the blocking flowshop scheduling problem with makespan minimization," Omega, Elsevier, vol. 40(2), pages 218-229, April.
    14. Hahn, G.J. & Kuhn, H., 2012. "Simultaneous investment, operations, and financial planning in supply chains: A value-based optimization approach," International Journal of Production Economics, Elsevier, vol. 140(2), pages 559-569.
    15. Onesun Steve Yoo & Guillaume Roels & Charles J. Corbett, 2016. "The Time–Money Trade-Off for Entrepreneurs: When to Hire the First Employee?," Manufacturing & Service Operations Management, INFORMS, vol. 18(4), pages 559-569, October.
    16. Naderi, Bahman & Ruiz, Rubén, 2014. "A scatter search algorithm for the distributed permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 239(2), pages 323-334.
    17. Yenisey, Mehmet Mutlu & Yagmahan, Betul, 2014. "Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends," Omega, Elsevier, vol. 45(C), pages 119-135.
    18. Yasemin Merzifonluoğlu & Joseph Geunes & H.E. Romeijn, 2007. "Integrated capacity, demand, and production planning with subcontracting and overtime options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(4), pages 433-447, June.
    19. Melo, M.T. & Nickel, S. & Saldanha-da-Gama, F., 2009. "Facility location and supply chain management - A review," European Journal of Operational Research, Elsevier, vol. 196(2), pages 401-412, July.
    20. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:50:y:2015:i:c:p:1-17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.