Electric vehicle technology is promising to reduce both the costs and environmental impact
of logistics operations. Consequently, much research is being carried out in this field. On the …

The paper develops an approach to the time-constrained, multiple-stop, truck-routing
problem that minimizes the fuel consumption and pollutants emission. Features of …

This work focuses on expressing the TSP with Time Windows (TSPTW for short) as a
quadratic unconstrained binary optimization (QUBO) problem. The time windows impose …

Abstract The Traveling Salesman Problem (TSP) is a classical NP-hard combinatorial
optimization problem with many practical variants. The Lin–Kernighan–Helsgaun (LKH) …

To minimize greenhouse gas emissions, the logistic field has seen an increasing usage of
electric vehicles. The resulting distribution planning problems present new computational …

The travelling salesman problem with time windows is a difficult optimization problem that
arises, for example, in logistics. This paper deals with the minimization of the travel-cost. For …

The overall quality of last-mile delivery in terms of operational costs and customer
satisfaction is primarily affected by traditional logistics planning and the consideration and …

The aircraft maintenance routing problem is one of the most studied problems in the airline
industry. Most of the studies focus on finding a unique rotation that will be repeated by each …

Recently deep reinforcement learning has shown success in solving NP-hard combinatorial
optimization problems such as traveling salesman problems, vehicle routing problems, job …

As we all know, there are a great number of optimization problems in the world. One of the
relatively complicated and high‐level problems is the vehicle routing problem (VRP) …