Outputs (7)

An agent based modelling approach for the office space allocation problem (2018)
Presentation / Conference Contribution
Dediu, A., Landa-Silva, D., & Siebers, P.-O. An agent based modelling approach for the office space allocation problem. Presented at 2018 European Modeling and Simulation Symposium (EMSS 2018)

This paper describes an agent based simulation model to create solutions for the office space allocation (OSA) problem. OSA is a combinatorial optimization problem concerned with the allocation of available office space to a set of entities such as p... Read More about An agent based modelling approach for the office space allocation problem.

Adaptive multiple crossover genetic algorithm to solve workforce scheduling and routing problem (2018)
Journal Article
Martínez-Gavara, A., Algethami, H., & Landa-Silva, D. (2018). Adaptive multiple crossover genetic algorithm to solve workforce scheduling and routing problem. Journal of Heuristics, 25(4-5), 753-792. https://doi.org/10.1007/s10732-018-9385-x

The Workforce Scheduling and Routing Problem refers to the assignment of personnel to visits, across various geographical locations. Solving this problem demands tackling numerous scheduling and routing constraints while aiming to minimise the operat... Read More about Adaptive multiple crossover genetic algorithm to solve workforce scheduling and routing problem.

A genetic algorithm with composite chromosome for shift assignment of part-time employees (2018)
Presentation / Conference Contribution
Xue, N., Landa-Silva, D., Triguero, I., & Figueredo, G. P. A genetic algorithm with composite chromosome for shift assignment of part-time employees. Presented at 2018 IEEE Congress in Evolutionary Computation (IEEE CEC 2018)

Personnel scheduling problems involve multiple tasks, including assigning shifts to workers. The purpose is usually to satisfy objectives and constraints arising from management, labour unions and employee preferences. The shift assignment problem is... Read More about A genetic algorithm with composite chromosome for shift assignment of part-time employees.

Fuzzy C-means-based scenario bundling for stochastic service network design (2018)
Presentation / Conference Contribution
Jiang, X., Bai, R., Landa-Silva, D., & Aickelin, U. (2017, November). Fuzzy C-means-based scenario bundling for stochastic service network design. Presented at 2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017, Honolulu, HI, USA

Stochastic service network designs with uncertain demand represented by a set of scenarios can be modelled as a large-scale two-stage stochastic mixed-integer program (SMIP). The progressive hedging algorithm (PHA) is a decomposition method for solvi... Read More about Fuzzy C-means-based scenario bundling for stochastic service network design.

Using goal programming on estimated Pareto fronts to solve multiobjective problems (2018)
Presentation / Conference Contribution
Pinheiro, R. L., Landa-Silva, D., Laesanklang, W., & Constantino, A. A. (2018, January). Using goal programming on estimated Pareto fronts to solve multiobjective problems. Presented at 7th International Conference on Operations Research and Enterprise Systems (ICORES 2018), Funchal, Madeira, Portugal

Modern multiobjective algorithms can be computationally inefficient in producing good approximation sets for highly constrained many-objective problems. Such problems are common in real-world applications where decision-makers need to assess multiple... Read More about Using goal programming on estimated Pareto fronts to solve multiobjective problems.

Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows (2018)
Journal Article
Curtois, T., Landa-Silva, D., Qu, Y., & Laesanklang, W. (2018). Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows. Euro Journal of Transportation and Logistics, 7(2), 151-192. https://doi.org/10.1007/s13676-017-0115-6

© 2018, The Author(s). An effective and fast hybrid metaheuristic is proposed for solving the pickup and delivery problem with time windows. The proposed approach combines local search, large neighbourhood search and guided ejection search in a novel... Read More about Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows.

An evolutionary strategy with machine learning for learning to rank in information retrieval (2018)
Journal Article
Ibrahim, O. A. S., & Landa-Silva, D. (2018). An evolutionary strategy with machine learning for learning to rank in information retrieval. Soft Computing, 22(10), 3171-3185. https://doi.org/10.1007/s00500-017-2988-6

© 2018, Springer-Verlag GmbH Germany, part of Springer Nature. Learning to rank (LTR) is one of the problems attracting researchers in information retrieval (IR). The LTR problem refers to ranking the retrieved documents for users in search engines,... Read More about An evolutionary strategy with machine learning for learning to rank in information retrieval.