In the wake of e-commerce and its successful diffusion in most commercial activities, last-
mile distribution causes more and more trouble in urban areas all around the globe …

Time-dependent routing amounts to design “best” routes in a graph in which arc traversal
times may vary over the planning horizon. In the last decade, a number of technological …

A traveling salesman problem (TSP) is a well-known NP-complete problem. Traditional TSP
presumes that the locations of customers and the traveling time among customers are fixed …

The rise of e-commerce has increased the demands placed on pickup and delivery
operations, as well as customer expectations regarding the quality of services provided by …

We present a new solution approach for the time-dependent traveling salesman problem
with time windows. This problem considers a salesman who departs from his home, has to …

The flowshop group scheduling problem (FGSP) has become a hot research problem owing
to its practical applications in modern industry in recent years. The FGSP can be regarded …

This article introduces a new algorithm for finding feasible or makespan-optimal solutions of
Traveling Salesman Problems with Time Windows (TSPTWs) and Time-Dependent TSPTWs …

In this paper, we introduce the time window assignment vehicle routing problem (TWAVRP)
with time-dependent travel times. It is the problem of assigning time windows to customers …

Congestion in large cities and populated areas is one of the major challenges in urban
logistics, and should be addressed at different planning and operational levels. The Time …

In this paper, we deal with the Time-Dependent Asymmetric Traveling Salesman Problem
with Time Windows. First, we prove that under special conditions the problem can be solved …