Grou** problems are combinatorial optimization problems, most of them NP-hard, related
to the partition of a set of items into different groups or clusters. Given their numerous real …

This paper thoroughly reviews and analyzes the main characteristics and application
portfolio of the so-called Harmony Search algorithm, a meta-heuristic approach that has …

Last mile delivery shows an increasingly tough challenge for logistics service providers due
to the rapidly expanding e-commerce sales around the globe. To ease the implementation of …

Clustering addresses the problem of assigning similar objects to groups. Since the size of
the clusters is often constrained in practical clustering applications, various capacitated …

Multi-document summarization is used to extract the main ideas of the documents and put
them into a short summary. In multi-document summarization, it is important to reduce …

Community logistics (CL) is a recently proposed delivery strategy designed to deal with e-
commerce last-mile delivery scheduling by dynamically assigning vehicles to designated …

The paper herein presents green p‐median problem (GMP) which uses the adaptive type‐2
neural network for the processing of environmental and sociological parameters including …

Brazil is the world's largest producer of sugarcane and has a great potential for sugar and
ethanol production. Sao Paulo is its main producer state and produced more than 367,450 …

The capacitated p-median problem is a well-known location-allocation problem that is NP-
hard. We proposed an advanced Genetic Algorithm (GA) integrated with an Initial Solution …

This paper presents a novel multi-objective heuristic approach for the efficient distribution of
24-h emergency units. This paradigm is essentially a facility location problem that involves …