Optimization Algorithms for Allocation Problems

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Algorithms for Multidisciplinary Applications".

Deadline for manuscript submissions: closed (30 June 2021) | Viewed by 11393

Special Issue Editors


E-Mail Website
Guest Editor
Faculty of Behavioural, Management and Social Sciences, University of Twente, 7500 AE Enschede, The Netherlands
Interests: operations research; artificial intelligence; mathematical programming; logistics
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Department of Economics and Business, Universitat Pompeu Fabra, Ramon Trias Fargas, 25-27, 08005 Barcelona, Spain
Interests: optimization; metaheuristics; logistics & transportation; machine learning; home health care
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Departamento de Ingeniería Informática y de Sistemas, Universidad de La Laguna, 38200 San Cristóbal de La Laguna, Spain
Interests: evolutionary computation; meta-heuristics; hyper-heuristics; single/multi/many-objective optimization; machine learning

Special Issue Information

Dear Colleagues,

Allocation problems are a fundamental type of optimization problem in many application areas (e.g., logistics, manufacturing, telecommunications, healthcare). Their main goal is to determine the allocation of resources such as items, workforce, assets, etc. to tasks, activities or spaces, among many others, while optimizing one or several given objective functions.

In optimization, there are several ways to find solutions for allocation problems. They can be broadly divided into exact, approximate, and hybrid techniques. At the same time, depending on the size of the solution space, as well as on the structure of the allocation problem, one can select one or another type of technique to be developed or applied. In this context, recent advancements in optimization methods, as well as novel application cases, have fostered the development of algorithms with the goal of providing high-quality solutions in short periods of time. Further, advancements in the development of efficient exact approaches have permitted an understanding of the problem and the performance evaluation of approximate approaches.

Considering the previous discussion, this Special Issue is aimed at bringing and presenting original research and state-of-the-art developments in algorithmic approaches for solving allocation problems. We also welcome innovative research and real-world cases addressing new problem variants. 

Dr. Eduardo Lalla-Ruiz
Dr. Jesica de Armas
Dr. Eduardo Segredo
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Allocation problems
  • Optimization algorithms
  • Mathematical programming
  • Approximate approaches (e.g., heuristics, metaheuristics)
  • Discrete and continuous optimization
  • Experimental evaluation of algorithms in allocation problems

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

26 pages, 388 KiB  
Article
Late Acceptance Hill-Climbing Matheuristic for the General Lot Sizing and Scheduling Problem with Rich Constraints
by Andreas Goerler, Eduardo Lalla-Ruiz and Stefan Voß
Algorithms 2020, 13(6), 138; https://doi.org/10.3390/a13060138 - 9 Jun 2020
Cited by 13 | Viewed by 5101
Abstract
This paper considers the general lot sizing and scheduling problem with rich constraints exemplified by means of rework and lifetime constraints for defective items (GLSP-RP), which finds numerous applications in industrial settings, for example, the food processing industry and the pharmaceutical industry. To [...] Read more.
This paper considers the general lot sizing and scheduling problem with rich constraints exemplified by means of rework and lifetime constraints for defective items (GLSP-RP), which finds numerous applications in industrial settings, for example, the food processing industry and the pharmaceutical industry. To address this problem, we propose the Late Acceptance Hill-climbing Matheuristic (LAHCM) as a novel solution framework that exploits and integrates the late acceptance hill climbing algorithm and exact approaches for speeding up the solution process in comparison to solving the problem by means of a general solver. The computational results show the benefits of incorporating exact approaches within the LAHCM template leading to high-quality solutions within short computational times. Full article
(This article belongs to the Special Issue Optimization Algorithms for Allocation Problems)
Show Figures

Figure 1

19 pages, 3268 KiB  
Article
A Novel Hybrid Metaheuristic Algorithm for Optimization of Construction Management Site Layout Planning
by Doddy Prayogo, Min-Yuan Cheng, Yu-Wei Wu, A. A. N. Perwira Redi, Vincent F. Yu, Satria Fadil Persada and Reny Nadlifatin
Algorithms 2020, 13(5), 117; https://doi.org/10.3390/a13050117 - 6 May 2020
Cited by 13 | Viewed by 5341
Abstract
Symbiotic organisms search (SOS) is a promising metaheuristic algorithm that has been studied recently by numerous researchers due to its capability to solve various hard and complex optimization problems. SOS is a powerful optimization technique that mimics the simulation of the typical symbiotic [...] Read more.
Symbiotic organisms search (SOS) is a promising metaheuristic algorithm that has been studied recently by numerous researchers due to its capability to solve various hard and complex optimization problems. SOS is a powerful optimization technique that mimics the simulation of the typical symbiotic interactions among organisms in an ecosystem. This study presents a new SOS-based hybrid algorithm for solving the challenging construction site layout planning (CSLP) discrete problems. A new algorithm called the hybrid symbiotic organisms search with local operators (HSOS-LO) represents a combination of the canonical SOS and several local search mechanisms aimed at increasing the searching capability in discrete-based solution space. In this study, three CSLP problems that consist of single and multi-floor facility layout problems are tested, and the obtained results were compared with other widely used metaheuristic algorithms. The results indicate the robust performance of the HSOS-LO algorithm in handling discrete-based CSLP problems. Full article
(This article belongs to the Special Issue Optimization Algorithms for Allocation Problems)
Show Figures

Figure 1

Back to TopTop