Grouping problems are a special type of combinatorial optimization problems that have
gained great relevance because of their numerous real-world applications. The solution …

Complex problems of the current business world need new approaches and new
computational algorithms for solution. Majority of the issues need analysis from different …

Optimization problems especially in a dynamic environment is a hot research area that has
attracted notable attention in the past decades. It is clear from the dynamic optimization …

The development of transport infrastructure is crucial for economic growth, social
connectivity, and sustainable development. Many countries have historically underinvested …

The purpose of this paper is to present a proposal for scheduling shuttle ambulance vehicles
assigned to COVID-19 patients using one of the discrete optimization techniques, namely …

Multidimensional Knapsack problem (MKP) is a well-known, NP-hard combinatorial
optimization problem. Several metaheuristics or exact algorithms have been proposed to …

This chapter is devoted to present a generalized model for scheduling multiple ambulance
vehicles from multiple ambulance centers assigned to evacuate COVID-19 patients. The …

Many problems of practical and theoretical importance within the fields of Artificial
Intelligence and Operations Research are combinatorial. Combinatorial optimization …

As the use and scale of wireless sensor networks has grown, the lack of transmission
spectrum has become a key factor affecting wireless sensor network quality of service. An …

The explosion of Internet traffic mainly due to multimedia services is bringing real challenges
to Internet Service Providers (ISPs). Content Delivery Networks (CDN) aim to face this traffic …