The simulation-driven metaheuristic algorithms have been successful in solving numerous
problems compared to their deterministic counterparts. Despite this advantage, the …

This work addresses a novel General Variable Neighborhood Search (GVNS) solution
method, which integrates intelligent adaptive mechanisms to re-order the search operators …

Due to the potential to reduce energy consumption and greenhouse gas emission, electric
vehicles have been widely adopted in ride-hailing services Besides the frequently …

With the growth of e-commerce, various types of last-mile delivery services have emerged to
meet customer needs. Among the most notable of these are “rapid delivery” and “perishable …

There are many sub-tour elimination constraint (SEC) formulations for the traveling
salesman problem (TSP). Among the different methods found in articles, usually three apply …

Multiple traveling salesperson problems (m TSP) are a collection of problems that
generalize the classical traveling salesperson problem (TSP). In a nutshell, an m TSP …

Abstract The Travel Salesman Problem (TSP) consists in finding the minimal-length closed
tour that connects the entire group of nodes of a given graph. We propose to solve such a …

As one of the most popular combinatorial optimization problems, Traveling Salesman
Problem (TSP) has attracted lots of attention from academia since it was proposed …

The No-wait Flowshop Scheduling Problem (NWFSP) has always been a research hotspot
because of its importance in various industries. This paper uses a matheuristic approach …

In last-mile routing, the task of finding a route is often framed as a Traveling Salesman
Problem to minimize travel time and associated cost. However, solutions stemming from this …